TY - GEN
T1 - Mining with prelarge trees for record modification
AU - Lin, Chun Wei
AU - Hong, Tzung Pei
AU - Lu, Wen Hsiang
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=52449107777&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=52449107777&partnerID=8YFLogxK
U2 - 10.1109/ICICIC.2008.363
DO - 10.1109/ICICIC.2008.363
M3 - Conference contribution
AN - SCOPUS:52449107777
SN - 9780769531618
T3 - 3rd International Conference on Innovative Computing Information and Control, ICICIC'08
BT - 3rd International Conference on Innovative Computing Information and Control, ICICIC'08
T2 - 3rd International Conference on Innovative Computing Information and Control, ICICIC'08
Y2 - 18 June 2008 through 20 June 2008
ER -