A Fast Algorithm for Mining Rare Itemsets
Authors:
- Luigi TroianoLTLuigi Troiano
- Giacomo ScibelliGSGiacomo Scibelli
- Cosimo BirtoloCBCosimo Birtolo
- 1 January 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21647143,p. 1149-1155
Abstract
Mining patterns in large databases is a challenging task facing NP-hard problems. Research focused attention on the most occurrent patterns, although less frequent patterns still offer interesting insights. In this paper we propose a new algorithm for discovering infrequent patterns and compare it to other solutions.Keywords
This publication has 9 references indexed in Scilit:
- Towards Rare Itemset Mining2007
- Finding Sporadic Rules Using Apriori-Inverse2005
- The complexity of mining maximal frequent itemsets and maximal frequent patterns2004
- Mining with rarityACM SIGKDD Explorations Newsletter, 2004
- An enhanced a priori algorithm for mining multidimensional association rules2004
- Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree ApproachData Mining and Knowledge Discovery, 2004
- Mining association rules with multiple minimum supports1999
- Parallel mining of association rulesIEEE Transactions on Knowledge and Data Engineering, 1996
- Mining association rules between sets of items in large databases1993