| 基于剪枝概念格的项集知识表示与挖掘 |
| |
| 引用本文： | 胡学钢,刘 卫,王德兴. 基于剪枝概念格的项集知识表示与挖掘[J]. 计算机工程与应用, 2007, 43(22): 176-178 |
| |
| 作者姓名： | 胡学钢 刘 卫 王德兴 |
| |
| 作者单位： | 合肥工业大学计算机与信息学院,合肥230009;合肥工业大学计算机与信息学院,合肥230009;合肥工业大学计算机与信息学院,合肥230009 |
| |
| 基金项目： | 安徽省自然科学基金 , 国家自然科学基金 |
| |
| 摘 要： | 在研究概念格和项集关系的基础上，将剪枝概念格模型引入数据库中项集的表示与挖掘，利用概念间的关系性质，在构造过程中及时、动态地剪枝，删除与项集求解无关的概念，不丢失信息的同时能有效压缩频繁项集的规模，实验证实了算法良好的性能。
|
| 关 键 词： | 数据挖掘 关联规则 项集 概念格 |
| 文章编号： | 1002-8331（2007）22-0176-03 |
| 修稿时间： | 2007-03-01 |
Representation and mining of itemsets knowledge based on pruned concept lattice |
| |
| 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 |
| |
| Authors: | HU Xue-gang LIU Wei WANG De-xing |
| |
| Affiliation: | School of Computer and Information，Hefei University of Technology，Hefei 230009，China |
| |
| 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. |
| |
| Keywords: | data mining association rules itemsets concept lattice |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
