Incremental Discovering Association Rules: A Concept Lattice Approach

Authors:
Keyun Hu;Yuchang Lu;Chunyi Shi
Affiliations:
-;-;-
Venue:
PAKDD '99 Proceedings of the Third Pacific-Asia Conference on Methodologies for Knowledge Discovery and Data Mining
Year:
1999

Citing 5
Cited 2

Knowledge acquisition by methods of formal concept analysis

Proceedings of the conference on Data analysis, learning symbolic and numeric knowledge
Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Data Mining: An Overview from a Database Perspective

IEEE Transactions on Knowledge and Data Engineering
Rough Sets and Concept Lattices

RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
Search for Concepts and Dependencies in Databases

RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery

Concept Approximation in Concept Lattice

PAKDD '01 Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining
A hybrid index structure for set-valued attributes using itemset tree and inverted list

DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I

Quantified Score

Hi-index	0.00

Visualization

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.