Computer Science ›› 2026, Vol. 53 ›› Issue (9): 157-164.doi: 10.11896/jsjkx.260600026

• Database & Big Data & Data Science • Previous Articles     Next Articles

OE-concept Reduction Based on Global Relevance and Redundancy

ZHAO Shicheng1, MI Jusheng1,2   

  1. 1 School of Mathematical Sciences,Hebei Normal University,Shijiazhuang 050024,China
    2 Hebei Key Laboratory of Computational Mathematics and Applications,Shijiazhuang 050024,China
  • Received:2026-05-02 Revised:2026-07-03 Online:2026-09-15 Published:2026-09-10
  • About author:ZHAO Shicheng,born in 2002,master.His main research interests include formal contexts,three-way concept,and so on.
    MI Jusheng,born in 1966,Ph.D,professor,Ph.D supervisor.His main research interests include rough set,concept lattice,granular computing,approximate reasoning,and so on.
  • Supported by:
    National Natural Science Foundation of China(62476078) and Key Development Fund of Hebei Normal University(L2024ZD06).

Abstract: Concept reduction is central to formal concept analysis(FCA),which simplifies concept lattices while preserving all original information.As a combination of three-way decision theory and traditional concept lattices,three-way concept lattices feature distinct reduction requirements.Unlike traditional reduction that only maintains positive information structure,three-way concept reduction demands complete retention of positive,negative and uncertain knowledge under stricter criteria,making it more suitable for multi-dimensional complex decision-making.Since current studies on three-way concept lattice reduction are insufficient and efficient methods are lacking.To address this issue,this paper proposes an OE concept reduction framework based on global relevance and redundancy.The framework integrates the relevance and redundancy analysis of OE concepts to construct an optimized OE concept reduction method,which can effectively identify and eliminate redundant concepts while ensuring the integrity of the three-way knowledge structure,thereby obtaining an OE concept reduction result that preserves binary relations.Experimental results demonstrate that the proposed method significantly outperforms existing OE concept reduction methods in terms of the computational efficiency of reduction,effectively enhancing the processing performance of OE concept reduction.It also provides new support for the theoretical development of OE concept lattices and their application in complex decision analysis.

Key words: Formal contexts, Binary relation, Three-way concept, Concept reduction, Granular computing.

CLC Number: 

  • TP181
