case class FeatureNode(f: Int, branches: HashMap[Int, Node], path: List[(Int, Int)], nu: VectoI) extends Node with Cloneable with Product with Serializable
The FeatureNode class is for internal nodes.
- f
the feature/variable number used for splitting
- branches
maps the branch value, e.g., f2 has values 0, 1, 3, for a node
- path
the path from the current node to the root {(parent node feature, branch)}
- nu
the frequency count
- Alphabetic
- By Inheritance
- FeatureNode
- Serializable
- Serializable
- Product
- Equals
- Node
- Cloneable
- Cloneable
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
-
new
FeatureNode(f: Int, branches: HashMap[Int, Node], path: List[(Int, Int)], nu: VectoI)
- f
the feature/variable number used for splitting
- branches
maps the branch value, e.g., f2 has values 0, 1, 3, for a node
- path
the path from the current node to the root {(parent node feature, branch)}
- nu
the frequency count
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
- val branches: HashMap[Int, Node]
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
copy(vc: Array[Int]): Node
Copy a node and all of its child nodes.
-
def
deepCopy(curNode: Node, vc: Array[Int]): Node
This method deep copies a node all the way down by creating new instances of feature node.
This method deep copies a node all the way down by creating new instances of feature node. This is required while pruning.
- curNode
the current node
- vc
the value count
- Definition Classes
- Node
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- val f: Int
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- val nu: VectoI
-
val
nu_sum: Int
The sum of frequency counts
The sum of frequency counts
- Definition Classes
- Node
- val path: List[(Int, Int)]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- var threshold: Double
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )