期刊文献+

关联规则发现中的聚类方法 被引量:2

Clustering Method for Mining Association Rules
下载PDF
导出
摘要 算法MARC(Mining Association Rulesusing Clustering)将聚类技术应用到关联规则的发现上,MARC利用聚类技术压缩交易数据库,从而减少开采算法需要处理的数据量以提高开采效率,同时算法提出了聚类汇总转换的概念用以减轻压缩数据带来的信息丢失。在几个实际数据集上的实验表明该算法可以达到高精度和高性能。 MARC algorithms are proposed to apply clustering analysis to other fields. It integrates clustering into association rules discovery to reduce the size of data sets. It also uses CS (Clustering Summary) transformation to alleviate the loss of information brought by the compression. MARC only needs to scan the database one time. The experiments with several real data sets have demonstrated that MARC can achieve quite well precision and high performance.
出处 《计算机科学》 CSCD 北大核心 2007年第8期180-183,214,共5页 Computer Science
基金 国家科技攻关计划项目(编号:2002BA901A02) 湖北省科技攻关项目(编号:2004AA210B01)
关键词 数据开采 聚类分析 关联规则 Data mining, Clustering analysis, Association rules
  • 相关文献

参考文献5

  • 1Agrawal R,Imielinski T,Swami A N.Mining Association Rules between Sets of Items in Large Databases.In:Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (SIGMOD'93).1993.207-216
  • 2谢坤武,陈世强.一种分类数据的聚类算法.见:全国数据库学术会议(NDBC2006).广州,2006.332-327
  • 3Agrawal R,Srikant R.Fast Algorithms for Mining Association Rules in Large Databases.In:Proceedings of the 20th International Conference on Very Large Data Bases (VLDB'94).1994.487-499
  • 4Toivonen H.Sampling Large Databases for Association Rules.In:Proceedings of 22nd International Conference on Very Large Data Bases (VLDB'96).1996.134-145
  • 5Brin S,Motwani R,Ullman J D,et al.Dynamic Itemset Counting and Implication Rules for Market Basket Data.In:Proceedings of ACM SIGMOD International Conference on Management of Data (SIGMOD'97).1997.255-264

同被引文献7

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部