| 基于图的频繁项集挖掘 |
| |
| 引用本文： | 刘丽.基于图的频繁项集挖掘[J].湖南城建高等专科学校学报,2009(3):68-70. |
| |
| 作者姓名： | 刘丽 |
| |
| 作者单位： | [1]华中科技大学计算机学院,武汉430074 [2]长沙航空职业技术学院计算机与信息工程系,长沙410014 |
| |
| 摘 要： | 通过对Apriori算法的频繁项目集的分析研究，给出了基于图的频繁项集挖掘算法．该算法在求频繁K-项集的过程中只需一次扫描数据库，避免了Apriori算法需多次扫描数据库的不足。同时，由于在有向图中利用有限节点之间的路径求频繁K-项集，该算法减少了Apriori算法中需多次进行连接运算的不足。
|
| 关 键 词： | 数据挖掘 关联规则 有向图 频繁项目集 |
Graph-based Frequent Item-set Mining |
| |
| LIU Li.Graph-based Frequent Item-set Mining[J].Journal of Hunan Urban Construction College,2009(3):68-70. |
| |
| Authors: | LIU Li |
| |
| Affiliation: | LIU Li ( 1. Computer Science Academy, Huazhong University of Science and Technology, Wuhan 430074, China; 2. Deparment of Computer and Information Engineering, Changsha Aeronautical Vocational and Technical College, Changsha 410014, China) |
| |
| Abstract: | By means of an analysis and study of finding frequent itemsets which is the key step of Apriori Algorithm, the paper proposes a graph-based frequent item-set mining algorithm using this ways, in seeking frequent K-item-set, the scanning database only once is needed. That which avoids the deficiency. And means, The multiple times scanning database is needed in Apriori Algorithm. Also, in a directed graph, frequent K-item-set is saught by using the path between finite nodes, so this reduces the deficiency of multiple joint calculation needed in apriori algorithm. |
| |
| Keywords: | Data mining association rules directed graph frequent itemsets |
| 本文献已被 维普 等数据库收录！ |
|
