基于剪枝的约束概念格的渐进式构造算法  

Incremental construction algorithm of constrained concept lattice based on pruning

作　　者：马洋[1] 张继福[1] 张素兰[1] 

机构地区：[1]太原科技大学计算机科学与技术学院,太原030024

出　　处：《计算机应用》2009年第5期1397-1400,共4页journal of Computer Applications

基　　金：国家自然科学基金资助项目(60773014)

摘　　要：约束概念格是数据分析的一种有效工具,在其构造的过程中,大量的内涵之间比较操作是导致格的构造效率低下的主要原因之一。采用剪枝技术来消除构造过程中存在的冗余内涵比较,给出约束概念格渐进式构造算法PCCL。该算法利用父子节点内涵的严格单调关系,自顶向下扫描格节点,减少了新增对象属性集与原概念格节点内涵的比较次数,从而提高了约束概念格的构造效率。最后以天体光谱数据作为形式背景,实验验证了PCCL算法的正确性,且构造效率平均提高了15%以上。An incremental construction algorithm named PCCL of the constrained concept lattice was presented by using pruning technology that eliminated the redundant information in the construction process. By making use of the rigorous monotone relation between father concept＇s intent and child concept＇s intent, all nodes of the constrained concept lattice were scanned from top to down, and the comparative operations between the intents were decreased, thus the efficiency of constructing the constrained concept lattice was improved. Experimental results verify the correctness and validity of PCCL by taking the celestial spectrum data as the formal context.

关 键 词：概念格 冗余信息 剪枝 渐进式构造算法 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]