Abstract
In knowledge mining, current trend is witnessing the emergence of a growing number of works towards defining “concise and lossless” representations. One main motivation behind is: tagging a unified framework for drastically reducing large sized sets of association rules. In this context, generic bases of association rules – whose backbone is the conjunction of the concepts of minimal generator (MG ) and closed itemset (CI ) – constituted so far irreducible compact nuclei of association rules. However, the inherent absence of a unique MG associated to a given CI offers an “ideal” gap towards a tougher redundancy removal even from generic bases of association rules. In this paper, we adopt the succinct system of minimal generators (SSMG ), as newly redefined in [1], to be an exact representation of the MG set. Then, we incorporate the SSMG into the framework of generic bases to only maintain the succinct generic association rules. After that, we give a thorough formal study of the related inference mechanisms allowing to derive all redundant association rules starting from succinct ones. Finally, an experimental study shows that our approach makes it possible to eliminate without information loss an important number of redundant generic association rules and thus, to only present succinct and informative ones to users.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Hamrouni, T., Ben Yahia, S., Mephu Nguifo, E.: Succinct system of minimal generators: A thorough study, limitations and new definitions. In: Ben Yahia, S., Mephu Nguifo, E., Behlohlavek, R. (eds.) CLA 2006. LNCS (LNAI), vol. 4923, pp. 80–95. Springer, Heidelberg (2008) (this volume)
Ceglar, A., Roddick, J.F.: Association mining. ACM Computing Surveys 38(2) (July 2006)
Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 972–986. Springer, Heidelberg (2000)
Stumme, G., Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis. In: Baader, F., Brewka, G., Eiter, T. (eds.) KI 2001. LNCS (LNAI), vol. 2174, pp. 335–350. Springer, Heidelberg (2001)
Kryszkiewicz, M.: Concise representation of frequent patterns and association rules. In: Habilitation dissertation, Institute of Computer Science, Warsaw University of Technology, Warsaw, Poland (August 2002)
Zaki, M.J.: Mining non-redundant association rules. In: Data Mining and Knowledge Discovery (DMKD), vol. 9(3), pp. 223–248. Springer, Heidelberg (2004)
Gasmi, G., Ben Yahia, S., Mephu Nguifo, E., Slimani, Y.: \(\mathcal{IGB}\): A new informative generic base of association rules. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 81–90. Springer, Heidelberg (2005)
Li, J.: On optimal rule discovery. IEEE Transactions on Knowledge and Data Engineering (TKDE) 18(4), 460–471 (2006)
Pasquier, N., Bastide, Y., Taouil, R., Stumme, G., Lakhal, L.: Generating a condensed representation for association rules. Journal of Intelligent Information Systems 24(1), 25–60. Kluwer Academic Publisher, Dordrecht (2005)
Boulicaut, J.F., Bykowski, A., Rigotti, C.: Free-sets: A condensed representation of Boolean data for the approximation of frequency queries. In: Data Mining and Knowledge Discovery (DMKD), vol. 7(1), pp. 5–22. Springer, Heidelberg (2003)
Calders, T., Goethals, B.: Non-derivable itemset mining. In: Data Mining and Knowledge Discovery (DMKD), vol. 14(1), pp. 171–206. Springer, Heidelberg (2007)
Ohsaki, M., Kitaguchi, S., Okamoto, K., Yokoi, H., Yamaguchi, T.: Evaluation of rule interestingness measures with a clinical dataset on Hepatitis. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS (LNAI), vol. 3202, pp. 362–373. Springer, Heidelberg (2004)
Srikant, R., Vu, Q., Agrawal, R.: Mining association rules with item constraints. In: Proceedings of the 3rd International Conference on Knowledge Discovery in Databases and Data Mining (KDD 1997), Newport Beach, California, USA, pp. 67–73 (August 1997)
Bonchi, F., Lucchese, C.: On condensed representations of constrained frequent patterns. In: Journal of Knowledge and Information Systems, pp. 1–22 (April 2005)
Wille, R.: Restructuring lattices theory: An approach based on hierarchies of concepts. In: Ordered Sets, pp. 445–470. Reidel, Dordrecht-Boston (1982)
Kryszkiewicz, M.: Representative association rules and minimum condition maximum consequence association rules. In: Żytkow, J.M. (ed.) PKDD 1998. LNCS, vol. 1510, pp. 361–369. Springer, Heidelberg (1998)
Dong, G., Jiang, C., Pei, J., Li, J., Wong, L.: Mining succinct systems of minimal generators of formal concepts. In: Zhou, L.-z., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol. 3453, pp. 175–187. Springer, Heidelberg (2005)
Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Heidelberg (1999)
Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining frequent patterns with counting inference. ACM-SIGKDD Explorations 2(2), 66–75 (2000)
Mephu Nguifo, E.: Galois lattice: A framework for concept learning, design, evaluation and refinement. In: Proceedings of the IEEE International Conference on Tools with Artificial Intelligence (ICTAI 1994), New-Orleans, USA, pp. 461–467 (November 1994)
Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing Iceberg concept lattices with Titanic. Journal on Knowledge and Data Engineering (KDE) 2(42), 189–222 (2002)
Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the ACM-SIGMOD International Conference on Management of Data, Washington D. C., USA, pp. 207–216 (May 1993)
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Proceedings of Advances in Knowledge Discovery and Data Mining, pp. 307–328. AAAI Press, Menlo Park (1996)
Deogun, J.S., Jiang, L.: SARM - succinct association rule mining: An approach to enhance association mining. In: Hacid, M.-S., Murray, N.V., Raś, Z.W., Tsumoto, S. (eds.) ISMIS 2005. LNCS (LNAI), vol. 3488, pp. 121–130. Springer, Heidelberg (2005)
Luxenburger, M.: Implications partielles dans un contexte. Mathématiques, Informatique et Sciences Humaines 29(113), 35–55 (1991)
Ben Yahia, S., Mephu Nguifo, E.: Revisiting generic bases of association rules. In: Kambayashi, Y., Mohania, M., Wöß, W. (eds.) DaWaK 2004. LNCS, vol. 3181, pp. 58–67. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hamrouni, T., Ben Yahia, S., Mephu Nguifo, E. (2008). Generic Association Rule Bases: Are They so Succinct?. In: Yahia, S.B., Nguifo, E.M., Belohlavek, R. (eds) Concept Lattices and Their Applications. CLA 2006. Lecture Notes in Computer Science(), vol 4923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78921-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-78921-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78920-8
Online ISBN: 978-3-540-78921-5
eBook Packages: Computer ScienceComputer Science (R0)