计算机科学 ›› 2019, Vol. 46 ›› Issue (12): 257-260.doi: 10.11896/jsjkx.181102137

• 人工智能 • 上一篇    下一篇

不协调决策形式背景的属性约简

李仲玲1, 米据生2,3, 解滨4   

  1. (河北师范大学汇华学院 石家庄050091)1;
    (河北师范大学数学与信息科学学院 石家庄050024)2;
    (河北省计算数学与应用重点实验室 石家庄050024)3;
    (数据科学与智能应用福建省高校重点实验室 福建 漳州363000)4
  • 收稿日期:2018-11-20 出版日期:2019-12-15 发布日期:2019-12-17
  • 作者简介:李仲玲(1983-),女,硕士,讲师,主要研究领域为近似推理、粗糙集、概念格等;米据生(1966-),男,博士,教授,博士生导师,主要研究领域为粒计算、近似推理;解滨(1976-),男,博士,教授,主要研究领域为粒计算、近似推理。
  • 基金资助:
    本文受国家自然科学基金(61573127),河北省自然科学基金项目(F2018205196),河北省高等学校自然科学基金项目(QN2016133)资助。

Attribute Reduction in Inconsistent Decision Formal Contexts

LI Zhong-ling1, MI Ju-sheng2,3, XIE Bin4   

  1. (HuiHua College,Hebei Normal University,Shijiazhuang 050091,China)1;
    (College of Mathematics and Information Science,Hebei Normal University,Shijiazhuang 050024,China)2;
    (Hebei Key Laboratory of Computational Mathematics and Applications,Shijiazhuang 050024,China)3;
    (Key Laboratory of Data Science and Intelligence Application,Fujian Province University,Zhangzhou,Fujian 363000,China)4
  • Received:2018-11-20 Online:2019-12-15 Published:2019-12-17

摘要: 形式概念分析由德国数学家Wille于1982年提出,是刻画概念和概念之间层次化结构的数据分析工具,主要用于概念的发现、排序和显示。作为知识发现的有效工具,该理论已被成功地运用到信息检索、数据挖掘、模式识别等领域。而在实际问题中呈现出的形式背景往往具有冗余的属性,使得所生成的概念格结构非常复杂。为了提取更加简洁有效的概念格,需要对形式背景中的属性进行约简。因此,寻找更高效的属性约简方法成为了形式概念分析中的一个重要研究问题。文中把基于粗糙集理论的属性约简思想引入到形式背景中,进一步研究不协调决策形式背景的属性约简问题。一些学者在不协调信息系统中基于等价类提出了分布约简、最大分布约简、分配约简、近似约简,并且讨论了4个约简之间的关系。而形式背景是一种特殊的信息系统,文中用粒集代替信息系统中的等价类,提出了4种基于包含度的属性约简,即分布约简、最大分布约简、分配约简与上近似和约简,并证明了分布协调集必为最大分布协调集,分布协调集必为分配协调集,分配协调集与上近似和协调集等价等结论。最后以分配约简为例,给出了分配协调集的判定定理,构建了不同粒集之间的可辨识属性集合,得到了求解分配约简的布尔计算方法。

关键词: 辨识矩阵, 决策形式背景, 协调集, 属性约简

Abstract: Formal concept analysis was proposed by Wille R.in 1982.It is a model for the study of formal concepts and conceptual hierarchies.As an effective tool in knowledge discovery,it has been applied in various research areas such as information retrieval,data mining and pattern recognition.In practical applications,there may be a lot of redundant attributes in the formal context.Therefore,it is necessary to study the attribute reduction in formal concept analysis,and finding more concise approaches of attribute reduction is an important aspect in formal contexts.In this paper,inspired by the idea of rough set theory,attribute reduction in inconsistent decision formal contexts was studied.Some scholars proposed four definitions of distribution reduction,maximum distribution reduction,assignment reduction,and approximation reduction based on equivalency class in inconsistent information systems.As a formal context is a special information system,in this paper,substituting the equivalency class by the granular set,four new definitions of distribution reduction,maximum distribution reduction,assignment reduction,and upper approximation reduction based on inclusion degree were proposed.It is proved that the distribution reduction must be the maximum distribution reduction,the distribution reduction must be the assignment reduction,and the assignment reduction is equivalent to the upper approximation reduction.As an example,the judgement theorem for assignment consistent set was proved,and Boolean method for assignment reduction were given.

Key words: Attribute reduction, Consistent set, Decision formal contexts, Discernibility matrix

