DocumentCode :
2335217
Title :
Discovery of association rules in tabular data
Author :
Richards, G. ; Rayward-Smith, V.J.
Author_Institution :
Sch. of Inf. Syst., East Anglia Univ., Norwich, UK
fYear :
2001
fDate :
2001
Firstpage :
465
Lastpage :
472
Abstract :
In this paper we address the problem of finding all association rules in tabular data. An algorithm, ARA, for finding rules, that satisfy clearly specified constraints, in tabular data is presented. ARA is based on the dense miner algorithm but includes an additional constraint and an improved method of calculating support. ARA is tested and compared with our implementation of dense miner; it is concluded that ARA is usually more efficient than dense miner and is often considerably more so. We also consider the potential for modifying the constraints used in ARA in order to find more general rules
Keywords :
data mining; ARA algorithm; association rule discovery; constraints; dense miner algorithm; tabular data; Association rules; Data analysis; Data mining; Diesel engines; Information systems; Spatial databases; Testing; Transaction databases; Wheels;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Mining, 2001. ICDM 2001, Proceedings IEEE International Conference on
Conference_Location :
San Jose, CA
Print_ISBN :
0-7695-1119-8
Type :
conf
DOI :
10.1109/ICDM.2001.989553
Filename :
989553
Link To Document :
بازگشت