期刊文献+

关联规则的高效挖掘算法研究 被引量:5

Research on High Efficiency Algorithm of Association Rules
下载PDF
导出
摘要 关联规则的挖掘是一个重要的数据挖掘问题 ,对其挖掘算法的研究具有十分重要的意义 ,经典的关联规则发现算法是一个多次遍历的算法 ,计算的复杂度较高 .本文给出一种关联规则频繁数据集的发现算法 ,只需对交易序列扫描两次即可发现数据集的频繁数据集 。 Mining association rules is an important data mining problem. It is very important to find out high efficient algorithm of mining it. Traditional algorithm need scan multi pass database. This paper presents a novel algorithm of mining frequency in database. It can reduce the database scan times and to find frequency itemsets and increase the efficiency of the mining algorithm.
作者 王玮 蔡莲红
出处 《小型微型计算机系统》 CSCD 北大核心 2002年第6期708-710,共3页 Journal of Chinese Computer Systems
基金 国家自然科学基金资助 (项目编号 :69875 0 0 8)
关键词 关联规则 高效挖掘算法 数据挖掘 支持度 信任度 知识发现 数据库 data mining association rules support confidence lattice
  • 相关文献

参考文献10

  • 1[1]Fayyad UM , Piatetsky-shapiro G , Smyth P. Knowledge discovery and data mining :towards a unifying framework[C]. In: Proc of the 2nd Int. Conf on Knowledge Discovery and Data Mining (KDD-96). Portland, 1996
  • 2[2]Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in large databases[C]. In: Proc of ACM SIGMOD Conf on Management of Data (SIGMOD93). Washington, 1993, 207~216
  • 3[3]Agrawal R, Mannila H, Srikant R et al. Fast discovery of association rules[A]. In: Fayyed UM, Piatetsky-Shapiro G, Smyth P eds. Advance in Knowledge Discovery and Data Mining[C]. Ca: AAAI Press, 1996, 307~328
  • 4[4]Srikant R, Agrawal R. Mining quantitative association rules in large relational tables[C]. In: Proc of ACM SIGMOD Conf on Management of Data (SIGMOD96). Montreal, 1996, 1~12
  • 5[5]Srikant R, Agrawal R. Mining generalized association rules[C]. In: Proc of the 21st Int Conf on Very Large Databases. Zurich, 1995, 407~419
  • 6[6]Agrawal R, Srikant R. Fast algorithms for mining association rules[C]. In: Proc of the 20st Int Conf on Very Large Databases. Santiago, Chile, 1994, 487~499
  • 7[7]Agrawal R, Srikant R. Fast algorithms for mining association rules[R]. IBM Research Report RJ9839, 1994
  • 8[8]Toivonen H. Sampling large databases for association rules[C]. In: Proc of the 22tht Int Conf on Very Large Databases. Bombay, India, 1996, 1~12
  • 9[9]Sergey Brin, Rajeev Montwani, Craig Silverstein. Beyond Market Baskets: Generalizing association rules to correlations[C]. In: Proc of the 1997 ACM SIGMOD conf on Management of Data (SIGMOD97). Tucson, AZ, 1997, 265~276
  • 10[10]Christian Hidber. Online Association Rules Mining[R]. Technical Report, UCB//GSD-98-1004, Department of Electrical Engineering and Computer Science, University of California at Berkeley..4.

同被引文献20

引证文献5

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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