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

几种关联规则数据挖掘算法的实现
引用本文:郑海东,王凯丽.几种关联规则数据挖掘算法的实现[J].电子工程师,2011,37(4):36-37,41.
作者姓名:郑海东  王凯丽
作者单位:1. 贵州大学职业技术学院,贵阳,550025;贵州电子信息职业技术学院,凯里,556000
2. 贵州电子信息职业技术学院,凯里,556000
摘    要:关联规则挖掘是数据挖掘研究的一个重要分支,其目的是为了发现大量数据中项目集之间感兴趣的相关性信息。经过十余年的发展,关联规则挖掘已经成为数据挖掘技术中较为成熟并很重要的一种方法,涉及到多种关联规则挖掘算法。文章重点介绍Apriori算法和FP—tree算法的基本思想、实现流程及其优缺点。

关 键 词:关联规则  数据挖掘  算法

Discusses several Algorithms of Data Mining Based on Affiliated Rules
ZHENG Hai-dong,WANG Kai-li.Discusses several Algorithms of Data Mining Based on Affiliated Rules[J].Electronic Engineer,2011,37(4):36-37,41.
Authors:ZHENG Hai-dong  WANG Kai-li
Affiliation:ZHENG Hai-dong1,2,WANG Kai-li2(1.College of Vocational and Technical,Guizhou University,Guiyang 550025,China,2.Guizhou Vocational Technology College of Electronics and Information,Kaili 556000,China)
Abstract:Affiliated Rules Mining is an important branch of Data Mining;whose purpose is to find large amounts of data between sets of items interest related information.After more than 10 years development,Affiliated Rules Mining has become a mature technology in data mining,and is one of the important ways,involving various Algorithms for Mining Affiliated Rules.The article mainly introduces the basic ideas,implementation process and their advantages and disadvantages of the Apriori algorithm and FP-tree algorithm.
Keywords:affiliated rules  data mining  algorithm  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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