Run

4203

Task 2170 (Supervised Data Stream Classification) anneal
Uploaded 30-04-2014 by Jan van Rijn

0 likes downloaded by 0 people 0 issues 0 downvotes , 0 total downloads

0 likes downloaded by 0 people 0 issues 0 downvotes , 0 total downloads

Issue | #Downvotes for this reason | By |
---|

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)_b | false |

moa.HoeffdingTree(1)_c | 1.0E-7 |

moa.HoeffdingTree(1)_d | NominalAttributeClassObserver |

moa.HoeffdingTree(1)_e | 1000000 |

moa.HoeffdingTree(1)_g | 200 |

moa.HoeffdingTree(1)_l | NBAdaptive |

moa.HoeffdingTree(1)_m | 33554432 |

moa.HoeffdingTree(1)_n | GaussianNumericAttributeClassObserver |

moa.HoeffdingTree(1)_p | false |

moa.HoeffdingTree(1)_q | 0 |

moa.HoeffdingTree(1)_r | false |

moa.HoeffdingTree(1)_s | InfoGainSplitCriterion |

moa.HoeffdingTree(1)_t | 0.05 |

moa.HoeffdingTree(1)_z | false |

0.4849 Per class |

0.6677 Per class |

0.0301 |

572.8594 |

0.1312 |

0.2778 |

898 Per class |

0.6931 Per class |

0.7628 |

2.585 |

0 |

0.7628 Per class |

0.4724 |

0.3727 |

0.2591 |

0.6952 |

0.0197 |