一种基于剪枝的横向分块概念格构造算法  

Research on Construction Algorithm of Horizontal Partitioning Concept Lattices Based on Pruning

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

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

出　　处：《小型微型计算机系统》2011年第7期1394-1399,共6页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(60773014)资助;校青年基金项目(20100314)资助

摘　　要：概念格是形式概念分析中的核心数据结构,随着数据量的日益剧增,概念格的构造效率始终是关键.本文首先引入横向分块概念格,给出其若干结论;针对横向分块概念格构造过程中存在冗余信息,提出一种基于剪枝的横向分块概念格渐进式构造算法PHCL,从而进一步提高了概念格的构造效率;最后采用恒星天体光谱数据作为形式背景,实验验证了算法PHCL的正确性和有效性.Concept lattice is the core data structure of formal concept analysis. However, with the sharp increasing of the data to deal with and analyze, the efficiency of its construction became the key problem. In order to improve the construction efficiency of concept lattice, this paper firstly introduced horizontal partitioning concept lattices, and giving some conclusions. Secondly, an incremental algorithm PHCL of constructing horizontal partitioning concept lattices based on pruning is presented through eliminating the redundancy information in the construction process by pruning. The experimental results prove the correctness and validity of the algorithm PHCL by taking the celestial spectrum data as the formal context.

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

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