摘要
挖掘频繁项集是关联规则算法中的关键问题，提高频繁项集的产生效率是近几年关联规则挖掘领域研究热点之一。该文针对Apriori算法的不足，提出了一种0-1矩阵的改进算法。此改进算法大大减少了访问数据库的次数，提高了系统的运行效率，同时还减少了大量的候选集的产生，节约了存储空间。
Mining the frequence item sets is the critical problem of the Associate rules algorithm. Improving the efficiency of the production frequency item sets is the research hotspot of the Associate rules mining in recent years： This paper aiming at the deficiencies of the Apriori algorithm bring up an improved algorithm. This improved algorithm reduced the times of accessing the database and large numbers of candidate items production and saved the storage area at the same time.
作者
顾琳
黎敬涛
张兴涛
GU Lin,LI Jing-tao,ZHANG Xing-tao（1.Faculty of Computer Science and Information Technology,Yunnan Normal University,Kunming 650091,China; 2.Faculty of Information Engineering and Automation,Kunming University Of Science and Technology, Kunming 650051,China;3.Kunming Railway Mechanical School, Kunming 650208,China）
出处
《电脑知识与技术》
2007年第11期814-816,共3页
Computer Knowledge and Technology
