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

基于有向图链式存储的关联规则改进算法
引用本文:张丹丹,孟晓伟.基于有向图链式存储的关联规则改进算法[J].电脑开发与应用,2011,24(1):37-40.
作者姓名:张丹丹  孟晓伟
作者单位:张丹丹(中北大学电子与计算机科学技术学院,太原,030051);孟晓伟(山西省招生考试管理中心,太原,030001)
摘    要:在关联规则数据挖掘领域中,Apriori算法是这个方面的经典算法,但它仍存在许多弊端,为此在Apriori算法的基础上提出了一种基于有向图链式存储的改进算法,此算法根据数据结构中有向图链式存储的结构,将所有事务全部存入链表,无需多次扫描数据库,只在事务链表中完成候选集和频繁集的寻找工作.此方法能够迅速得到候选集的支持度...

关 键 词:数据挖掘  关联规则  Apriori算法  有向图链式存储

Improved Algorithm of Association Rules based on Digraph Chained Storage Structure
Abstract:In the field of association rules data mining,Apriori algorithm is a classical algorithm about mining association rule.But it has also some disadvantages,so this paper points out it’s a kind of be improved algorithm based on the digraph chained storage structure,the algorithm can put all transactions into a list according to digraph chained storage structure of data structure,it dose not need scanning the database frequently and only finding generating candidate item set and frequent item set in the transaction list.This algorithm can get the support of generating candidate item set rapidly,which would discover the frequent item set more effectively.This algorithm has a more mining efficiency than the classical algorithm.
Keywords:data mining  association rules  Apriori algorithm  digraph chained storage structure
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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