| 一种基于信息表的关联规则挖掘方法 |
| |
| 引用本文： | 汪际和,陈平,王新.一种基于信息表的关联规则挖掘方法[J].云南民族大学学报(自然科学版),2010,19(6). |
| |
| 作者姓名： | 汪际和 陈平 王新 |
| |
| 作者单位： | 云南民族大学,数学与计算机科学学院,云南,昆明,650500 |
| |
| 基金项目： | 云南民族大学青年基金(09QN10) |
| |
| 摘 要： | 在Apriori算法中,需要多次扫描数据库,并且对候选集的支持度计算比较繁琐,本文利用等价关系的概念,在信息表上计算候选集的支持度计数并寻找频繁项集,且只需扫描数据库1次,提高了挖掘效率,同时保留了包含频繁项集的事务.
|
| 关 键 词： | 等价关系 关联规则 信息表 |
A Method for Association Rule Mining Based on the Information Table |
| |
| WANG Ji-he,CHEN Ping,WANG Xin.A Method for Association Rule Mining Based on the Information Table[J].Journal of Yunnan Nationalities University:Natural Sciences Edition,2010,19(6). |
| |
| Authors: | WANG Ji-he CHEN Ping WANG Xin |
| |
| Institution: | WANG Ji-he,CHEN Ping,WANG Xin(School of Mathematics and Computer Science,Yunnan University of Nationalities,Kunming 650500,China) |
| |
| Abstract: | The Apriori algorithm requires scanning many times the database and frequent calculation of the support of candidate sets.This study uses the equivalence relation for calculating the support of candidate sets and finds frequent item sets in the information tables.It requires only one scanning,thus,an improvement of the association rule mining while keeping the contents of the frequent item sets. |
| |
| Keywords: | equivalence relation association rule information table |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