中图分类号: 

  • O29
[1]ZHANG W X,WEI L,QI J J.Attribute reduction theory and approach to concept lattice[J].Science in China Ser.F Information Sciences,2005,48(6):713-726.
[2]LIU M,SHAO M W,ZHANG W X,et al.Reduction method for concept lattices based on rough set theory and its application[J].Computers and Mathematics with Applications,2007,53(9):1390-1410.
[3]WU W Z,LEUNG Y,MI J S.Granular computing and know- ledge reduction in formal contexts[J].IEEE Transactions on Knowledge and Data Engineering,2009,21(10):1461-1474.
[4]SHAO M W,YANG H Z,WU W Z.Knowledge reduction in formal fuzzy contexts[J].Knowledge-Based Systems,2015,73(1):265-275.
[5]SHAO M W,LEUNG Y,WU W Z.Rule acquisition and complexity reduction in formal decision contexts[J].International Journal of Approximate Reasoning,2014,55(1):259-274.
[6]LI J H,MEI C L,LV Y J.Knowledge reduction in decision formal contexts[J].Knowledge-Based Systems,2011,24(5):709-715.
[7]NIE C P,MI J S,ZHENG F C.Covering reduction of extents in concept lattices[J].Chinese Journal of Engineering Mathema-tics,2009,26(1):8-16.
[8]LI J H,LV Y J,LIANG B M.Algorithm for attribute reduction based on information quantity of concept lattice extension[J].Computer Engineering and Applications,2009,45(10):144-146.
[9]XU K,ZHANG Q H,XUE Y B,et al.Attribute reduction based on fuzziness of approximation set in multi-granulation spaces[J].The Journal of China Universities of Posts and Telecommunications,2016,23(6):16-23.
[10]FAN X D,ZHAO W D,WANG C Z,et al.Attribute reduction based on max-decision neighborhood rough set model[J].Knowledge-Based Systems,2018,151:16-23.
[11]QIAN W B,SHU W H.Attribute reduction in incomplete ordered information systems with fuzzy decision[J].Applied Soft Computing Journal,2018,73:242-253.
[12]WANG C Z,HUANG Y,SHAO M W,et al.Fuzzy rough set-based attribute reduction using distance measures[J].Know-ledge-Based Systems,2018,164:205-212.
[13]CHEN J K,MI J S,XIE B,et al.A fast attribute reduction method for large formal decision contexts[J].International Journal of Approximate Reasoning,2018,106:1-17.
[14]LI J Y,WANG X,WU W Z,et al.Attribute reduction in inconsistent formal decision contexts based oncongruence relations[J].International Journal of Machine Learning and Cybernetics,2017,8(1):81-94.
[15]LI M Z,LI L J,MI J S,et al.Rough entropy based algorithm for attribute reduction in concept lattice[J].Computer Science,2018,45(1):84-89.
[16]PAWLAK Z.Rough sets[J].International Journal of Computer and Information Sciences,1982,11(5):341-356.
[17]PAWLAK Z.Rough sets:some extensions[J].Information Scien- ces,2007,177(1):3-27.
[18]QIAN Y H,LIANG J Y.Rough set method based on multi- granulations[C]//Proceedings of 5th IEEE International Conference on Cognitive Informatics.Beijing,China,2006:297-304.
[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] 王霞, 彭致华, 李俊余, 吴伟志.
一种基于概念可辨识矩阵的概念约简方法
Method of Concept Reduction Based on Concept Discernibility Matrix
计算机科学, 2021, 48(1): 125-130. https://doi.org/10.11896/jsjkx.200800013
[5] 曾惠坤, 米据生, 李仲玲.
形式背景中概念及约简的动态更新方法
Dynamic Updating Method of Concepts and Reduction in Formal Context
计算机科学, 2021, 48(1): 131-135. https://doi.org/10.11896/jsjkx.200800018
[6] 桑彬彬, 杨留中, 陈红梅, 王生武.
优势关系粗糙集增量属性约简算法
Incremental Attribute Reduction Algorithm in Dominance-based Rough Set
计算机科学, 2020, 47(8): 137-143. https://doi.org/10.11896/jsjkx.190700188
[7] 岳晓威, 彭莎, 秦克云.
基于面向对象(属性)概念格的形式背景属性约简方法
Attribute Reduction Methods of Formal Context Based on ObJect (Attribute) Oriented Concept Lattice
计算机科学, 2020, 47(6A): 436-439. https://doi.org/10.11896/JsJkx.191100011
[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
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!