【摘要】 在研究概念格和项集关系的基础上,将剪枝概念格模型引入数据库中项集的表示与挖掘,利用概念间的关系性质,在构造过程中及时、动态地剪枝,删除与项集求解无关的概念,不丢失信息的同时能有效压缩频繁项集的规模,实验证实了算法良好的性能。更多还原

【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.更多还原