Run
1154

Run 1154

Task 158 (Supervised Data Stream Classification) BNG(mfeat-zernike,nominal,1000000) Uploaded 10-04-2014 by Jan van Rijn
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.

20 Evaluation measures