| 基于矩阵的频繁项集挖掘算法 |
| |
| 引用本文： | 杨景,郑钟志,宋金歌,段鹏.基于矩阵的频繁项集挖掘算法[J].云南民族大学学报(自然科学版),2010,19(5). |
| |
| 作者姓名： | 杨景 郑钟志 宋金歌 段鹏 |
| |
| 作者单位： | 云南民族大学,数学与计算机科学学院,云南,昆明,650031 |
| |
| 基金项目： | 云南民族大学校内青年基金 |
| |
| 摘 要： | 在所有频繁项集挖掘算法中,Apriori算法一直是一个经典的算法,但是该算法存在的最大缺陷是要进行多次的数据库扫描并且在挖掘过程中产生大量的候选频繁项集,因此效率很低.提出了利用基于矩阵的方法挖掘频繁项集,很好地避免了这个缺陷.
|
| 关 键 词： | 数据挖掘 矩阵 关联规则 Apriori算法 频繁项集 |
A New Algorithm Based on Matrix to Mine Frequent Item Sets |
| |
| YANG Jing,ZHENG Zhong-zhi,SONG Jin-ge,DUAN Peng.A New Algorithm Based on Matrix to Mine Frequent Item Sets[J].Journal of Yunnan Nationalities University:Natural Sciences Edition,2010,19(5). |
| |
| Authors: | YANG Jing ZHENG Zhong-zhi SONG Jin-ge DUAN Peng |
| |
| Institution: | YANG Jing,ZHENG Zhong-zhi,SONG Jin-ge,DUAN Peng(School of Mathematic and Computer Science,Yunnan University of Nationalities,Kunming 650031,China) |
| |
| Abstract: | Apriori algorithm has been considered as a classic algorithm to mine frequent item sets.But its major defect is that the database has to be scanned many times,and there are a large number of candidate item sets in the result.So this algorithm is inefficient.This research proposes a new algorithm based on matrix to mine frequent item sets and it can help overcome such defect. |
| |
| Keywords: | data mining matrix association rule Apriori algorithm frequent item set |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
