摘要
属性约简是概念格理论的一个重要研究内容,基于辨识矩阵计算约简是一种经典方法,传统辨识矩阵的计算复杂度为O(nl2).鉴于此,在三支近似概念格模型中,构造一种对象-概念辨识矩阵,其计算复杂度为O(mnl),一般情况下,m远远小于l,辨识矩阵的计算复杂度大大降低,并结合概念格的偏序关系进一步简化对象-概念辨识矩阵.通过理论分析和实验结果表明了所提出方法的高效性.
Attribute reduction is a core issue in formal concept analysis（FCA）. Of all attribute reduction approaches, the ones based on discernibility matrix and discernibility function are of most importance. However, in the traditional discernibility matrices, the comparisons between every two concepts result in a high computation complexity： O（nl2）. Therefore, an object-concept discernibility matrix is constructed to obtain the reducts of the incomplete contexts, and the computation complexity is reduced to O（mnl）. In most cases, m is much smaller than l, so O（mnl） ≤ O（nl2）. The partial order of the concept lattice is further used to simplify the object-concept discernibility matrix. Theoretical analysis and experimental results show the effectiveness of the proposed methods.
出处
《控制与决策》
EI
CSCD
北大核心
2016年第10期1779-1784,共6页
Control and Decision
基金
国家自然科学基金项目(61272060
61379114)
重庆市自然科学基金重点项目(cstc2013jj B40003)
关键词
概念格
三支决策
不完备形式背景
属性约简
辨识矩阵
concept lattice
three-waydecisions
incomplete context
attribute reductiom discernibility matrix
