首页 | 本学科首页   官方微博 | 高级检索  
     检索      

数据挖掘关联规则Apriori算法的优化
引用本文:陈则芝,李冬梅.数据挖掘关联规则Apriori算法的优化[J].山西大同大学学报(自然科学版),2008,24(4):35-37.
作者姓名:陈则芝  李冬梅
作者单位:[1]巢湖职业技术学院计算机应用技术系,安徽巢湖238000; [2]山东经济学院数理经济研究所,山东济南250014
摘    要:关联规则挖掘研究是数据挖掘研究的一项重要的内容.Apriori算法是挖掘关联规则的经典算法,但存在一些不足之处.本文在Apriori算法基础上,提出了基于链表数据结构的关联规则改进算法.由于该算法只需对交易数据库进行一次检索,故能大量减少所需的I/O次数,提高了系统的性能.

关 键 词:数据挖掘  关联规则  链表  频繁项集

Improvement of Apriori Algorithm for Association Rules of Data Mining
CHEN Ze-zhi,LI Dong-mei.Improvement of Apriori Algorithm for Association Rules of Data Mining[J].Journal of Shanxi Datong University(Natural Science Edition),2008,24(4):35-37.
Authors:CHEN Ze-zhi  LI Dong-mei
Institution:CHEN Ze-zhi, LI Dong-mei (1. Computer Department, Chaohu Vocational and Technical College, Chaohu Anhui, 238000; 2. Institute of Quantitative Economy, Shandong Economic University, Jinan Shandong, 250014)
Abstract:Mining association rule is one in the most important topics in data mining. The Apriori algorithm is a classical algorithm in mining association rules. There exist some shortcomings in the algorithm. Based on Apriori algorithm, the article realizes the improved algorithm with linked list data structure. This improved algorithm scans the database only once, so it reduces the times of input and output, thus the mining speed increases.
Keywords:data mining  association rule  linked list  frequent item sets
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号