期刊文献+

聚类思想在挖掘关联规则中的运用 被引量:3

Cluster Analysis in Mining Association Rules for Huge Transaction Database
下载PDF
导出
摘要 数据挖掘中的关联分析技术旨在发现大量数据项集之间有趣的关联关系。虽然A priori算法利用剪枝方法有效地提高运算效率,但在处理超大型事务数据库时,仍会存在内存瓶颈问题。按照项集对数据库进行聚类预处理,然后在各个数据簇内进行关联分析以提高运算效率,且簇的数目可根据情况由数据挖掘者根据情况预先指定。通过对该算法的复杂度分析得出在一定条件下运算的时间复杂度确实有所下降的结论。 Association rule mining finds interesting association relationships among a large set of data items. Although the Apriori algorithm can reduce computing times in its prune step,there is stilt a high complexity in dealing with huge transaction database. Some ideal of cluster analysis are applied in Association Rule Mining to reduce the complexity.
出处 《广西师范大学学报(自然科学版)》 CAS 北大核心 2009年第1期117-120,共4页 Journal of Guangxi Normal University:Natural Science Edition
基金 国家863计划资助项目(2007AA01Z126)
关键词 数据挖掘 关联分析 聚类分析 频繁项集 data mining association rule mining cluster analysis frequent itemsets
  • 相关文献

参考文献6

二级参考文献28

  • 1宫雨,武森,尹阿东,高学东.加权关联规则的改进算法[J].计算机工程与应用,2004,40(22):177-179. 被引量:9
  • 2皮德常,秦小麟,王宁生.基于动态剪枝的关联规则挖掘算法[J].小型微型计算机系统,2004,25(10):1850-1852. 被引量:16
  • 3周晓云,孙志挥,倪巍伟.一种基于加权的高效关联规则挖掘算法的设计与实现[J].计算机工程与应用,2004,40(20):17-19. 被引量:10
  • 4尹群,王丽珍,田启明.一种基于概率的加权关联规则挖掘算法[J].计算机应用,2005,25(4):805-807. 被引量:18
  • 5赵红玲,宋瀚涛,牛振东,刘桂山.Web日志挖掘中数据预处理的研究[J].计算机应用研究,2005,22(6):67-69. 被引量:20
  • 6[1]R Agrawal, T Imielinski, A Swami. Mining association rules between sets of items in large databases. In: Peter Buneman, Sushil Ajodia eds. Proc of ACM SIGMOD Conf on Management of Data, New York: ACM Press, 1993. 207~216
  • 7[2]J Han, J Pei. Mining frequent patterns by pattern-growth: Methodology and implications. ACM SIGKDD Explorations (Special Issue on Scalable Data Mining Algorithms), 2000, 2(2): 14~20
  • 8[3]J Han, J Pei, Y Yin. Mining frequent patterns without candidate generation, In: M Dunham, J Naughton, W Chen eds. Proc of 2000 ACM-SIGMOD Int'l Conf on Management of Data (SIGMOD'00). Dallas, TX, New York: ACM Press, 2000. 1~12
  • 9[4]J Roberto, Jr Bayardo. Efficiently mining long patterns from databases. In: Ashutosh Tiwary, Boeing Co eds. Proc of the 1998 ACM-SIGMOD Int'l Conf on Management of Data (SIGMOD'98), New York: ACM Press, 1998. 85~93
  • 10[5]D-I Lin, Z M Kedem. Pincer-Search: A new algorithm for discovering the maximum frequent set. In: Bertram Ludscher, Wolfgang May eds. Proc of the 6th European Conf on Extending database technology, Proceedings, Lecture Note in Computer 1377. Berlin: Springer 1998, 1998. 105~119

共引文献83

同被引文献25

  • 1秦如新,田英杰,陈静,邓乃扬,张海斌.双聚类的关联规则挖掘方法[J].北京工业大学学报,2009,35(4):561-565. 被引量:4
  • 2孔锐,张国宣,施泽生,郭立.基于核的K-均值聚类[J].计算机工程,2004,30(11):12-13. 被引量:46
  • 3TUNG A K H, LU Hong-jun, HAN Jia-wei, et al. Efficient mining of intertransaetion association rules[J]. IEEE Transactions on Knowledge and Data Engineering, 2003,15 (1) : 43-56.
  • 4CAMPELLO R J G B,HRUSCHKA E R. On comparing two sequence of numbers and its applications to clustering analysis[J]. Information Sciences, 2009,179(8) : 1025-1039.
  • 5SHI Na ,LIU Xu-min,GUAN Yong. Research on k-means clustering algorithm :an improved k-means clustering algorithm[C].//Proceedings of the 2010 Third International Symposium on Intelligent Information Technology and Security Informatics. Washington DC :IEEE Comtuter Society, 2010 : 63-67.
  • 6LEE A J T,WANG ehun-sheng,WENG Wan-Yu,et al. An efficient algorithm for mining closed inter-transaction itemsets [J]. Data and Knowledge Engineering, 2008,66 (1) : 68-91.
  • 7BUZIKASHVILI N. Sliding window technique for the Web log analysis[C]//Proceedings of the 16th international conference on World Wide Web. New York:ACM Press ,2007 :1213-1214.
  • 8JAIN A K,DUBES R C. Algorithms for clustering data[M]. Englewood Cliffs ,NJ :Prentice-Hall, 1988 : 1-29.
  • 9DING Shi-fei,XU Li,ZHU Hong,et al. Research and progress of cluster algorithms based on granular computing[J]. International Journal of Digital Content Technology and its Applications, 2010,4 (5) : 96-104.
  • 10PAWLAK Z. Rough set[J]. International Journal of Computer and Information Science, 1982,11 (15):341-356.

引证文献3

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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