一种面向属性的约束概念格构造算法  

Algorithm for Attribute-faced Constrained Concept Lattice Construction

作　　者：刘博[1] 杜建强[1] 刘蕾[1] 罗计根 曾青霞[1] 聂斌[1] 

机构地区：[1]江西中医药大学计算机学院,南昌330004

出　　处：《小型微型计算机系统》2017年第11期2580-2585,共6页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(61363042;61562045)资助;江西省自然科学基金重大项目(20152ACB20007)资助;江西省重点研发计划重点项目(20171ace50021)资助;江西省高校科技落地计划项目(LD12038)资助;江西省研究生创新基金项目(YC2015-S350)资助

摘　　要：约束概念格是一种数据分析的一种有效工具.在其构造的过程中,判断节点是否满足约束条件是导致格的构造效率低下的原因之一.约束概念格是针对用户所关心的属性建格,传统的概念格生成算法都是基于对象的渐进式算法,而基于属性增加的概念格是通过增加属性来实现概念格的更新,采用基于属性的约束概念格构造算法建格能减少判断是否满足约束条件的次数,从而提高了约束概念格的构造效率.在此基础上提出一种基于属性的约束概念格生成算法,给出对于不同的约束条件的处理过程,最后以中医诊断文本和UCI数据集作为形式背景,实验验证了基于属性的约束概念格算法的正确性,并且能够有效的减少建格时间.Constrained concept lattice is an effective tool for data analysis. In the construction process,a lot of to judge the nodes w hether meet the constraint condition is the result of one of the main reason for the lowefficiency of lattice structure. Constrained concept lattice is targeting properties of interest to the user is built in the style,and the traditional concept lattice generation algorithm is based on the incremental algorithm while concept lattice based on attribute is by increasing property to realize the renew al of concept lattice,the construction algorithm of constrained concept lattice based on the properties of lattice construction can reduce the child nodes of the parent node is to satisfy the constraints of the number of,so as to improve the constructing efficiency of constrained concept lattice. On the basis of this,this paper proposes an algorithm for generating constraint concept lattice based on attribute,and gives the processing process for different constraint conditions. Finally,the traditional Chinese medicine diagnosis text as a form of background,the experiment proved that the attribute based constraint concept lattice algorithm can effectively reduce the construction time.

关 键 词：约束概念格 属性 约束条件 构造算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]