kumulant

kumulant/com.eignex.kumulant.stat.regression.tree/ClassificationTree

ClassificationTree

class ClassificationTree(numClasses: Int, splitCandidates: List<Split>, config: ClassificationTreeConfig = ClassificationTreeConfig(), concurrency: Concurrency = Concurrency.None, leafArmFactory: () -> SeriesStat<ClassCountsResult> = { ClassCountsStat(numClasses, concurrency) }, randomSeed: Int = 0)(source)

Classification mirror of RegressionTree: online VFDT decision tree where each leaf carries a per-class count accumulator and audit leaves track class counts per candidate split. Splits fire when a candidate clears the Hoeffding bound on the configured ClassificationSplitMetric (Gini or information gain).

Concurrency model matches RegressionTree: lock-free leaf updates, single split-conversion lock fired only at split-decision time.

Constructors

ClassificationTree

constructor(numClasses: Int, splitCandidates: List<Split>, config: ClassificationTreeConfig = ClassificationTreeConfig(), concurrency: Concurrency = Concurrency.None, leafArmFactory: () -> SeriesStat<ClassCountsResult> = { ClassCountsStat(numClasses, concurrency) }, randomSeed: Int = 0)

Properties

val nodeCount: Int

Number of internal + leaf nodes currently in the tree.

Functions

fun findLeaf(row: VectorView): ClassificationLeafNode

Walk to the leaf row resolves to.

fun merge(other: ClassificationTree)

Structurally merge other into this tree; other is consumed.

fun mergeSnapshot(other: TreeClassificationNodeResult)

Snapshot merge: same rules as merge but the other side is an immutable result.

fun predict(row: VectorView): Int

Argmax class at the leaf row resolves to.

fun prettyPrint(indent: String = ""): String

Render the tree as nested if-else text.

fun probabilities(row: VectorView): DoubleArray

Probabilities at the leaf row resolves to.

fun reset()

Reset to a single fresh leaf.

fun rootNode(): ClassificationNode

Live root node, for snapshotting.

fun rootSnapshot(): ClassCountsResult

Aggregate class-count snapshot at the root, walking leaves and split carryovers.

fun update(row: VectorView, classLabel: Int, weight: Double = 1.0)

Fold an observation (row, classLabel) into the tree, possibly growing it.

ClassificationTree

constructor(numClasses: Int, splitCandidates: List<Split>, config: ClassificationTreeConfig = ClassificationTreeConfig(), concurrency: Concurrency = Concurrency.None, leafArmFactory: () -> SeriesStat<ClassCountsResult> = { ClassCountsStat(numClasses, concurrency) }, randomSeed: Int = 0)(source)

findLeaf

fun findLeaf(row: VectorView): ClassificationLeafNode(source)

Walk to the leaf row resolves to.

mergeSnapshot

fun mergeSnapshot(other: TreeClassificationNodeResult)(source)

Snapshot merge: same rules as merge but the other side is an immutable result.

merge

fun merge(other: ClassificationTree)(source)

Structurally merge other into this tree; other is consumed.

nodeCount

val nodeCount: Int(source)

Number of internal + leaf nodes currently in the tree.

predict

fun predict(row: VectorView): Int(source)

Argmax class at the leaf row resolves to.

prettyPrint

fun prettyPrint(indent: String = ""): String(source)

Render the tree as nested if-else text.

probabilities

fun probabilities(row: VectorView): DoubleArray(source)

Probabilities at the leaf row resolves to.

reset

fun reset()(source)

Reset to a single fresh leaf.

rootNode

fun rootNode(): ClassificationNode(source)

Live root node, for snapshotting.

rootSnapshot

fun rootSnapshot(): ClassCountsResult(source)

Aggregate class-count snapshot at the root, walking leaves and split carryovers.

update

fun update(row: VectorView, classLabel: Int, weight: Double = 1.0)(source)

Fold an observation (row, classLabel) into the tree, possibly growing it.