基于面向对象(属性)概念格的形式背景属性约简方法

doi:10.11896/JsJkx.191100011

摘要/Abstract

摘要： 形式背景的属性约简是形式概念分析的重要研究内容之一。文中研究形式背景保持面向对象(属性)概念格结构的属性约简方法。通过分析相应的粒概念,提出了一种新的基于面向对象概念格和基于面向属性概念格的协调集判定定理,进而得到了新的可辨识属性集和可辨识属性矩阵,借助布尔逻辑公式转换给出了约简计算方法。提出的方法可以避免计算所有面向对象的形式概念及面向属性的所有形式概念。另外,提出了面向对象概念格和面向属性概念格的属性特征,给出了绝对必要属性、相对必要属性、绝对不必要属性的等价描述。

关键词: 概念格, 面向对象概念格, 面向属性概念格, 属性约简

Abstract: Attribute reduction of formal context is one of the important research topics of formal concept analysis.This paper is devoted to the discussion of attribute reduction methods preserving the structures of obJect-oriented concept lattice and property-oriented concept lattice.By the analysis of the related granular concepts,this paper proposes a new Judgement theorem for consistent set based on obJect-oriented concept lattice and attribute-oriented concept lattice.Then,new discernible attribute sets and discernible attribute matrices are established.The attribute reductions preserving the structures of obJect-oriented concept lattice and property-oriented concept lattice are calculated by using the conversion of Boolean logic formula.The proposed method can avoid computing all obJect-oriented and attribute-oriented concept lattices.In addition,the characteristics of attributes with respect to obJect-oriented concept lattice and property-oriented concept lattice are proposed.Some equivalent descriptions of absolutely necessary attributes,relatively necessary attributes,and absolutely unnecessary attributes are provided.

Key words: Attribute reduction, Attribute-oriented concept lattice, Concept lattice, ObJect-oriented concept lattice

中图分类号:

TP182

岳晓威, 彭莎, 秦克云. 基于面向对象(属性)概念格的形式背景属性约简方法[J]. 计算机科学, 2020, 47(6A): 436-439. https://doi.org/10.11896/JsJkx.191100011

YUE Xiao-wei, PENG Sha and QIN Ke-yun. Attribute Reduction Methods of Formal Context Based on ObJect (Attribute) Oriented Concept Lattice[J]. Computer Science, 2020, 47(6A): 436-439. https://doi.org/10.11896/JsJkx.191100011

参考文献

[1] WILLE R.Restructuring lattice theory:An app- roach based on hierarchies of concepts //Ordered Sets Dordrecht-Boston:Reidel.1982:445-470.
[2] HU K Y,LU Y C,SHI C Y.Progress of concept lattice and its application .Journal of Tsinghua University (Science Edition),2000,40(9):77-81.
[3] CARPINETO C,ROMANO G.A lattice conceptual clustering system and its application to browsing retrieval .Machine learning,1996,10:95-122.
[4] CHEN Y,YAO Y.A multi-view approach for intelligent dataanalysis Based on data operators .Information Sciences,2008,178(1):1-20.
[5] GANTER B,WILLE R.Formal concept analysis.New York:Springer-Verlag,1999.
[6] ZHANG W X,WEI L,QI J J.Attribute reduction theory and approach to concept lattices .Science in China-Information Sciences,2005,35(6):628-639.
[7] QI J J.Attribute reduction in formal contexts based on a new discernibility matrix .Journal of Applied Mathematics and Computing,2009,30(1/2):305-314.
[8] LI L J,LI M Z,JU S M,et al.A simple dicernibility matrix for attribute reduction in formal concept analysis based on granular concepts .Journal of intelligent and Fuzzy Systems,2019:4325-4337.
[9] DUNTSCH I,GEDIGA G.Modal-style operators in qualitative data analysis//Proceedings of the 2002 IEEE International Conference on Data Mining.IEEE,2002:155-162.
[10] YAO Y Y.A comparative study of formal concpt analysis and rough set theory in data analysis//Proceedings of 3^rd International Conference on RSCTC’04.Springer Berlin Heidelberg,2004:59-68.
[11] LIU M X.The theory of reduction for obJect oriented concept lattice and attribute oriented concept lattice .Xi’an:Northwest University,2010.
[12] LIU M,SHAO M W,ZHANG W X.Reduction method for concept lattices based on rough set theory and its application .Computers and Mathematics with Applications,2007,53(9):1390-1410.
[13] MEDINA J.Relating attribute reduction in formal,obJect-oriented and property-oriented concept lattice .Computers and Mathematics with Applications,2012,64(6):1992-2002.
[14] WANG J L.A new method of obJect oriented concept lattice attribute reduction .Journal of Basic Science of Textile University,2013(3):355-358.
[15] WANG X.Theory and method of conceptual lattice reduction .Xi’an :Xi’an Jiaotong University,2008.
[16] WANG Q,WEI L,LI T.A new method of lattice construction based on non-reducible elements .Journal of Northwestern University (Science Edition),2013,43(1):10-14.
[17] LIANG X Y,WANG Q,WEI L.The union reduction of obJect-oriented (attribute) concept lattice based of direct view.Journal of North western University (Science Edition),2015,45(3):357-364.

