三支面向属性概念格的构成  

Construction of Three Attribute Oriented Concept Lattices

作　　者：苏新[1] 夏文富 陈永平[1] SU Xin;XIAWenfu;CHEN Yongping(Department of Electronic Information,Maanshan Technical College,Maanshan 243011,China;Operation Branch of Hangzhou Metro Group Co.,Ltd.,Hangzhou 310000,China)

机构地区：[1]马鞍山职业技术学院电子信息系,安徽马鞍山243011 [2]杭州市地铁集团有限责任公司运营分公司,浙江杭州310000

出　　处：《安徽工业大学学报（自然科学版）》2021年第3期340-345,共6页Journal of Anhui University of Technology（Natural Science）

基　　金：安徽省教育厅自然科学基金项目(KJ2015A431,KJ2017A894,KJ2020A0930)。

摘　　要：在由属性诱导的三支面向属性概念格相关定义的基础上,推理由属性诱导的三支面向属性概念格、极大概念集和极小概念集之间的关系,提出一种由属性诱导的三支面向属性概念格的构造算法,比较分析通用面向对象概念格构造算法与本文算法的时间复杂度。结果表明,本文算法的时间效率高于通用面向对象概念格构造算法。Based on the definitions of three attribute oriented concept lattices induced by attributes,the relationship among attribute induced three attribute oriented concept lattices,maximum concept set and minimum concept set was deduced,and a construction algorithm of attribute induced three attribute oriented concept lattices was proposed.The time complexities of general object-oriented concept lattice construction algorithm and the algo-rithm in this paper were compared and analyzed.The results show that the time efficiency of this algorithm is higher than that of general object-oriented concept lattice construction algorithm.

关 键 词：概念格 三支面向属性 时间复杂度 

分 类 号：O29[理学—应用数学] TP18[理学—数学]