Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (34): 149-151.DOI: 10.3778/j.issn.1002-8331.2010.34.045
• 数据库、信号与信息处理 • Previous Articles Next Articles
WU Li-feng,WANG Jiang-qing,HOU Rui
Received:
Revised:
Online:
Published:
Contact:
吴立锋,王江晴,侯 睿
通讯作者:
Abstract: The HIUA algorithm has been proposed based on the simultaneous changes of the database and the minimum support.The data structure of proposed algorithm is simple for the usage of the hash-storage structure.It is operated conveniently,and the database is only scanned once.Tested results indicate that,proposed algorithm fully applies the original information,and promotes the efficiency when it is compared with the Apriori algorithm.
摘要: 针对数据库和最小支持度同时发生变化的情况,提出了HIUA算法。该算法利用常用的哈希存储结构,数据结构简单,操作方便、可行,并且只需要扫描数据库一次。同时,通过对其测试结果与经典的Apriori算法进行比较,表明了该算法充分利用了原有的信息,提高了算法的效率。
CLC Number:
TP311
WU Li-feng,WANG Jiang-qing,HOU Rui. Improved incremental updating algorithm for association rules[J]. Computer Engineering and Applications, 2010, 46(34): 149-151.
吴立锋,王江晴,侯 睿. 改进的关联规则增量更新算法[J]. 计算机工程与应用, 2010, 46(34): 149-151.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2010.34.045
http://cea.ceaj.org/EN/Y2010/V46/I34/149