计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (22): 176-178.
• 数据库与信息处理 • 上一篇 下一篇
胡学钢，刘 卫，王德兴
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
HU Xue-gang，LIU Wei，WANG De-xing
Received:
Revised:
Online:
Published:
Contact:
摘要： 在研究概念格和项集关系的基础上，将剪枝概念格模型引入数据库中项集的表示与挖掘，利用概念间的关系性质，在构造过程中及时、动态地剪枝，删除与项集求解无关的概念，不丢失信息的同时能有效压缩频繁项集的规模，实验证实了算法良好的性能。
关键词: 数据挖掘, 关联规则, 项集, 概念格
Abstract: The relationship between concept lattice and frequent itemsets is discussed，then the model of Pruned Concept Lattice（PCL） is introduced to represent itemsets in the database，and the scale of itemsets is compressed efficiently.The infrequent concepts is pruned timely and dynamically during the PCL’s construction according to apriori property.The efficiency of the algorithm is shown in the experiments.
Key words: data mining, association rules, itemsets, concept lattice
胡学钢，刘 卫，王德兴. 基于剪枝概念格的项集知识表示与挖掘[J]. 计算机工程与应用, 2007, 43(22): 176-178.
HU Xue-gang，LIU Wei，WANG De-xing. Representation and mining of itemsets knowledge based on pruned concept lattice[J]. Computer Engineering and Applications, 2007, 43(22): 176-178.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2007/V43/I22/176
