Skip to main content
Conference Proceedings

Incremental discovering association rules: A concept lattice approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1574 109-113
DOI: 10.1007/3-540-48912-6_15
13Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Concept lattice is an efficient tool for data analysis. Mining association rules is a impor tant subfield of data mining. In this paper we investigate the ability of concept lattice on associate ru les and present an efficient algorithm which genera te the large itemsets increm entally on the basis of Godin’s work.

Cite

CITATION STYLE

APA

Hu, K., Lu, Y., & Shi, C. i. (1999). Incremental discovering association rules: A concept lattice approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1574, pp. 109–113). Springer Verlag. https://doi.org/10.1007/3-540-48912-6_15

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