Skip to main content

Lattice Based Associative Classifier

  • Conference paper
Intelligent Information and Database Systems (ACIIDS 2012)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7197))

Included in the following conference series:

  • 2686 Accesses

Abstract

Associative classification aims to discover a set of constrained association rules, called Class Association Rules (CARs). The consequent of a CAR is a singleton and is restricted to be a class label. Traditionally, the classifier is built by selecting a subset of CARs based on some interestingness measure.

The proposed approach for associative classification, called Associative Classifier based on Closed Itemsets (ACCI), scans the dataset only once and generates a set of CARs based on closed itemsets (ClosedCARs) using a lattice based data structure. Subsequently, rule conflicts are removed and a subset of non-conflicting ClosedCARs which covers the entire training set is chosen as a classifier. The entire process is independent of the interestingness measure. Experimental results on benchmark datasets from UCI machine repository reveal that the achieved classifiers are more accurate than those built using existing approaches.

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 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.

References

  1. Agarwal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: 20th International Conference on Very Large Databases, pp. 487–499 (1994)

    Google Scholar 

  2. Antonie, M.L., Zaiane, O.R.: An Associative Classifier Based on Positive and Negative Rules. In: Proceedings of the 9th SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 64–69. ACM Press (2004)

    Google Scholar 

  3. Coenen, F., Leng, P.: Obtaining Best Parameter Values for Accurate Classification. In: Proceedings of 5th International Conference on Data Mining, pp. 549–552 (2005)

    Google Scholar 

  4. Deng, Z., Zheng, X.: Building Accurate Associative Classifier Based on Closed Itemsets and Certainty Factor. In: IEEE Third International Symposium on Intelligent Information Technology Application Workshop, pp. 141–144 (2009)

    Google Scholar 

  5. Gupta, A., Bhatnagar, V., Kumar, N.: Mining Closed Itemsets in Data Stream Using Formal Concept Analysis. In: Bach Pedersen, T., Mohania, M.K., Tjoa, A.M. (eds.) DAWAK 2010. LNCS, vol. 6263, pp. 285–296. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Heravi, M.J., Zaiane, O.R.: A Study on Interestingness Measures for Associative Classifiers. In: ACM Symposium on Applied Computing (2010)

    Google Scholar 

  7. Lan, Y., Chen, G., Wets, G.: Improving Associative Classification by Incorporating Novel Interestingness Measures. In: IEEE International Conference on e-Business Engineering (2005)

    Google Scholar 

  8. Li, W., Han, J., Pei, J.: CMAR: Accurate and Efficient Classification Based on Multiple Class Association Rules. In: Proceedings of the International Conference on Data Mining, pp. 369–376 (2001)

    Google Scholar 

  9. Liu, B., Hsu, W., Ma, Y.: Integrating Classification and Association Rule Mining. In: Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (1998)

    Google Scholar 

  10. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient Mining of Association Rules using Closed Itemset Lattices. Journal of Information Systems 24(1), 25–46 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  11. Sun, Y., Wong, K.C., Wang, Y.: An Overview of Associative Classifiers. In: Proceedings of the International Conference on Data Mining, DMIN, pp. 138–143 (2006)

    Google Scholar 

  12. Thabtah, F.: A Review of Associative Classification Mining. The Knowledge Engineering Review 22, 37–65 (2007)

    Article  Google Scholar 

  13. Quinlan, J.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo (1993)

    Google Scholar 

  14. Yin, X., Han, J.: CPAR: Classification Based on Predictive Association Rules. In: Proceedings of SIAM Conference on Data Mining, pp. 331–335 (2003)

    Google Scholar 

  15. Zaki, M.J.: Generating Non-Redundant Association Rules. In: 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 34–43 (2000)

    Google Scholar 

  16. Zhang, X., Chen, G., Wei, Q.: Building a Highly-compact and Accurate Associative Classifier. Journal of Applied Intelligence 34, 74–86 (2011)

    Article  Google Scholar 

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

Kumar, N., Gupta, A., Bhatnagar, V. (2012). Lattice Based Associative Classifier. In: Pan, JS., Chen, SM., Nguyen, N.T. (eds) Intelligent Information and Database Systems. ACIIDS 2012. Lecture Notes in Computer Science(), vol 7197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28490-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28490-8_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28489-2

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics