Abstract
Minimal generators (MGs), aka minimal keys, play an important role in many theoretical and practical problem settings involving closure systems that originate in graph theory, relational database design, data mining, etc. As minima of the equivalence classes associated to closures, MGs underlie many compressed representations: For instance, they form premises in canonical implication/association rules – with closures as conclusions – that losslessly represent the entire rule family of a closure system. However, MGs often show an intra-class combinatorial redundancy that makes an exhaustive storage and use impractical. In this respect, the succinct system of minimal generators (SSMG) recently introduced by Dong et al. is a first step towards a lossless reduction of this redundancy. However, as shown elsewhere, some of the claims about SSMG, e.g., its invariant size and lossless nature, do not hold. As a remedy, we propose here a new succinct family which restores the losslessness by adding few further elements to the SSMG core, while theoretically grounding the whole. Computing means for the new family are presented together with the empirical evidences about its relative size w.r.t. the entire MG family and similar structures from the literature.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bastide, Y., et al.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Palamidessi, C., et al. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 972–986. Springer, Heidelberg (2000)
Nehme, K., et al.: On computing the minimal generator family for concept lattices and Icebergs. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol. 3403, pp. 192–207. Springer, Heidelberg (2005)
Bastide, Y., et al.: Mining frequent patterns with counting inference. In: Proceeding of the 6th ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining, vol. 2(2), Boston, Massachusetts, USA, 20-23 August, 2000, pp. 66–75. ACM Press, New York (2000)
Pasquier, N., et al.: Efficient mining of association rules using closed itemset lattices. J. of Information Systems 24(1), 25–46 (1999)
Stumme, G., et al.: Computing iceberg concept lattices with Titanic. J. on Knowledge and Data Engineering (KDE) 2(42), 189–222 (2002)
Hamrouni, T., Ben Yahia, S., Slimani, Y.: Prince: An algorithm for generating rule bases without closure computations. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2005. LNCS, vol. 3589, pp. 346–355. Springer, Heidelberg (2005)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) Proceedings of the 20th International Conference on Very Large Databases, Santiago, Chile, June 1994, pp. 478–499 (1994)
Li, J., et al.: Minimum description length principle: Generators are preferable to closed patterns. In: Proceedings of the 21st National Conference on Artificial Intelligence (AAAI 2006), Boston, Massachusetts, USA, 16-20 July, 2006, pp. 409–414 (2006)
De Raedt, L., Ramon, J.: Condensed representations for inductive logic programming. In: Dubois, D., Welty, C. (eds.) Proceedings of the Ninth International Conference on Principles of Knowledge Representation and Reasoning (KR 2004), Whistler, Canada, pp. 438–446 (2004)
Li, H., et al.: Relative risk and odds ratio: a data mining perspective. In: Proceedings of the 24th ACM SIGMOD-SIGACT-SIGART symposium on Principles Of Database Systems (PODS 2005), Baltimore, Maryland, USA, pp. 368–377. ACM Press, New York (2005)
Calders, T., Rigotti, C., Boulicaut, J.-F.: A survey on condensed representations for frequent sets. In: Boulicaut, J.-F., De Raedt, L., Mannila, H. (eds.) Constraint-Based Mining and Inductive Databases. LNCS (LNAI), vol. 3848, pp. 64–80. Springer, Heidelberg (2006)
Zaki, M.J.: Mining non-redundant association rules. J. of Data Mining and Knowledge Discovery (DMKD) 9, 223–248 (2004)
Li, J.: On optimal rule discovery. IEEE J. on Transactions on Knowledge and Data Engineering (TKDE) 18(4), 460–471 (2006)
Dong, G., et al.: 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)
Hamrouni, T., Ben Yahia, S., Mephu Nguifo, E.: Succinct system of minimal generators: A thorough study, limitations and new definitions. In: Proceedings of the 4th International Conference on Concept Lattices and their Applications (CLA 2006), Hammamet, Tunisia, 30 October – 1 November, 2006, pp. 139–153 (2006)
Ganter, B., Wille, R.: Formal Concept Analysis, p. 283. Springer, Heidelberg (1999)
Hamrouni, T., Ben Yahia, S., Mephu Nguifo, E.: Redundancy-free generic bases of association rules. In: Proceedings of the 8th French Conference on Machine Learning (CAp 2006), Presses Universitaires de Grenoble, Trégastel, France, 22 - 24 May, 2006, pp. 363–378 (2006)
Gély, A., et al.: Uncovering and reducing hidden combinatorics in Guigues-Duquenne bases. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol. 3403, pp. 235–248. Springer, Heidelberg (2005)
Hamrouni, T., Ben Yahia, S., Mephu Nguifo, E.: Generic association rule bases: Are they so succinct? In: Proceedings of the 4th International Conference on Concept Lattices and their Applications (CLA 2006), Hammamet, Tunisia, 30 October – 1 November, 2006, pp. 155–169 (2006)
Armstrong, W.W.: Dependency structures of database relationships. In: Proceedings of IFIP Congress, Geneva, Switzerland, September 1974, pp. 580–583 (1974)
Guigues, J.L., Duquenne, V.: Familles minimales d’implications informatives résultant d’un tableau de données binaires. Mathématiques et Sciences Humaines. 24(95), 5–18 (1986)
Valtchev, P., Duquenne, V.: Towards scalable divide-and-conquer methods for computing concepts and implications. Accepted in the Jounal of Discrete Applied Mathematics (2006)
Calders, T., Goethals, B.: Mining all non-derivable frequent itemsets. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol. 2431, pp. 74–85. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Hamrouni, T., Valtchev, P., Yahia, S.B., Nguifo, E.M. (2007). About the Lossless Reduction of the Minimal Generator Family of a Context. In: Kuznetsov, S.O., Schmidt, S. (eds) Formal Concept Analysis. ICFCA 2007. Lecture Notes in Computer Science(), vol 4390. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70901-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-70901-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70828-5
Online ISBN: 978-3-540-70901-5
eBook Packages: Computer ScienceComputer Science (R0)