An improvement of posteriori

Authors:
Zhi-Hong Deng
Affiliations:
National Laboratory of Machine Perception, School of Electronics Engineering and Computer Science, Peking University, Beijing, China
Venue:
FSKD'06 Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery
Year:
2006

Citing 7
Cited 0

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Efficiently mining long patterns from databases

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases

Proceedings of the 17th International Conference on Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Towards Efficient Data Re-mining (DRM)

PAKDD '01 Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining
CLOSET+: searching for the best strategies for mining frequent closed itemsets

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

Interactive mining, which is the problem of mining frequent itemsets in a database under different thresholds, is becoming one of the interesting topics in frequent itemsets mining because of needs of practical application. In this paper, we propose a heuristic method for greatly decreasing the number of possible candidates in Poteriori, which is an algorithm based on Apriori for interactive mining. Fewer possible candidates make Poteriori more efficient. Analysis based on an example shows the advantage of our method.