Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1983))

Abstract

Emerging patterns (EPs) are knowledge patterns capturing contrasts between data classes. In this paper, we propose an information-based approach for classification by aggregating emerging patterns. The constraint-based EP mining algorithm enables the system to learn from large-volume and high-dimensional data; the new approach for selecting representative EPs and efficient algorithm for finding the EPs renders the system high predictive accuracy and short classification time. Experiments on many benchmark datasets show that the resulting classifiers have good overall predictive accuracy, and are often also superior to other state-of-the-art classification systems such as C4.5, CBA and LB.

http://www.ics.uci.edu/_mlearn/MLRepository.html

See § 2 for definitions.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

References

  1. R Agrawal and R Srikant. Fast algorithm for mining association rules. In Proc. VLDB’94, pages 487–499, 1994.

    Google Scholar 

  2. G Dong and J Li. Eficient Mining of emerging patterns: Discovering trends and differences. In Proc. of KDD’99, 1999.

    Google Scholar 

  3. G Dong, X Zhang, L Wong, and J Li. CAEP: Classification by aggregating emerging patterns. In Proc. of DS’99, LNCS 1721, Japan, 1999.

    Google Scholar 

  4. U M Fayyad and K B Irani. Multi-interval discretization of continuous-valued attributes for classification learning. In Proc. of IJCAI’93, 1993.

    Google Scholar 

  5. J Li, G Dong, and K Ramamohanarao. Make use of the most expressive jumping emerging patterns for classification. In Proc. of PAKDD’00, Japan, 2000.

    Google Scholar 

  6. B Liu, W Hsu, and Y Ma. Integrating classification and association rule mining. In Proc. of KDD’98, New York, USA, pages 27–31, August 1998.

    Google Scholar 

  7. M Mehta, R Agrawal, and J Rissanen. SLIQ: A fast scalable classifier for data mining. In Proc. of EDBT’96, Avignon, France, March 1996.

    Google Scholar 

  8. D Meretakis and B Wüthrich. Extending naive bayes classifiers using long itemsets. In Proc. of KDD’99, San Diego, USA, August 1999.

    Google Scholar 

  9. J Rissanen. A universal prior for integers and estimation by minimum description length. Annals of Statistics, 11:416–431, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  10. C Wallace and D Boulton. An information measure for classification. Computer Journal, 11:185–195, 1968.

    MATH  Google Scholar 

  11. C Wallace and J Patrick. Coding decision trees. Machine Learning, 11:7–22, 1993.

    Article  MATH  Google Scholar 

  12. X Zhang, G Dong, and K Ramamohanarao. Exploring constraints to efficiently mine emerging patterns from large high-dimensional datasets. In Proc. of KDD’00, Boston, USA, August 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, X., Dong, G., Ramamohanarao, 1. (2000). Information-Based Classification by Aggregating Emerging Patterns. In: Leung, K.S., Chan, LW., Meng, H. (eds) Intelligent Data Engineering and Automated Learning — IDEAL 2000. Data Mining, Financial Engineering, and Intelligent Agents. IDEAL 2000. Lecture Notes in Computer Science, vol 1983. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44491-2_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-44491-2_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41450-6

  • Online ISBN: 978-3-540-44491-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics