摘要
挖掘事务库中的频繁项集是数据挖掘的重要任务之一。文章对求关联规则中频繁项集算法进行了分析,着重叙述了DHP算法的设计思想,并用Prolog语言实现,试图探讨用逻辑推理方法解决数据挖掘问题。
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.
出处
《微电子学与计算机》
CSCD
北大核心
2003年第9期8-10,33,共4页
Microelectronics & Computer
