| 一种多支持度的关联规则采集算法 |
| |
| 引用本文： | 楼晓鸿,丁宝康. 一种多支持度的关联规则采集算法[J]. 计算机工程, 2001, 27(6): 102-103 |
| |
| 作者姓名： | 楼晓鸿 丁宝康 |
| |
| 作者单位： | 复旦大学计算机科学系, |
| |
| 摘 要： | 关联规则采集是数据采集中的一类重要模型。规则采集算法用来发现数据中所有满足用户指定的最小支持度和最小可信度的子项美联（即规则）。国外某些学者提出了一个多支持度的模型，解决了单支持度模型中可能出现的稀有子项问题。基于该多支持度的模型提出了一种新的数据采集算法。
|
| 关 键 词： | 关联规则 最小可信度 最小支持度 数据采集算法 数据库 |
| 文章编号： | 1000-3428(2001)06-0102-02 |
| 修稿时间： | 2000-11-18 |
An Association Rule Mining Algorithm Based on Multiple Supports |
| |
| LOU Xiaohong,DING Baokang. An Association Rule Mining Algorithm Based on Multiple Supports[J]. Computer Engineering, 2001, 27(6): 102-103 |
| |
| Authors: | LOU Xiaohong DING Baokang |
| |
| Abstract: | Association rule mining is an important model in data mining. Its mining algorithms discover all item associations (or rule) in the data that satisfy the user-specified minimum support (minsup) and minimum confidence (minconf) constraints. In order to avoid rare item problem, Liu Bing proposed a model with multiple minimum supports. This paper proposes a new algorithm based on the multiple minimum model. |
| |
| Keywords: | Data mining Association rule Minimum confidence Minimum support Large itemsets |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
