The week's pick
Random Articles
Reseach Article
Ensemble Classification for Drifting Concept
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 80 - Number 11 |
| Year of Publication: 2013 |
| Authors: E. Padmalatha, C. R. K. Reddy, B. Padmaja Rani |
10.5120/13908-1857
|
E. Padmalatha, C. R. K. Reddy, B. Padmaja Rani . Ensemble Classification for Drifting Concept. International Journal of Computer Applications. 80, 11 ( October 2013), 33-36. DOI=10.5120/13908-1857
Abstract
Traditional data mining classifiers are used for mining the static data, in which incremental learning assumed data streams come under stationary distribution where data concepts remain unchanged. The concept of data can be changed at any time in real world application this refers to change in the class definitions over time. Classifier ensembles are rapidly gaining popularity in data mining Community, because they are comparatively more accurate, easy and react better to concept drift than single classifiers. They are general way of boosting classification accuracy. Their modularity provides natural path of absorbing changes by modifying ensemble member. The proposed approach uses ensemble classifiers to improve the accuracy of the classification in data streams . The performance of the classifiers tested with benchmark datasets from UCI machine learning repository. the experimental results prove that this approach great accuracy when comparing to the single classifier.
References
- W . Nick Street, Yong Seog Kim, "A streaming ensemble algorithm (sea) for large-scale classification", In Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, New York, NY, USA, 2001, pp 377-382.
- Pedro Domingos, Geoff Hulten, " Mining High Speed Data Streams",KDD-00 in proceeding of sixth ACM SIGKDD international conference on knowledge discovery and data mining, USA, 2000, pp 71-80.
- Geoff Hulten, Laurie Spencer, Pedro Domingos, "Mining time changing data streams", ACM, USA, 2001, 97-106.
- Haixun Wang, Wei Fan, Philip S. Yu, Jiawei Han, "Mining ConceptDrifting Data Streams Using Ensemble Classifiers", SIGKDD '03,ACM,USA,2003,pp 226-235.
- Mohammad M. Masud, Jing Gao, Latifur Khan, Jiawei Han, and Bhavani Thuraisingham, "A Multi-partition Multi-chunk Ensemble Technique to Classify Concept-Drifting Data Streams" Springer-Verlag, Berlin Heidelberg, 2009, pp 363–375.
- D. J. Newman, S. Hettich, C. L. Blake, and C. J. Merz. UCI repository of machine learning databases, 1998.
- Robert E. Schapire. The strength of weak learnability. Machine Learning, 5(2):197–227,1990.
- Yoav Freund. Boosting a weak learning algorithm by majority. Information andComputation,121(2):256–285,1995.
- Leo Breiman (2001). Random Forests. Machine Learning. 45(1):5-32.
- Leo Breiman (1996). Bagging predictors. Machine Learning. 24(2):123-140.
- Yoav Freund, Robert E. Schapire: Experiments with a new boosting algorithm. In: Thirteenth International Conference on Machine Learning, San Francisco, 148-156, 1996.
- Tin Kam Ho (1998). The Random Subspace Method for Constructing Decision Forests. IEEE Transactions on Pattern Analysis and Machine Intelligence. 20(8):832-844.
- H. Wang, W. Fan, P. S. Yu, and J. Han. Mining conceptdrifting data streams using ensemble classifiers. In KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pages226–235, New York, NY, USA, 2003. ACM Press.
- W. N. Street and Y. Kim. A streaming ensemble algorithm (sea) for large-scale classification. In KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, pages 377–382, New York, NY, USA, 2001. ACM Press.
Index Terms
Keywords