Knowledge discovery from very large databases using frequent concept lattices

16Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

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 fromthe frequent concept lattice, since response time after lattice construction is measured almost in seconds.

Cite

CITATION STYLE

APA

Waiyamai, K., & Lakhal, L. (2000). Knowledge discovery from very large databases using frequent concept lattices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1810, pp. 437–445). Springer Verlag. https://doi.org/10.1007/3-540-45164-1_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free