Flow
moa.RandomHoeffdingTree

moa.RandomHoeffdingTree

Visibility: public Uploaded 03-03-2016 by Jan van Rijn Moa_14.11_November_2014 63 runs
0 likes downloaded by 2 people 0 issues 0 downvotes , 2 total downloads
  • Verified_Supervised_Data_Stream_Classification
Issue #Downvotes for this reason By


Loading wiki
Help us complete this description Edit
Moa implementation of RandomHoeffdingTree

Parameters

bbinarySplits: Only allow binary splits.default: false
csplitConfidence: The allowable error in split decision, values closer to 0 will take longer to decide.default: 1.0E-7
dnominalEstimator: Nominal estimator to use.default: NominalAttributeClassObserver
ememoryEstimatePeriod: How many instances between memory consumption checks.default: 1000000
ggracePeriod: The number of instances a leaf should observe between split attempts.default: 200
lleafprediction: Leaf prediction to use.default: NBAdaptive
mmaxByteSize: Maximum memory consumed by the tree.default: 33554432
nnumericEstimator: Numeric estimator to use.default: GaussianNumericAttributeClassObserver
pnoPrePrune: Disable pre-pruning.default: false
qnbThreshold: The number of instances a leaf should observe before permitting Naive Bayes.default: 0
rrandomSeed: Seed for random behaviour of the classifier.default: 1
ssplitCriterion: Split criterion to use.default: InfoGainSplitCriterion
ttieThreshold: Threshold below which a split will be forced to break ties.default: 0.05
zstopMemManagement: Stop growing as soon as memory limit is hit.default: false

0
Runs

List all runs
Parameter:
Rendering chart
Rendering table