Abstract
Data clustering and association rules discovery are two related problems in data mining. In this paper, we propose to integrate these two techniques using the frequent concept lattice data structure — a formal conceptual model that can be used to identify similarities among a set of objects based on their frequent attributes (frequent items). Experimental results show that clusterings and association rules are generated efficiently from the frequent concept lattice, since response time after lattice construction is measured almost in seconds.
Chapter PDF
Similar content being viewed by others
References
I. Bournaud and J.G. Ganascia. Conceptual clustering of complex objects: A generalization space based approach. In 3 th Inter. Conf. on Conceptual Structures (ICCS’95), 1995. 437
C. Carpineto and G. Romano. A lattice conceptual clustering and its application to browsing retrieval. Machine Learning, (24):95–122, 1996. 437, 439
R. Godin and R. Missaoui. An incremental concept formation approach for learning from databases. Theoretical Computer Science: Special Issue on Formal Methods in Databases and Software Engineering, 133:387–419, 1994. 437
R. Godin, R. Missaoui, and H. Alaoui. Incremental Concept Formation Algorithms based on Galois (Concept) Lattices. Computational Intelligence, 11(2):246–267, 1995. 437, 439
T.B. Ho. An approach to concept formation based on formal concept analysis. IEICE Trans. Information and Systems, (5):553–559, 1995. 437, 439
R.E. Kent. Automatic classification. Technical report, Department of Computer and Information Science, University of Arkansas, 1995. 439
N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemset lattices. Journal of Information Systems, 24(1):25–46, 1999. 442
K. Waiyamai. Knowledge Discovery and Management from very large Databases: A Frequent Concept Lattice Approach (In French). Ph.d. thesis, University of Clermont-Ferrand II, France, 1999. 439, 440, 442
K. Waiyamai, R. Taouil, and L. Lakhal. Querying concept lattices in object databases. In 3 th Biennial World Conference on Integrated Design & Process Technology (IDPT’98), pages 280–289, Berlin, Germany, 1998. 440, 442
R. Wille. Restructuring lattices theory: an approach based on hierarchies of concepts. In I. Rival, editor, Ordered Sets, pages 445–470. Dordrecht-Boston, 1982. 437
R. Wille. Concept lattices and conceptual knowledge systems. In Computers Math. Applications, volume 23, pages 493–515. 1992. 437, 439
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Waiyamai, K., Lakhal, L. (2000). Knowledge Discovery from Very Large Databases Using Frequent Concept Lattices. In: López de Mántaras, R., Plaza, E. (eds) Machine Learning: ECML 2000. ECML 2000. Lecture Notes in Computer Science(), vol 1810. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45164-1_44
Download citation
DOI: https://doi.org/10.1007/3-540-45164-1_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67602-7
Online ISBN: 978-3-540-45164-8
eBook Packages: Springer Book Archive