| 由频繁项集生成关联规则的算法设计和实现 |
| |
| 引用本文： | 冯平,黄名选.由频繁项集生成关联规则的算法设计和实现[J].广西工学院学报,2007,18(1):56-59. |
| |
| 作者姓名： | 冯平 黄名选 |
| |
| 作者单位： | 1. 广西工学院,电控系,广西,柳州,545006
2. 广西师范大学,计算机学院,广西,桂林,541004 |
| |
| 摘 要： | 关联规则挖掘是数据挖掘的一个重要研究方向。关联规则挖掘分为两个阶段:发现频繁项集和由频繁项集产生关联规则。介绍由频繁项集产生关联规则的算法设计,并用VC 6.0实现,程序运行能满足要求。
|
| 关 键 词： | 关联规则 频繁项集 算法设计 数据挖掘 |
| 文章编号： | 1004-6410（2007）01-0056-04 |
| 收稿时间： | 2006-09-25 |
| 修稿时间： | 2006年9月25日 |
Algorithm design and implementation for association rules formed by frequent sets of items |
| |
| FENG Ping,HUANG Ming-xuan.Algorithm design and implementation for association rules formed by frequent sets of items[J].Journal of Guangxi University of Technology,2007,18(1):56-59. |
| |
| Authors: | FENG Ping HUANG Ming-xuan |
| |
| Abstract: | As an important branch of the study of data mining,association rules mining consists of two steps: discovery of frequent sets of items and association rules formed by frequent set of items.The algorithm design and its implementation through VC 6.0 for association rules formed by frequent sets of items were described. And its program can meet the demand of running. |
| |
| Keywords: | association rules frequent sets of items algorithm design data mining |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
