| 挖掘关联规则频繁项集的算法研究及其Prolog实现 |
| |
| 引用本文： | 崔志明,汤亚玲.挖掘关联规则频繁项集的算法研究及其Prolog实现[J].微电子学与计算机,2003,20(9):8-10,33. |
| |
| 作者姓名： | 崔志明 汤亚玲 |
| |
| 作者单位： | 苏州大学智能信息处理及应用研究所,苏州,215006 |
| |
| 摘 要： | 挖掘事务库中的频繁项集是数据挖掘的重要任务之一。文章对求关联规则中频繁项集算法进行了分析，着重叙述了DHP算法的设计思想，并用Prolog语言实现，试图探讨用逻辑推理方法解决数据挖掘问题。
|
| 关 键 词： | 数据挖掘 数据库 知识发现 关联规则 频繁项集 算法 Prolog语言 |
Research and Realization Using Prolog on Mining Frequent Items Algorithm of Association Rules |
| |
| CUI Zhi-ming,Tang Ya-ling.Research and Realization Using Prolog on Mining Frequent Items Algorithm of Association Rules[J].Microelectronics & Computer,2003,20(9):8-10,33. |
| |
| Authors: | CUI Zhi-ming Tang Ya-ling |
| |
| Abstract: | The mining of frequent items in transactional database is an important task of Data mining.This paper analyzes the frequent items algorithm of association rules,and puts stress on describing the idea of DHP algorithm and realizes it in Prolog.Finally we try to discuss the how to resolve the data mining problem using logical reasoning way. |
| |
| Keywords: | Data mining Frequent items Direct Hashing and Pruning Logical Reasoning |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
