DocumentCode :
2887885
Title :
A parameterised algorithm for mining association rules
Author :
Denwattana, Nuansri ; Getta, Janusz R.
Author_Institution :
Sch. of Inf. Technol. & Comput. Sci., Wollongong Univ., NSW, Australia
fYear :
2001
fDate :
2001
Firstpage :
45
Lastpage :
51
Abstract :
A central part of many algorithms for mining association rules in large data sets is a procedure that finds so called frequent itemsets. This paper proposes a new approach to finding frequent itemsets. The approach reduces a number of passes through an input data set and generalises a number of strategies proposed so far. The idea is to analyse a variable number n of itemset lattice levels in p scans through an input data set. It is shown that for certain values of parameters (n,p) this method provides more flexible utilisation of fast access transient memory and faster elimination of itemsets with low support factor. The paper presents the results of experiments conducted to find how the performance of the association rule mining algorithm depends on the values of parameters (n,p)
Keywords :
data mining; software performance evaluation; very large databases; algorithm performance; association rule mining; data mining; experiments; fast access transient memory; frequent itemsets; itemset lattice levels; large data sets; large databases; parameterised algorithm; Association rules; Banking; Computer science; Data mining; Information technology; Itemsets; Lattices; Manufacturing; Marketing and sales; Medical services;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Database Conference, 2001. ADC 2001. Proceedings. 12th Australasian
Conference_Location :
Gold Coast, Qld.
ISSN :
1530-0919
Print_ISBN :
0-7695-0966-5
Type :
conf
DOI :
10.1109/ADC.2001.904463
Filename :
904463
Link To Document :
بازگشت