Computer Science ›› 2019, Vol. 46 ›› Issue (12): 257-260.doi: 10.11896/jsjkx.181102137

• Artificial Intelligence • Previous Articles     Next Articles

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

Abstract: Formal concept analysis was proposed by Wille 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

CLC Number: 

  • 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] WANG Zi-yin, LI Lei-jun, MI Ju-sheng, LI Mei-zheng, XIE Bin. Attribute Reduction of Variable Precision Fuzzy Rough Set Based on Misclassification Cost [J]. Computer Science, 2022, 49(4): 161-167.
[2] LI Yan, FAN Bin, GUO Jie, LIN Zi-yuan, ZHAO Zhao. Attribute Reduction Method Based on k-prototypes Clustering and Rough Sets [J]. Computer Science, 2021, 48(6A): 342-348.
[3] WANG Xia, PENG Zhi-hua, LI Jun-yu, WU Wei-zhi. Method of Concept Reduction Based on Concept Discernibility Matrix [J]. Computer Science, 2021, 48(1): 125-130.
[4] ZENG Hui-kun, MI Ju-sheng, LI Zhong-ling. Dynamic Updating Method of Concepts and Reduction in Formal Context [J]. Computer Science, 2021, 48(1): 131-135.
[5] SANG Bin-bin, YANG Liu-zhong, CHEN Hong-mei, WANG Sheng-wu. Incremental Attribute Reduction Algorithm in Dominance-based Rough Set [J]. Computer Science, 2020, 47(8): 137-143.
[6] 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.
[7] CHEN Yi-ning,CHEN Hong-mei. Attribute Reduction of Fuzzy Rough Set Based on Distance Ratio Scale [J]. Computer Science, 2020, 47(3): 67-72.
[8] XU Yi,TANG Jing-xin. Attribute Reduction Algorithm Based on Optimized Discernibility Matrix and Improving Discernibility Information Tree [J]. Computer Science, 2020, 47(3): 73-78.
[9] HOU Cheng-jun,MI Ju-sheng,LIANG Mei-she. Attribute Reduction Based on Local Adjustable Multi-granulation Rough Set [J]. Computer Science, 2020, 47(3): 87-91.
[10] YANG Wen-jing,ZHANG Nan,TONG Xiang-rong,DU Zhen-bin. Class-specific Distribution Preservation Reduction in Interval-valued Decision Systems [J]. Computer Science, 2020, 47(3): 92-97.
[11] GUO Qing-chun,MA Jian-min. Judgment Methods of Interval-set Consistent Sets of Dual Interval-set Concept Lattices [J]. Computer Science, 2020, 47(3): 98-102.
[12] FAN Xin,CHEN Hong-mei. Stepwise Optimized Feature Selection Algorithm Based on Discernibility Matrix and mRMR [J]. Computer Science, 2020, 47(1): 87-95.
[13] LONG Bing-han, XU Wei-hua, ZHANG Xiao-yan. Distribution Attribute Reduction Based on Improved Discernibility Information Tree in Inconsistent System [J]. Computer Science, 2019, 46(6A): 115-119.
[14] LI Yan, ZHANG Li, CHEN Jun-fen. Attribute Reduction Method Based on Sequential Three-way Decisions in Dynamic Information Systems [J]. Computer Science, 2019, 46(6A): 120-123.
[15] LIN Hong, QIN Ke-yun. Attribute Reduction for Decision Formal Contexts Based on Threek-way Decision Rules [J]. Computer Science, 2019, 46(3): 248-252.
Full text



No Suggested Reading articles found!