相关文章 15

[1]	王子茵, 李磊军, 米据生, 李美争, 解滨. 基于误分代价的变精度模糊粗糙集属性约简 Attribute Reduction of Variable Precision Fuzzy Rough Set Based on Misclassification Cost 计算机科学, 2022, 49(4): 161-167. https://doi.org/10.11896/jsjkx.210500211
[2]	王志成, 高灿, 邢金明. 一种基于正域的三支近似约简 Three-way Approximate Reduction Based on Positive Region 计算机科学, 2022, 49(4): 168-173. https://doi.org/10.11896/jsjkx.210500067
[3]	李艳, 范斌, 郭劼, 林梓源, 赵曌. 基于k-原型聚类和粗糙集的属性约简方法 Attribute Reduction Method Based on k-prototypes Clustering and Rough Sets 计算机科学, 2021, 48(6A): 342-348. https://doi.org/10.11896/jsjkx.201000053
[4]	沈夏炯, 杨继勇, 张磊. 基于不相关属性集合的属性探索算法 Attribute Exploration Algorithm Based on Unrelated Attribute Set 计算机科学, 2021, 48(4): 54-62. https://doi.org/10.11896/jsjkx.200800082
[5]	温馨, 闫心怡, 陈泽华. 基于等价关系的最小乐观概念格生成算法 Minimal Optimistic Concept Generation Algorithm Based on Equivalent Relations 计算机科学, 2021, 48(3): 163-167. https://doi.org/10.11896/jsjkx.200100046
[6]	曾惠坤, 米据生, 李仲玲. 形式背景中概念及约简的动态更新方法 Dynamic Updating Method of Concepts and Reduction in Formal Context 计算机科学, 2021, 48(1): 131-135. https://doi.org/10.11896/jsjkx.200800018
[7]	桑彬彬, 杨留中, 陈红梅, 王生武. 优势关系粗糙集增量属性约简算法 Incremental Attribute Reduction Algorithm in Dominance-based Rough Set 计算机科学, 2020, 47(8): 137-143. https://doi.org/10.11896/jsjkx.190700188
[8]	陈毅宁,陈红梅. 基于距离比值尺度的模糊粗糙集属性约简 Attribute Reduction of Fuzzy Rough Set Based on Distance Ratio Scale 计算机科学, 2020, 47(3): 67-72. https://doi.org/10.11896/jsjkx.190100196
[9]	徐怡,唐静昕. 基于优化可辨识矩阵和改进差别信息树的属性约简算法 Attribute Reduction Algorithm Based on Optimized Discernibility Matrix and Improving Discernibility Information Tree 计算机科学, 2020, 47(3): 73-78. https://doi.org/10.11896/jsjkx.190500125
[10]	侯成军,米据生,梁美社. 基于局部可调节多粒度粗糙集的属性约简 Attribute Reduction Based on Local Adjustable Multi-granulation Rough Set 计算机科学, 2020, 47(3): 87-91. https://doi.org/10.11896/jsjkx.190500162
[11]	郭庆春,马建敏. 对偶区间集概念格上区间集协调集的判定方法 Judgment Methods of Interval-set Consistent Sets of Dual Interval-set Concept Lattices 计算机科学, 2020, 47(3): 98-102. https://doi.org/10.11896/jsjkx.190500098
[12]	龙柄翰, 徐伟华, 张晓燕. 不协调目标信息系统中基于改进差别信息树的分布属性约简 Distribution Attribute Reduction Based on Improved Discernibility Information Tree in Inconsistent System 计算机科学, 2019, 46(6A): 115-119.
[13]	李艳, 张丽, 陈俊芬. 动态信息系统中基于序贯三支决策的属性约简方法 Attribute Reduction Method Based on Sequential Three-way Decisions in Dynamic Information Systems 计算机科学, 2019, 46(6A): 120-123.
[14]	林洪,秦克云. 决策形式背景基于三支决策规则的属性约简 Attribute Reduction for Decision Formal Contexts Based on Threek-way Decision Rules 计算机科学, 2019, 46(3): 248-252. https://doi.org/10.11896/j.issn.1002-137X.2019.03.037
[15]	李艳, 张丽, 王雪静, 陈俊芬. 优势-等价关系下序贯三支决策的属性约简 Attribute Reduction for Sequential Three-way Decisions Under Dominance-Equivalence Relations 计算机科学, 2019, 46(2): 242-148. https://doi.org/10.11896/j.issn.1002-137X.2019.02.037

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed