DEVELOPMENT... OpenML
Run
177465

Run 177465

Task 7382 (Supervised Data Stream Classification) BNG(autos,10000,10) Uploaded 23-02-2015 by Jason
0 likes downloaded by 0 people 0 issues 0 downvotes , 0 total downloads
Issue #Downvotes for this reason By


Flow

moa.HoeffdingTree(1)A Hoeffding tree (VFDT) is an incremental, anytime decision tree induction algorithm that is capable of learning from massive data streams, assuming that the distribution generating examples does not change over time. Hoeffding trees exploit the fact that a small sample can often be enough to choose an optimal splitting attribute. This idea is supported mathematically by the Hoeffding bound, which quantifies the number of observations (in our case, examples) needed to estimate some statistics within a prescribed precision (in our case, the goodness of an attribute).
moa.HoeffdingTree(1)_bfalse
moa.HoeffdingTree(1)_c1.0E-7
moa.HoeffdingTree(1)_dNominalAttributeClassObserver
moa.HoeffdingTree(1)_e1000000
moa.HoeffdingTree(1)_g200
moa.HoeffdingTree(1)_lNBAdaptive
moa.HoeffdingTree(1)_m33554432
moa.HoeffdingTree(1)_nGaussianNumericAttributeClassObserver
moa.HoeffdingTree(1)_pfalse
moa.HoeffdingTree(1)_q0
moa.HoeffdingTree(1)_rfalse
moa.HoeffdingTree(1)_sInfoGainSplitCriterion
moa.HoeffdingTree(1)_t0.05
moa.HoeffdingTree(1)_zfalse

Result files

xml
Description

XML file describing the run, including user-defined evaluation measures.

arff
Predictions

ARFF file with instance-level predictions generated by the model.

18 Evaluation measures

Area under ROC curve
0.8407
Per class
Confusion matrix
F measure
0.5998
Per class
Kappa
0.4849
KB relative information score
554470.5618
Mean absolute error
0.1349
Mean prior absolute error
0.2449
Number of instances
1000000
Per class
Precision
0.5966
Per class
Predictive accuracy
0.6049
Prior entropy
2.8074
Recall
0.6049
Per class
Relative absolute error
0.5507
Root mean prior squared error
0.3499
Root mean squared error
0.2829
Root relative squared error
0.8085