摘要
针对数据库和最小支持度同时发生变化的情况,提出了HIUA算法。该算法利用常用的哈希存储结构,数据结构简单,操作方便、可行,并且只需要扫描数据库一次。同时,通过对其测试结果与经典的Apriori算法进行比较,表明了该算法充分利用了原有的信息,提高了算法的效率。
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.
出处
《计算机工程与应用》
CSCD
北大核心
2010年第34期149-151,共3页
Computer Engineering and Applications
基金
国家自然科学基金(No.60841001)
中南民族大学自然科学基金(No.YZQ09003)~~
