| 4,343 | 197 | 40 |
| 下载次数 | 被引频次 | 阅读次数 |
文中首先介绍了数据挖掘中关联规则的经典算法——Apriori算法。再从宽度、深度、划分、采样、增量式更新等几个角度对关联规则挖掘进行了分类讨论。然后运用文献查询和比较分析的方法对常见的关联规则挖掘算法进行了概述,主要包括FP-growth算法、DHP算法、Partition算法、FUP算法、CD算法等算法。最后对关联规则挖掘的发展远景进行了展望。
Abstract：First introduces the classical algorithm of association rule mining-Apriori.Then classified discusses the association rule mining from several angles such as width,depth,partition,sampling and incremental updating.It summarizes the commons algorithms of association rule mining through querying documents and comparative analysis.It mainly includes FP-Growth algorithm,DHP algorithm,Partition algorithm,FUP algorithm,CD algorithm and so on.At last prospect the association rule mining.
[1]Han Jiawei,Kamber M.数据挖掘概念与技术[M].范明,孟小峰等,译.北京:机械工业出版社,2001:149-176.
[2]Agrawal R,Imielinski T,Swami A.Mining Association Rulesbetween Sets of Items in Large Databases[C]//Proceedings ofthe 1993 ACM SIGMOD Conference.Washington D C:[s.n.],1993:207-216.
[3]Agrawal.R,Srikant R.Fast Algorithm for Mining AssociationRules[C]//Proceedings of the 20th Very Large Data Bases(VLDB’94)Conference.Santiago,Chile:[s.n.],1994:487-499.
[4]Agrawal R,Srikant R.Fast Algorithm for Mining AssociationRules in Large Databases[R].San Jose,CA:IBM AlmadenResearch Center,1994.
[5]Park J S,Chen M S,Yu P S.An effective hash based algo-rithm for mining association rules[C]//In:Proc.1995 ACMSIGMOD.San Jose,CA:[s.n.],1995:175-186.
[6]Han J,Pei J,Yin Y.Mining frequent patterns without candi-date generation[C]//In Proceeding of the 2000 ACM SIG-MOD Conference on Managerment of Data.Dallas,TX:[s.n.],2000.
[7]Liu J,Pan Y,Wang K,et al.Mining frequent item sets by op-portunisitc projection[C]//Proc.of the Eighth ACM SIGKDDIntl.Conf on Knowledge Discovery and Data Mining.Alberta,Canada:[s.n.],2002:229-238.
[8]Agarwal R,Aggarwal C,Prased V V V.A tree projection al-gorithm for generation of frequent itemsets[J].J.Parallel andDistributed Computing,2001,61(3):350-371.
[9]Savasere A,Omieeinski E,Navathe S.An efficient algorithmfor mining association rules in large databases[C]//Proceed-ings of the 21st International Conference on Very LargeDatabases.Zurich,Switzerland:[s.n.],1995:432-443.
[10]Brin S,Motwani R,Ullman J D.Dynamic Itemset countingand implication rules for market basket data[C]//Proceedingsof the 1997 ACM SIGMOD International Conference on Man-agement of Data.Tucson,Arizona:[s.n.],1997:255-264.
[11]Park J S,Chen M,Yu P S.Using a Hash-Based Method withTransaetion Trimming and Database Scan Reduction for Min-ing Association Rules[J].IEEE Transaction on knowledge anddata engineering,1997,9(5):813-825.
[12]Toivonen H.Sampling Large Databases for Association Rules[C]//Proceedings of 1996 International Conference on VeryLarge Databases(VLDB’96).Bumbay,India:Morgan Kauf-mann,1996:134-145.
[13]Lin J L,Dunhan M H.Mining association rules:Anti-skewalgorithms[C]//Proceedings of the International Conferenceon Data Engingeering.Orlando,Florida:[s.n.],1998.
[14]Cheung D W,Han J,Ng V T.A Fast Distributed Algorithmfor Mining Assoeiation Rules[C]//Proceedings of 1996 Inter-national conference on Parallel and Distributed InformationSystem.Miami Beaeh,FL:[s.n.],1996:31-44.
[15]丁祥武.挖掘时态关联规则[J].武汉交通科技大学学报,1999,23(4):365-367.
[16]高峰,谢剑英.发现关联规则的增量式更新算法[J].计算机工程,2000,26(12):49-50.
[17]Agrawal R,Shafer J.Parallel Mining of Association Rules[J].IEEE Transactions on Knowledge and Data Engineering,1996,8(6):962-969.
[18]Park J S,Chen M S,Yu P S.Efficient Parallel Mining For As-sociation Rules[C]//Proc.4th International Conference Infor-mation and Knowledge management.Baltimore,MD:[s.n.],1995:31-36.
[19]Cheung D W,Ng V,Fu W C.Effieient mining of associationrules in distributed databases[J].IEEE Transactions onKnowledge and Data Engineering,1996,8(1):910-921.
[20]刘颖.关联规则并行算法在医药销售系统中的应用[D].重庆:重庆大学,2004.
基本信息:
中图分类号:TP311.13
引用信息:
[1]王爱平,王占凤,陶嗣干,等.数据挖掘中常用关联规则挖掘算法[J].计算机技术与发展,2010,20(04):105-108.
基金信息:
国家自然科学基金项目(60472065)
2010-04-10
2010-04-10