An Efficient Algorithm for Incremental Mining of Association Rules

ASIA unversity > 資訊學院 > 資訊工程學系 > 會議論文 > Item 310904400/7521

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/7521

题名:	An Efficient Algorithm for Incremental Mining of Association Rules
作者:	Chang, C. C.;Li, Y. C.;Lee, J. S.
日期:	2005-04
上传时间:	2010-01-29 06:40:21 (UTC+0)
出版者:	Asia University
摘要:	Incremental algorithms can manipulate the results of earlier mining to derive the final mining output in various businesses. This study proposes a new algorithm, called the New Fast UPdate algorithm (NFUP) for efficiently incrementally mining association rules from large transaction database. NFUP is a backward method that only requires scanning incremental database. Rather than rescanning the original database for some new generated frequent itemsets in the incremental database, we accumulate the occurrence counts of newly generated frequent itemsets and delete infrequent itemsets obviously. Thus, NFUP need not rescan the original database and to discover newly generated frequent itemsets. NFUP has good scalability in our simulation.
關聯:	The 15th International Workshop on Research Issues in Data Engineering , pp. 3-10 , 2005-04. Tokyo, Japan.
显示于类别:	[資訊工程學系] 會議論文

文件中的档案:

没有与此文件相关的档案.

在ASIAIR中所有的数据项都受到原著作权保护.