基于搜索空间划分的概念生成算法  

An Algorithm for Generating Concepts Based on Search Space Partition

作　　者：齐红[1] 刘大有[1] 胡成全[1] 卢明[1] 赵亮[1] 

机构地区：[1]吉林大学计算机科学与技术学院,吉林长春130012

出　　处：《软件学报》2005年第12期2029-2035,共7页Journal of Software

基　　金：国家自然科学基金;国家高技术研究发展计划(863);吉林省科技发展计划重大项目~~

摘　　要：概念格作为形式概念分析理论中的核心数据结构,在机器学习、数据挖掘和知识发现、信息检索等领域得到了广泛的应用.概念格的构造在其应用过程中是一个主要问题.提出了一种基于搜索空间划分的概念生成算法SSPCG(searchspacepartitionbasedconceptsgeneration),它将属性集合的幂集看作初始闭包搜索空间,迭代地将每个搜索空间划分为一些子搜索空间,并引入了子搜索空间的有效性判断,只搜索那些能生成正规闭包的子搜索空间,有效地提高了搜索效率;同时,在计算闭包过程中保存一些必要的中间结果,用来提高闭包运算速度.由于所有子搜索空间是独立的,所以该算法可以很容易地扩展为并行算法.在随机生成的数据集和真实数据集上进行的实验测试表明,本算法的时间性能要优于Ganter提出的NextClosure算法.Concept lattice, the core data structure in formal concept analysis, has been used widely in machine learning, data mining and knowledge discovery, information retrieval, etc. The main difficulty with concept lattice-based system comes from the lattice construction itself. This paper proposes a new algorithm called SSPCG （search space partition based concepts generation） based on the closures search space partition. The algorithm divides the closures search space into several subspaces in accordance with the criterions prescribed ahead, and introduces an efficient scheme to recognize the valid ones, which bounds searching just in these valid subspaces. An intermediate structure is employed to judge the validity of a subspace and compute closures more efficiently. Since the partition of the search space is recursive and the searching in subspaces is independent, a parallel version can be directly reached. The algorithm is experimental evaluated and compared with the famous NextClosure algorithm proposed by Ganter for random generated data, as well as for real application data. The results show that the algorithm performs much better than the later.

关 键 词：形式概念分析 概念格 搜索空间 闭包系统 闭集 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]