[1] PAWLAK Z.Rough sets[J].International Journal of Computer and Information Sciences,1982,11(5):341-356.
[2] WEI L,CAO L,QI J J,et al.Concept reduction and conceptcharacteristics in formal concept analysis[J].Scientia Sinica Informationis,2020,50(12):1817-1833.
[3] XIE X X,LI J J,CHEN D X,et al.Concept reduction preserving binary relation based on Boolean matrix[J].Journal of Shandong University:Natural Science,2020,55(5):32-45.
[4] WANG X,PENG Z H,LI J Y,et al.A concept reduction method based on concept discernibility matrix[J].Computer Science,2021,48(1):125-130.
[5] ZHAO S Y,QI J J,LI J N,et al.Concept reduction in formal concept analysis based on representative concept matrix[J].International Journal of Machine Learning and Cybernetics,2023,14(4):1147-1160.
[6] LIU J,MI J S,LI Z L,et al.Dual three-way concept lattice and concept reduction based on concept composition[J].Computer Science,2023,50(6):122-130.
[7] LI Y,ZHAO S Y,REN R S,et al.Concept reduction preserving antecedent information of rules[J].Journal of Northwest University:Natural Science Edition,2023,53(5):803-811.
[8] WEI L,ZHAO S Y,QI J J.Symmetric formal context and itsconcept reduction[J].Journal of Northwest University:Natural Science Edition,2023,53(5):794-802.
[9] LI X,ZHANG Q,WEI L.Relationship between triadic concept reduction and concept reduction[J].Computer Science,2025,52(6):151-158.
[10] LI W,LI T R,QIAN Y H.Concept reduction via global rele-vance and redundancy viewpoints[J].Knowledge-Based Systems,2016,107:158-170.
[11] YAO Y Y.An outline of a theory of three-way decisions[C] //Rough Sets and Current Trends in Computing.Berlin:Springer,2012:1-17.
[12] QI J J,WEI L,YAO Y Y.Three-way formal concept analysis[C] //Rough Sets and Knowledge Technology.Cham:Springer,2014:732-741.
[13] YAO Y Y.Interval sets and three-way concept analysis in incomplete contexts[J].International Journal of Machine Lear-ning and Cybernetics,2017,8(1):3-20.
[14] QI J J,QIAN T,WEI L.The connections between three-way and classical concept lattices[J].Knowledge-Based Systems,2016,91:143-151.
[15] REN R,WEI L.The attribute reductions of three-way concept lattices[J].Knowledge-Based Systems,2016,99:92-102.
[16] GAO X W,LIU G L,XIE Y H.Concept reduction of object-induced three-way concept lattices[C] //Lecture Notes in Computer Science.Cham:Springer,2022:265-273.
[17] XIE J,YANG J,LI J,et al.Three-way concept lattice construction and association rule acquisition[J].Information Sciences,2025,701:121867.
[18] 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.
[19] CHANG X X,QIN K Y.Granular reduction method of formal context based on object-induced three-way concept lattice[J].Computer Science,2018,45(10):225-228.
[20] WANG Z,SHI C J,YAO Y Y.Tri-granularity attribute reduction of three-way concept lattices[J].Knowledge-Based Systems,2023,276:110762.
[1] LI Xuan, ZHANG Qin, WEI Ling. Relationship Between Triadic Concept Reducts and Concept Reducts [J]. Computer Science, 2025, 52(6): 151-158.
[2] MA Wensheng, HOU Xilin. Simplest Complete Cooperative Combination and Concept Reduction [J]. Computer Science, 2025, 52(11A): 250100053-5.
[3] LIU Jin, MI Jusheng, LI Zhongling, LI Meizheng. Dual Three-way Concept Lattice Based on Composition of Concepts and Its Concept Reduction [J]. Computer Science, 2023, 50(6): 122-130.
[4] MA Wensheng, HOU Xilin. Same Effect Relation and Concept Reduction in Formal Concept Analysis [J]. Computer Science, 2023, 50(4): 63-76.
[5] LI Yanyan, QIN Keyun. Topological Properties of Generalized Rough Approximation Operators Based on Objects [J]. Computer Science, 2023, 50(2): 173-177.
[6] 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.
[7] LI Zhong-ling, MI Ju-sheng, XIE Bin. Attribute Reduction in Inconsistent Decision Formal Contexts [J]. Computer Science, 2019, 46(12): 257-260.
[8] REN Rui-si, WEI Ling, QI Jian-jun. Rules Acquisition on Three-way Class Contexts [J]. Computer Science, 2018, 45(10): 21-26.
[9] JIANG Yu-ting, QIN Ke-yun. Property-oriented and Object-oriented Decision Rules in Decision Formal Contexts [J]. Computer Science, 2018, 45(10): 33-36.
[10] CHEN Li-fang, DAI Qi, FU Qi-feng. Design and Application of Extreme Learning Machine Model Based on Granular Computing [J]. Computer Science, 2018, 45(10): 59-63.
[11] CHANG Xin-xin, QIN Ke-yun. Approach for Granular Reduction in Formal Context Based on Objects-induced Three-way Concept Lattices [J]. Computer Science, 2018, 45(10): 225-228.
[12] WANG Chun-yue, WANG Li-ming and ZHANG Zhuo. Algorithm of Maintaining Concept Lattice Based on Binary Relation Decrement [J]. Computer Science, 2016, 43(Z11): 35-41.
[13] XU You-hong (School of Mathematics,Physics,and Information Science,Zhejiang Ocean University,Zhoushan 316004,China). [J]. Computer Science, 2009, 36(2): 194-198.
[14] . [J]. Computer Science, 2007, 34(9): 194-197.
[15] . [J]. Computer Science, 2006, 33(9): 178-180.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!