Skip to main content
SpringerLink
Log in

Mining Classification Rules without Support: an Anti-monotone Property of Jaccard Measure

  • Conference paper
Discovery Science (DS 2011)

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

Included in the following conference series:

Abstract

We propose a general definition of anti-monotony, and study the anti-monotone property of the Jaccard measure for classification rules. The discovered property can be inserted in an Apriori-like algorithm and can prune the search space without any support constraint. Moreover, the algorithm is complete since, it outputs all interesting rules with respect to the measure of Jaccard. The proposed pruning strategy can then be used to efficiently find nuggets of knowledge.

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

Access this chapter

Log in via an institution
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. Agrawal, R., Imieliski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Buneman, P., Jajodia, S. (eds.) ACM SIGMOD International Conference on Management of Data, pp. 207–216. ACM Press, New York (1993)

    Google Scholar 

  2. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) 20th International Conference on Very Large Data Bases, pp. 478–499. Morgan Kaufmann, San Francisco (1994)

    Google Scholar 

  3. Asuncion, A., Newman, D.: UCI machine learning repository (2007), http://www.ics.uci.edu/~mlearn/MLRepository.html

  4. Azevedo, P., Jorge, A.: Comparing rule measures for predictive association rules. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladenič, D., Skowron, A. (eds.) ECML 2007. LNCS (LNAI), vol. 4701, pp. 510–517. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Bahri, E., Lallich, S.: FCP-Growth: Class itemsets for class association rules. In: International Florida Intelligence Research Society Conference. AAAI Press, Menlo Park (2009)

    Google Scholar 

  6. Borgelt, C.: Efficient implementations of apriori and eclat. In: Workshop on Frequent Item Set Mining Implementations. CEUR Workshop Proceedings 90 (2003)

    Google Scholar 

  7. Geng, L., Hamilton, H.J.: Interestingness measures for data mining: A survey. ACM Computing Surveys 38(3, Article 9) (2006)

    Google Scholar 

  8. Han, J., Cheng, H., Xin, D., Yan, X.: Frequent pattern mining: current status and future directions. Data Mining and Knowledge Discovery 15(1), 55–86 (2007)

    Article  MathSciNet  Google Scholar 

  9. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Chen, W., Naughton, J.F., Bernstein, P.A. (eds.) ACM SIGMOD International Conference on Management of Data, pp. 1–12. ACM, New York (2000)

    Google Scholar 

  10. Hébert, C., Crémilleux, B.: A unified view of objective interestingness measures. In: Perner, P. (ed.) MLDM 2007. LNCS (LNAI), vol. 4571, pp. 533–547. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Jaccard, P.: Étude comparative de la distribution florale dans une portion des Alpes et du Jura. Bulletin de la Société Vaudoise des Sciences Naturelles 37, 547–579 (1901)

    Google Scholar 

  12. Jalali-Heravi, M., Zaïane, O.R.: A study on interestingness measures for associative classifiers. In: 25th ACM Symposium on Applied Computing, SAC 2010, pp. 1039–1046. ACM, New York (2010)

    Chapter  Google Scholar 

  13. Jovanoski, V., Lavrac, N.: Classification rule learning with apriori-c. In: Brazdil, P.B., Jorge, A.M. (eds.) EPIA 2001. LNCS (LNAI), vol. 2258, pp. 44–135. Springer, Heidelberg (2001)

    Google Scholar 

  14. Le Bras, Y., Lenca, P., Lallich, S.: On optimal rule mining: A framework and a necessary and sufficient condition of antimonotonicity. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, T.-B. (eds.) PAKDD 2009. LNCS, vol. 5476, pp. 705–712. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  15. Le Bras, Y., Lenca, P., Lallich, S.: Mining interesting rules without support requirement: a general universal existential upward closure property. Annals of Information Systems 8(Part 2), 75–98 (2010), 8232

    Article  Google Scholar 

  16. Le Bras, Y., Lenca, P., Moga, S., Lallich, S.: All-monotony: A generalization of the all-confidence antimonotony. In: 4th International Conference on Machine Learning and Applications, pp. 759–764 (2009)

    Google Scholar 

  17. Le Bras, Y., Meyer, P., Lenca, P., Lallich, S.: A robustness measure of association rules. In: Balcázar, J.L., Bonchi, F., Gionis, A., Sebag, M. (eds.) ECML PKDD 2010. LNCS, vol. 6322, pp. 227–242. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  18. Lenca, P., Meyer, P., Vaillant, B., Lallich, S.: On selecting interestingness measures for association rules: user oriented description and multiple criteria decision aid. European Journal of Operational Research 184(2), 610–626 (2008)

    Article  MATH  Google Scholar 

  19. Li, J.: On optimal rule discovery. IEEE Transactions on Knowledge and Data Engineering 18(4), 460–471 (2006)

    Article  MathSciNet  Google Scholar 

  20. Li, J., Fu, A.W.-C., He, H., Chen, J., Jin, H., McAullay, D., Williams, G., Sparks, R., Kelman, C.: Mining risk patterns in medical data. In: Grossman, R., Bayardo, R.J., Bennett, K.P. (eds.) 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 770–775. ACM, New York (2005)

    Google Scholar 

  21. Liu, B., Hsu, W., Ma, Y.: Integrating classification and association rule mining. In: Agrawal, R., Stolorz, P.E., Piatetsky-Shapiro, G. (eds.) 4th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 80–86. AAAI Press, Menlo Park (1998)

    Google Scholar 

  22. Morishita, S., Sese, J.: Transversing itemset lattices with statistical metric pruning. In: 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 226–236. ACM, New York (2000)

    Google Scholar 

  23. Ng, R.T., Lakshmanan, L.V.S., Han, J., Pang, A.: Exploratory mining and pruning optimizations of constrained association rules. In: Haas, L.M., Tiwary, A. (eds.) ACM SIGMOD International Conference on Management of Data, pp. 13–24. ACM Press, New York (1998)

    Google Scholar 

  24. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Information Systems 24(1), 25–46 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  25. Savasere, A., Omiecinski, E., Navathe, S.B.: An efficient algorithm for mining association rules in large databases. In: Dayal, U., Gray, P.M.D., Nishio, S. (eds.) 21th International Conference on Very Large Data Bases, pp. 432–444. Morgan Kaufmann, San Francisco (1995)

    Google Scholar 

  26. Segond, M., Borgelt, C.: Item set mining based on cover similarity. In: Huang, J.Z., Cao, L., Srivastava, J. (eds.) PAKDD 2011, Part II. LNCS, vol. 6635, pp. 493–505. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  27. Suzuki, E.: Pitfalls for categorizations of objective interestingness measures for rule discovery. In: Gras, R., Suzuki, E., Guillet, F., Spagnolo, F. (eds.) Statistical Implicative Analysis, Theory and Applications. SCI, vol. 127, pp. 383–395. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  28. Tan, P.-N., Kumar, V., Srivastava, J.: Selecting the right objective measure for association analysis. Information Systems 4(29), 293–313 (2004)

    Article  Google Scholar 

  29. Wang, K., He, Y., Cheung, D.W.: Mining confident rules without support requirement. In: 10th International Conference on Information and Knowledge Management, pp. 89–96. ACM, New York (2001)

    Google Scholar 

  30. Xiong, H., Tan, P.-N., Kumar, V.: Mining strong affinity association patterns in data sets with skewed support distribution. In: 3rd IEEE International Conference on Data Mining, pp. 387–394. IEEE Computer Society, Los Alamitos (2003)

    Chapter  Google Scholar 

  31. Yao, Y., Chen, Y., Yang, X.: A measurement-theoretic foundation for rule interestingness evaluation. In: Workshop on Foundations and New Directions in Data Mining in the 3rd IEEE International Conference on Data Mining, pp. 221–227. IEEE Computer Society, Los Alamitos (2003)

    Google Scholar 

  32. Zaki, M.J.: Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering 12(3), 372–390 (2000)

    Article  Google Scholar 

  33. Zaki, M.J.: Mining non-redundant association rules. Data Mining and Knowledge Discovery 9(3), 223–248 (2004)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. UMR CNRS 3192 Lab-STICC, Institut Telecom; Telecom Bretagne, France

    Yannick Le Bras & Philippe Lenca

  2. Laboratoire ERIC, Université de Lyon, Lyon 2, France

    Stéphane Lallich

  3. Université européenne de Bretagne, France

    Yannick Le Bras & Philippe Lenca

Authors
  1. Yannick Le Bras
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe Lenca
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stéphane Lallich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Software Systems, Tampere University of Technology, P. O. Box 553, 33101, Tampere, Finland

    Tapio Elomaa

  2. Department of Information and Computer Science, Aalto University School of Science, P.O. Box 15400, 00076, Aalto, Finland

    Jaakko Hollmén

  3. Helsinki Institute for Information Technology (HIIT), Finland

    Heikki Mannila

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Le Bras, Y., Lenca, P., Lallich, S. (2011). Mining Classification Rules without Support: an Anti-monotone Property of Jaccard Measure. In: Elomaa, T., Hollmén, J., Mannila, H. (eds) Discovery Science. DS 2011. Lecture Notes in Computer Science(), vol 6926. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24477-3_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24477-3_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24476-6

  • Online ISBN: 978-3-642-24477-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation