| 无最小支持度的关联规则挖掘方法 |
| |
| 引用本文： | 雷红艳,邹汉斌. 无最小支持度的关联规则挖掘方法[J]. 湖南文理学院学报(自然科学版), 2005, 17(2): 65-67 |
| |
| 作者姓名： | 雷红艳 邹汉斌 |
| |
| 作者单位： | 华中科技大学,计算机科学与技术学院,湖北,武汉,430074;湖南文理学院,计算机系,湖南,常德,415000;湖南文理学院,计算机系,湖南,常德,415000 |
| |
| 摘 要： | 关联规则的挖掘是数据挖掘领域的重要研究内容之一.关联规则的挖掘算法大都在用户设置的支持度阈值的限制条件下,挖掘出数据属性之间的关系.但是没有相关领域的专门知识,用户很难设置合适的支持度阈值得到合适的结果.本文在Apriori算法的基础上,提出一种无支持度的关联规则挖掘方法.
|
| 关 键 词： | 关联规则 数据挖掘 最小支持度 Apriori算法 |
| 文章编号： | 1672-6146(2005)02-0065-03 |
| 修稿时间： | 2005-01-11 |
An Method of Mining Association Rule without Minimal Support |
| |
| LEI Hong-yan,ZOU Han-bin. An Method of Mining Association Rule without Minimal Support[J]. Journal of Hunan University of Arts and Science:Natural Science Edition, 2005, 17(2): 65-67 |
| |
| Authors: | LEI Hong-yan ZOU Han-bin |
| |
| Abstract: | Mining association rules is one of important contents in the data mining. Algorithms of mining association rules are almost achieved minging associations of data attributes by user-specified support threshold. However, without specific knowledge, users will have difficulties in setting the support threshold to obtain their required results. In this paper,by virtue of Apriori Apriori an approach of mining association rules without support threshold is presented. |
| |
| Keywords: | Association rule Data mining Minimal support Apriori algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
