An algorithm for mining lower closed itemsets

Authors:
Tian-rui Li;Ming Qing;Jun Ma;Yang Xu
Affiliations:
Department of mathematics, School of Science, Southwest Jiaotong University, Chengdu, China;Department of mathematics, School of Science, Southwest Jiaotong University, Chengdu, China;Department of mathematics, School of Science, Southwest Jiaotong University, Chengdu, China;Department of mathematics, School of Science, Southwest Jiaotong University, Chengdu, China
Venue:
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Year:
2004

Citing 5
Cited 1

Exploratory mining and pruning optimizations of constrained associations rules

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Mining association rules with multiple minimum supports

KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Multi-level organization and summarization of the discovered rules

Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining Multiple-Level Association Rules in Large Databases

IEEE Transactions on Knowledge and Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases

On a mathematical relationship between the fixed point and the closed itemset in association rule mining

AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The generalized association rule base(GARB) presented by Li(2003) can efficiently solve the problem of quantity of rule in the process of acquiring rule by traditional association rule mining algorithms. Therefore, how to deduce all rules contained in the rule of GARB becomes an urgent issue in order to support more effective decision-making. In this paper, the notation of lower closed itemset of an itemset was proposed and some properties of it are proved. Then, it is concluded that the above problem can be solved if all the lower closed itemsets of frequent closed itemset(FCI) are obtained. Finally, an algorithm for mining all lower closed itemsets of an itemset was given and its validity is proved.