| 一种基于穷举项类型的完全关联规则算法 |
| |
| 引用本文： | 马晶鑫,马靖善. 一种基于穷举项类型的完全关联规则算法[J]. 渤海大学学报(自然科学版), 2006, 27(1): 66-69 |
| |
| 作者姓名： | 马晶鑫 马靖善 |
| |
| 作者单位： | 1. 中南财经政法大学,湖北,武汉,430074
2. 渤海大学,文理学院,辽宁,锦州,121013 |
| |
| 摘 要： | 提出了完全关联规则挖掘算法。该算法是为了对事务集合D中所包含的所有蕴涵式的关联规则进行支持度和置信度的衡量。研究的核心问题是解决对小规模原子项和稀疏数据集进行有效的穷举项类型，从而进行所有蕴涵式可能性的分析。该算法优点是所有蕴涵式可能性进行了探讨，从而为进一步的数据挖掘和研究作了很好的准备。
|
| 关 键 词： | 关联规则 事务 回溯 支持度 置信度 |
| 文章编号： | 1673-0569(2006)01-0066-04 |
| 收稿时间： | 2005-11-15 |
| 修稿时间： | 2005-11-15 |
A kind of algorithm of complete connection rule based on exhaustion item type |
| |
| MA Jing-xin,MA Jing-shan. A kind of algorithm of complete connection rule based on exhaustion item type[J]. Journal of Bohai University:Natural Science Editio, 2006, 27(1): 66-69 |
| |
| Authors: | MA Jing-xin MA Jing-shan |
| |
| Affiliation: | 1.South Central Finance and Economics Politics and Law University, Wuhan 430074,China;2. Bohai University,College of Liberal Arts and Scienee,Jinzhou 121013,China |
| |
| Abstract: | This thesis puts forward the excavation algorithm of complete connection rule. This algorithm has weighed the sustaining degree and confidence of the containing type of complete connection rule contained inthe business set D. The key issue of the study is to solve the effective exhaustion item type of the small-scale original numerator and sparse data set, so it can make analysis on all the possibilities of the containing type. The advantage of the algorithm is to discuss all the possibilities of the containing type, thcrefore it can make good preparation for excavating the data and studies. |
| |
| Keywords: | connection rule business trace back the sustaining degree confidence |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
