DocumentCode :
2637071
Title :
Mining with Prelarge Trees for Record Modification
Author :
Lin, Chun-Wei ; Hong, Tzung-Pei ; Lu, Wen-Hsiang
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Nat. Cheng Kung Univ., Tainan
fYear :
2008
fDate :
18-20 June 2008
Firstpage :
328
Lastpage :
328
Abstract :
In this paper, the structure of the prelarge tree is proposed to maintain association rules for record modification based on the concept of pre-large itemsets. Due to the properties of the pre-large concept, the proposed algorithm can achieve a good execution time for tree maintenance especially when each time a small number of records are modified. Experimental results show that the proposed prelarge-tree maintenance algorithm has a good performance for handling updated records.
Keywords :
data mining; tree data structures; association rules; prelarge itemsets; prelarge-tree maintenance algorithm; record modification; tree maintenance; Association rules; Bidirectional control; Clustering algorithms; Computer science; Costs; Data mining; Itemsets; Maintenance engineering; Transaction databases; Tree data structures;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Innovative Computing Information and Control, 2008. ICICIC '08. 3rd International Conference on
Conference_Location :
Dalian, Liaoning
Print_ISBN :
978-0-7695-3161-8
Electronic_ISBN :
978-0-7695-3161-8
Type :
conf
DOI :
10.1109/ICICIC.2008.363
Filename :
4603517
Link To Document :
بازگشت