Incrementally Optimized Decision Tree for Mining Imperfect Data Streams
暂无分享,去创建一个
[1] Geoff Holmes,et al. MOA: Massive Online Analysis , 2010, J. Mach. Learn. Res..
[2] Stuart J. Russell,et al. Online bagging and boosting , 2005, 2005 IEEE International Conference on Systems, Man and Cybernetics.
[3] Richard Brendon Kirkby,et al. Improving Hoeffding Trees , 2007 .
[4] João Gama,et al. Accurate decision trees for mining high-speed data streams , 2003, KDD '03.
[5] João Gama,et al. Learning decision trees from dynamic data streams , 2005, SAC '05.
[6] Geoff Hulten,et al. Mining high-speed data streams , 2000, KDD '00.
[7] Céline Rouveirol,et al. Machine Learning: ECML-98 , 1998, Lecture Notes in Computer Science.
[8] Carla E. Brodley,et al. Pruning Decision Trees with Misclassification Costs , 1998, ECML.
[9] Simon Fong,et al. Moderated VFDT in Stream Mining Using Adaptive Tie Threshold and Incremental Pruning , 2011, DaWaK.
[10] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .
[11] Xue Li,et al. OcVFDT: one-class very fast decision tree for one-class classification of data streams , 2009, SensorKDD '09.
[12] Geoff Hulten,et al. Mining time-changing data streams , 2001, KDD '01.
[13] Sattar Hashemi,et al. Flexible decision tree for data stream classification in the presence of concept change, noise and missing values , 2009, Data Mining and Knowledge Discovery.
[14] Geoff Holmes,et al. New Options for Hoeffding Trees , 2007, Australian Conference on Artificial Intelligence.
[15] João Gama,et al. Learning decision trees from dynamic data streams , 2005, SAC '05.
[16] João Gama,et al. Issues in evaluation of stream learning algorithms , 2009, KDD.