Bulk Loading Hierarchical Mixture Models for Efficient Stream Classification

  • Philipp Kranen
  • Ralph Krieger
  • Stefan Denker
  • Thomas Seidl
Conference paper

DOI: 10.1007/978-3-642-13672-6_32

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6119)
Cite this paper as:
Kranen P., Krieger R., Denker S., Seidl T. (2010) Bulk Loading Hierarchical Mixture Models for Efficient Stream Classification. In: Zaki M.J., Yu J.X., Ravindran B., Pudi V. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2010. Lecture Notes in Computer Science, vol 6119. Springer, Berlin, Heidelberg

Abstract

The ever growing presence of data streams led to a large number of proposed algorithms for stream data analysis and especially stream classification over the last years. Anytime algorithms can deliver a result after any point in time and are therefore the natural choice for data streams with varying time allowances between two items. Recently it has been shown that anytime classifiers outperform traditional approaches also on constant streams. Therefore, increasing the anytime classification accuracy yields better performance on both varying and constant data streams. In this paper we propose three novel approaches that improve anytime Bayesian classification by bulk loading hierarchical mixture models. In experimental evaluation against four existing techniques we show that our best approach outperforms all competitors and yields significant improvement over previous results in term of anytime classification accuracy.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Philipp Kranen
    • 1
  • Ralph Krieger
    • 1
  • Stefan Denker
    • 1
  • Thomas Seidl
    • 1
  1. 1.Data Manangement and Exploration DepartmentRWTH Aachen UniversityGermany

Personalised recommendations