| 关联规则中支持度变化的数据重挖掘算法研究 |
| |
| 引用本文： | 朱晓东,戴悦.关联规则中支持度变化的数据重挖掘算法研究[J].价值工程,2007,26(7):111-113. |
| |
| 作者姓名： | 朱晓东 戴悦 |
| |
| 作者单位： | 南京信息工程大学经济管理学院,南京210044 |
| |
| 基金项目： | 江苏省青年社会科学基金 |
| |
| 摘 要： | 使用关联规则进行数据挖掘时,使用者为了达到一定的挖掘效果,经常需要不断地改变关联规则的支持度阈值(support)。文中提出了一种从大型数据库中挖掘关联规则的快速算法。该算法以经典的Apriori算法为基础,可以在提出新的支持度后,直接在首次挖掘的基础上进行再一次挖掘。结果表明,它较Apriori算法的实现速度有明显的提高。
|
| 关 键 词： | 数据挖掘 关联规则 支持度阈值 算法 |
| 文章编号： | 1006-4311（2007）07-0111-03 |
Algorithms Research for Re-mining of Association Rules Based on Support Changes |
| |
| Zhu Xiaodong,Dai Yue.Algorithms Research for Re-mining of Association Rules Based on Support Changes[J].Value Engineering,2007,26(7):111-113. |
| |
| Authors: | Zhu Xiaodong Dai Yue |
| |
| Institution: | School of Economics and Management,Nanjing University of Information Engineering,Nanjing 210044,China |
| |
| Abstract: | When users mine associating rules,they need to change support continuously in order to achieve their results.In this paper,we present a new and fast algorithm for mining associating rules in large database.The algorithm is based on the traditional Apriori.And it can re-mine the database based on the first mining results in light of support changes. |
| |
| Keywords: | data mining association rules support algorithms |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
