Incrementally optimized decision tree for noisy big data

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2012, Pages 36-44

  Yang, Hang ^a   Fong, Simon ^a  

^a UNIVERSITY OF MACAU   (Macao)

Author keywords

Data stream mining; Decision tree classification; Incremental optimization; Optimized very fast decision tree

Indexed keywords

BIG DATUM; DATA STREAM MINING; DECISION TREE CLASSIFICATION; DECISION-TREE ALGORITHM; DEGREE-OF-KNOWLEDGE; HIGH-SPEED DATA; INCREMENTAL OPTIMIZATION; MODEL SIZE; NOISY DATA STREAMS; ONLINE DATA; PRE-PROCESSING; REAL-WORLD APPLICATION;

ALGORITHMS; COMPUTER SYSTEMS PROGRAMMING; DATA COMMUNICATION SYSTEMS; DATA PROCESSING; DECISION TREES; ELECTRONIC DATA INTERCHANGE; OPTIMIZATION;

DATA MINING;

EID: 84866615880     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2351316.2351322     Document Type: Conference Paper

References (15)

1. th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD'00), ACM, New York, NY, USA, pp. 71-80.
2. th international conference on Data Warehousing and Knowledge Discovery (DaWak2011), LNCS, Springer Berlin/Heidelberg, pp. 471-483.
3. th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD'03), ACM, New York, NY, USA, pp. 523-528.
4. Quinlan R, 1986. Induction of Decision Trees, Machine Learning, 1(1), pp.81-106.
5. Quinlan R, 1993. C4.5: Programs for Machine Learning, Morgan Kaufmann, San Francisco.
6. Breiman L., Friedman J.H., Olshen R.A. and Stone C.J., 1984. 'Classification and Regression Trees', in Wadsworth & Brooks/Cole Advanced Books & Software, Monterey, CA.
7. th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD'01), ACM, New York, NY, USA, pp. 97-106.
8. th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD2005), LNCS, Springer Berlin/Heidelberg, pp. 495-502.
9. Bifet A., Holmes G., Kirkby R., and Pfahringer B., 2010. "MOA: Massive Online Analysis", Journal of Machine Learning Research vol. 11, pp. 1601-1604.
10. Oza N., and Russell S., 2001. Online bagging and boosting. In Artificial Intelligence and Statistics, Morgan Kaufmann pp.105-112.
11. Bifet, A., Holmes, G., Pfahringer, B., Kirkby, R., Gavalda, R. 2009. "New ensemble methods for evolving data streams". In Proc 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'09). ACM, New York, NY, pp.139-147.
12. Pfahringer B., Holmes G., and Kirkby R., 2007. New options for Hoeffding trees, in Proc. of 20th Australian joint conference on Advances in artificial intelligence, pp. 90-99.
13. Pfahringer B., Holmes G., and Kirkby R. 2007. 'New options for hoeffding trees'. In Procs of 20th Australian joint conference on Advances in artificial intelligence (AI'07), Mehmet A. Orgun and John Thornton (Eds.). Springer- Verlag, Berlin, Heidelberg, pp.90-99.
14. Hashemi S., Yang Y. 2009. 'Flexible decision tree for data stream classification in the presence of concept change, noise and missing values', Data Mining and Knowledge Discovery (2009) Vol. 19, Issue 1, pp.95-131.
15. Bifet A. and Gavalda R. 2007. "Learning from timechanging data with adaptive windowing". In Proc. of SIAM International Conference on Data Mining, pp. 443-448.