Packages

object DecisionTreeC45

DecisionTreeC45 is the companion object provides factory methods.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DecisionTreeC45
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def apply(xy: MatriD, isCont: Array[Boolean], fn: Strings = null, k: Int = 2, cn: Strings = null, vc: Array[Int] = null, td: Int = 0): DecisionTreeC45

    Create a decision tree for the given combined matrix where the last column is the response/classification vector.

    Create a decision tree for the given combined matrix where the last column is the response/classification vector.

    xy

    the data vectors along with their classifications stored as rows of a matrix

    isCont

    Boolean value to indicate whether according feature is continuous

    fn

    the names for all features/variables

    k

    the number of classes

    cn

    the names for all classes

    vc

    the value count array indicating number of distinct values per feature

    td

    the maximum tree depth to allow (defaults to 0 => number of features, -1 no constraint

  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  7. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  8. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  9. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  11. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  12. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  13. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  15. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  16. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  17. def test(xy: MatriD, fn: Strings, isCont: Array[Boolean], k: Int = 2, cn: Strings = null, vc: Array[Int] = null, td: Int = 0): DecisionTreeC45

    Test the decision tree on the given dataset passed in as a combined matrix.

    Test the decision tree on the given dataset passed in as a combined matrix.

    xy

    the data vectors along with their classifications stored as rows of a matrix

    fn

    the names for all features/variables

    isCont

    Boolean value to indicate whether according feature is continuous

    k

    the number of classes

    cn

    the names for all classes

    vc

    the value count array indicating number of distinct values per feature

    td

    the maximum tree depth to allow (defaults to 0 => number of features, -1 no constraint

  18. def toString(): String
    Definition Classes
    AnyRef → Any
  19. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  20. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  21. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped