Title :
A Fast Algorithm for Mining Rare Itemsets
Author :
Troiano, Luigi ; Scibelli, Giacomo ; Birtolo, Cosimo
Author_Institution :
Dept. of Eng., Univ. of Sannio, Benevento, Italy
fDate :
Nov. 30 2009-Dec. 2 2009
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 :
computational complexity; data mining; NP-hard problem; fast algorithm; large databases; most occurrent patterns; pattern mining; rare itemset mining; Data engineering; Data mining; Deductive databases; Design engineering; Genetics; Intelligent systems; Itemsets; Lattices; NP-hard problem; Transaction databases; APriori; ARIMA; Association Rules; Data Mining; Frequent Itemsets; Rarity; Rate Itemsets;
Conference_Titel :
Intelligent Systems Design and Applications, 2009. ISDA '09. Ninth International Conference on
Conference_Location :
Pisa
Print_ISBN :
978-1-4244-4735-0
Electronic_ISBN :
978-0-7695-3872-3
DOI :
10.1109/ISDA.2009.55
