基于剪枝的概念格渐进式构造  

Pruning based incremental construction of concept lattice

作　　者：胡立华[1] 张继福[1] 张素兰[1] 

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

出　　处：《计算机应用》2006年第7期1659-1661,共3页journal of Computer Applications

基　　金：国家863计划项目(2003AA133060)

摘　　要：概念格是形式概念分析中的核心数据结构。然而,随着需要分析处理的数据量日益剧增,概念格的构造效率成为一个关键问题。采用剪枝方法,消除了概念格构造过程中产生的冗余信息,提出了一种基于剪枝的概念格渐进式构造算法(Pruning based Concept Lattice,PCL),从而减少了概念格内涵的比较次数,提高了概念格的构造效率。采用恒星天体光谱数据作为形式背景,实验验证了算法PCL的正确性和有效性。Concept lattice is the core data structure of formal concept analysis. However, with the sharp increasing of the data to deal with and analyze, its construction efficiency became the key problem. An incremental algorithm PCL of constructing concept lattice based on pruning was presented through eliminating the redundancy information in the construction process by pruning. It decreased the comparative amount of the intent of concept lattice and improved the efficiency of the concept lattice＇s construction. The experiment results prove the correctness and validity of PCL by taking the celestial spectrum data as the formal context.

关 键 词：概念格 渐进式构造 剪枝 最小上界 天体光谱数据 

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