| 一个基于兴趣度的FP-Growth算法改进 |
| |
| 引用本文： | 曾安平,黄永平,阳万安,李广军,唐远翔.一个基于兴趣度的FP-Growth算法改进[J].宜宾学院学报,2008,8(12). |
| |
| 作者姓名： | 曾安平 黄永平 阳万安 李广军 唐远翔 |
| |
| 作者单位： | 1. 宜宾学院,计算机与信息科学系,四川,宜宾644000
2. 宜宾学院,物理与电子工程系,四川,宜宾644000 |
| |
| 基金项目： | 宜宾市科技局科研基金，宜宾学院青年基金 |
| |
| 摘 要： | 人们已经提出了许多用于高效地发现大规模数据库中关联规则的算法，但它们大多会产生大量的关联规则，这些规则中包含很多用户不感兴趣的垃圾规则，且只能发现正项的关联规则。因此，引入兴趣度的概念，对FP-Growth算法进行改造，发现一些用户真正感兴趣的有用关联规则，这些规则允许包含负项规则。
|
| 关 键 词： | 兴趣度 关联规则 支持度 置信度 FP-Growth INFP-Growth |
A Improved Algorithm Based on Interest Degree for FP-Growth |
| |
| Authors: | ZENG An-ping HUANG Yong-ping YANG Wan-an LI Guang-jun TANG Yuan-xiang |
| |
| Institution: | ZENG An-ping1,HUANG Yong-ping2,YANG Wan-an1,LI Guang-jun1,TANG Yuan-xiang1 (1.Computer Science Department,Yibin University,Yibin 644000,China,2.Physics , Electronic Information Science Department,China) |
| |
| Abstract: | Association rules mining is an important research topic in data mining area,which has been successfully applied to the commercial domains.For this reason,many approaches have been proposed to mine association rules,but large numbers of association rules,which are only the positive-item rules and include a lot of no use rules,are gotten from them.In the article,it puts forward an improved algorithm on the basis of the FP-Growth algorithm.By the interest degree of the new algorithm,some useful and negative-it... |
| |
| Keywords: | FP-Growth INFP-Growth |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
