Nothing Special   »   [go: up one dir, main page]

Skip to main content

New Management Operations on Classifiers Pool to Track Recurring Concepts

  • Conference paper
Data Warehousing and Knowledge Discovery (DaWaK 2012)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7448))

Included in the following conference series:

Abstract

Handling recurring concepts has become of interest as a challenging problem in the field of data stream classification in recent years.  One main feature of data streams is that they appear in nonstationary environments. This means that the concept which the data are drawn from, changes over the time. If after a long enough time, the concept reverts to one of the previous concepts, it is said that recurring concepts has occurred. One solution to this challenge is to maintain a pool of classifiers, each representing a concept in the stream. This paper follows this approach and holds an ensemble of classifiers for each concept. As for each received batch of data, a new classifier is created; there will be a huge amount of classifiers which could not be maintained in the pool. To handle the memory limitations, a maximum number of concepts and classifiers are assumed. So the necessity of managing the concepts and classifiers is obvious. This paper presents a novel algorithm to manage the pool. Some pool management operations including merging and splitting the concepts are introduced. Experimental results show the performance dominance of using our method to the most promising stream classification algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Tsymbal, A.: The Problem of Concept Drift: Definitions and Related Work (2004)

    Google Scholar 

  2. Hosseini, M.J., Ahmadi, Z., Beigy, H.: Pool and Accuracy Based Stream Classification: A new ensemble algorithm on data stream classification using recurring concepts detection. In: Proceedings of International Conference on Data Mining, HaCDAIS Workshop (2011)

    Google Scholar 

  3. Katakis, I., Tsoumakas, G., Vlahavas, I.: Tracking recurring contexts using ensemble classifiers: an application to email filtering. Knowledge and Information Systems 22(3), 371–391 (2009)

    Article  Google Scholar 

  4. Hulten, G., Spencer, L., Domingos, P.: Mining time-changing data streams. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, San Francisco (2001)

    Google Scholar 

  5. Klinkenberg, R., Joachims, T.: Detecting Concept Drift with Support Vector Machines. In: Proceedings of the Seventeenth International Conference on Machine Learning. Morgan Kaufmann Publishers Inc. (2000)

    Google Scholar 

  6. Street, W.N., Kim, Y.: A streaming ensemble algorithm (SEA) for large-scale classification. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, San Francisco (2001)

    Google Scholar 

  7. Oza, N.C.: Online ensemble learning, PhD Thesis, University of California, Berkeley (2001)

    Google Scholar 

  8. Kolter, J.Z., Maloof, M.A.: Dynamic weighted majority: An ensemble method for drifting concepts. Journal of Machine Learning Research (8), 2755–2790 (2007)

    Google Scholar 

  9. Elwell, R., Polikar, R.: Incremental learning of concept drift in nonstationary environments. IEEE Transactions on Neural Networks (99), 1517–1531

    Google Scholar 

  10. Gama, J., Kosina, P.: Tracking Recurring Concepts with Meta-learners. In: Lopes, L.S., Lau, N., Mariano, P., Rocha, L.M. (eds.) EPIA 2009. LNCS, vol. 5816, pp. 423–434. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  11. Gomes, J.B., Menasalvas, E., Sousa, P.A.C.: Tracking Recurrent Concepts Using Context. In: Szczuka, M., Kryszkiewicz, M., Ramanna, S., Jensen, R., Hu, Q. (eds.) RSCTC 2010. LNCS, vol. 6086, pp. 168–177. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  12. Lazarescu, M.M.: A Multi-Resolution Learning Approach to Tracking Concept Drift and Recurrent Concepts. In: 5th IAPR Workshop on Pattern Recognition in Information Systems (PRIS), Miami, USA, pp. 52–61 (2005)

    Google Scholar 

  13. Bifet, A., et al.: Moa: Massive online analysis. The Journal of Machine Learning Research (11), 1601–1604

    Google Scholar 

  14. Zhu, X.: Stream Data Mining repository (2010), http://www.cse.fau.edu/~xqzhu/stream.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hosseini, M.J., Ahmadi, Z., Beigy, H. (2012). New Management Operations on Classifiers Pool to Track Recurring Concepts. In: Cuzzocrea, A., Dayal, U. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2012. Lecture Notes in Computer Science, vol 7448. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32584-7_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32584-7_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32583-0

  • Online ISBN: 978-3-642-32584-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics