Skip to main content

Classification Rule Mining for a Stream of Perennial Objects

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 6826))

Abstract

We study classification over a slow stream of complex objects like customers or students. The learning task must take into account that an object’s label is influenced by incoming data from adjoint, fast streams of transactions, e.g. customer purchases or student exams, and that this label may even change over time. This task involves combining the streams, and exploiting associations between the target label and attribute values in the fast streams. We propose a method for the discovery of classification rules over such a confederation of streams, and we use it to enhance a decision tree classifier. We show that the new approach has competitive predictive power while building much smaller decision trees than the original classifier.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aydin, T., Güvenir, H.A.: Learning interestingness of streaming classification rules. In: Aykanat, C., Dayar, T., Körpeoğlu, İ. (eds.) ISCIS 2004. LNCS, vol. 3280, pp. 62–71. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Aydın, T., Güvenir, H.A.: Modeling interestingness of streaming classification rules as a classification problem. In: Savacı, F.A. (ed.) TAINN 2005. LNCS (LNAI), vol. 3949, pp. 168–176. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Catlett, J.: Megainduction: Machine Learning on Very Large Databases. Ph.D. thesis, University of Sydney (1991)

    Google Scholar 

  4. Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 693–703. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Chi, Y., Wang, H., Yu, P.S., Muntz, R.: Moment: Maintaining closed frequent itemsets over a stream sliding window. In: Proceedings of the International Conference on Data Mining, ICDM 2004 (2004)

    Google Scholar 

  6. Domingos, P., Hulten, G.: Mining high-speed data streams. In: Proceedings of the International Conference on Knowledge Discovery in Databases, KDD 2000, pp. 71–80. ACM, New York (2000)

    Google Scholar 

  7. Ferrer-Troyano, F., Aguilar-Ruiz, J.S., Riquel Jose, C.: Data streams classification by incremental rule learning with parameterized generalization. In: ACM Symposium on Applied Computing, SAC 2006, pp. 657–661. ACM, New York (2006), http://doi.acm.org/10.1145/1141277.1141428

  8. Gupta, A., Kumar, N., Bhatnagar, V.: Incremental classification rules based on association rules using formal concept analysis. In: Perner, P., Imiya, A. (eds.) MLDM 2005. LNCS (LNAI), vol. 3587, pp. 11–20. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Hidber, C.: Online association rule mining. Tech. Rep. UCB/CSD-98-1004, EECS Department, University of California, Berkeley (1998), http://www.eecs.berkeley.edu/Pubs/TechRpts/1998/5677.html

  10. Hulten, G., Spencer, L., Domingos, P.: Mining time-changing data streams. In: Proceedings of International Conference on Knowledge Discovery in Databases, KDD 2001. ACM, New York (2001)

    Google Scholar 

  11. Kroegel, M.A.: On Propositionalization for Knowledge Discovery in Relational Databases. Ph.D. thesis, University of Magdeburg, Germany (2003)

    Google Scholar 

  12. McGovern, A., Hiers, N., Collier, M., Gagne II, D.J., Brown, R.A.: Spatiotemporal relational probability trees. In: Proceedings of the International Conference on Data Mining, ICDM 2008 (2008)

    Google Scholar 

  13. Siddiqui, Z.F., Spiliopoulou, M.: Combining multiple interrelated streams for incremental clustering. In: Winslett, M. (ed.) SSDBM 2009. LNCS, vol. 5566, pp. 535–552. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  14. Siddiqui, Z.F., Spiliopoulou, M.: Stream clustering of growing objects. In: Gama, J., Costa, V.S., Jorge, A.M., Brazdil, P.B. (eds.) DS 2009. LNCS, vol. 5808, pp. 433–440. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  15. Siddiqui, Z.F., Spiliopoulou, M.: Tree induction over perennial objects. In: Gertz, M., Ludäscher, B. (eds.) SSDBM 2010. LNCS, vol. 6187, pp. 640–657. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  16. Veloso, A., Meira, J.W., Carvalho, M., Possas, B., Parthasarathy, S., Zaki, J.: Mining frequent itemsets in evolving databases. In: Proceedings of the 2nd SIAM International Conference on Data Mining (2002)

    Google Scholar 

  17. Yu, P.S., Chi, Y.: Association rule mining on streams. In: Encyclopedia Database Systems (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Siddiqui, Z.F., Spiliopoulou, M. (2011). Classification Rule Mining for a Stream of Perennial Objects. In: Bassiliades, N., Governatori, G., Paschke, A. (eds) Rule-Based Reasoning, Programming, and Applications. RuleML 2011. Lecture Notes in Computer Science, vol 6826. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22546-8_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22546-8_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22545-1

  • Online ISBN: 978-3-642-22546-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics