http://www.emgu.com
The MCvDTreeSplit type exposes the following members.
Methods
Name | Description | |
---|---|---|
![]() | Equals |
Indicates whether this instance and a specified object are equal.
(Inherited from ValueType.) |
![]() | Finalize |
Allows an Object to attempt to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection.
(Inherited from Object.) |
![]() | GetHashCode |
Returns the hash code for this instance.
(Inherited from ValueType.) |
![]() | GetType |
Gets the Type of the current instance.
(Inherited from Object.) |
![]() | MemberwiseClone |
Creates a shallow copy of the current Object.
(Inherited from Object.) |
![]() | ToString |
Returns the fully qualified type name of this instance.
(Inherited from ValueType.) |
Fields
Name | Description | |
---|---|---|
![]() | inversed |
When it equals to 1, the inverse split rule is used (i.e. left and right branches are exchanged in the expressions below)
|
![]() | next |
Pointer to the next split in the node split list
|
![]() | quality |
The split quality, a positive number. It is used to choose the best primary split, then to choose and sort the surrogate splits. After the tree is constructed, it is also used to compute variable importance
|
![]() | var_idx |
Index of the variable used in the split
|
Properties
Name | Description | |
---|---|---|
![]() | Order |
Get or Set the Order of this TreeSplit
|
![]() | Subset |
Get the bit array indicating the value subset in case of split on a categorical variable.
The rule is: if var_value in subset then next_node<-left else next_node<-right
|