Computer Science ›› 2018, Vol. 45 ›› Issue (4): 257-259.doi: 10.11896/j.issn.1002-137X.2018.04.043

Previous Articles     Next Articles

Relationships among Several Attribute Reduction Methods of Decision Formal Context

QIN Ke-yun and LIN Hong   

  • Online:2018-04-15 Published:2018-05-11

Abstract: The attribute reduction in the formal context is an important topic of formal concept analysis.Several kinds of attribute reduction in decision formal context have been put forward.This paper was devoted to the study of the relationships among reduction,granular reduction and rule based reduction.An equivalent depiction of rule based consistent set was provided by using formal concepts.It is shown that the rule based consistent set in strong consistent formal context is a consistent set,and the rule based consistent set in granular consistent formal context is a granular consistent set.

Key words: Decision formal context,Reduction,Granular reduction,Rule based reduction

[1] WILLE R.Restructuring lattice theory:an approach based on hierarchies of concepts[C]∥Ordered sets.Dordrecht-Boston:Reidel,1982:445-470.
[2] GANTER B,WILLE R.Formal Concept Analysis,Mathematic Foundations[M].Berlin:Springer,1999.
[3] ZHANG W X,WEI L,QI J J.Attribute reduction theory and approach to concept Lattice[J].Science in China F,2005,48(6):713-726.
[4] 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.
[5] MEDINA J.Relating attribute reduction in formal,object-oriented and property-oriented concept lattice[J].Computers and Mathematics with Applications,2012,64(6):1992-2002.
[6] DIAS S M,VIEIRA N J.Concept lattices reduction:definition,analysis and classification[J].Expert Systems with Applications,2015,42(20):7084-7097.
[7] WANG X,ZHANG W X.Relations of attribute reduction between object and property oriented concept lattices[J].Know-ledge-Based Systems,2008,21(5):398-403.
[8] BELOHLAVEK R,SKLENAR V,ZACPAL J.Crisply generated fuzzy concepts[C]∥Proceedings of ICFCA 2005,Lecture Notes in Artificial Intelligence.2005:269-284.
[9] 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.
[10] SHAO M W,YANG H Z,WU W Z.Knowledge reduction informal fuzzy contexts[J].Knowledge-Based Systems,2015,73:265-275.
[11] 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.(in Chinese) 李金海,吕跃进,梁斌梅.基于概念格外延信息量的属性约简算法[J].计算机工程与应用,2009,45(10):144-146.
[12] WEI L,QI J J,ZHANG W X.Attribute reduction theory of concept lattice based on decision formal contexts[J].Science in China F,2008,51(7):910-923.
[13] LI J H,MEI C L,LV Y J.Knowledge reduction in decision formal contexts[J].Knowledge-Based Systems,2011,24(5):709-715.
[14] LI J H,MEI C L,LV Y J.Knowledge reduction in real decision formal contexts[J].Information Sciences,2012,189(7):191-207.
[15] LI J H,MEI C L,WANG J H,et al.Rule-preserved object compression in formal decision contexts using concept lattices[J].Knowledge-Based Systems,2014,71:435-445.
[16] LI J H,LV Y J.Attribute reduction and rules extraction in decision formal context based on concept lattice[J].Mathematics in Practice and Theory,2009,39(7):182-188.(in Chinese) 李金海,吕跃进.基于概念格的决策形式背景属性约简及规则提取[J].数学的实践与认识,2009,39(7):182-188.
[17] 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.
[18] LI J J,ZHANG Y L,WU W Z,et al.Attribute reduction for formal context and consistent decision formal context and concept lattice generation[J].Chinese Journal of Computer,2014,37(8):1768-1774.(in Chinese) 李进金,张燕兰,吴伟志,等.形式背景与协调决策形式背景属性约简与概念格生成[J].计算机学报,2014,37(8):1768-1774.

No related articles found!
Full text



[1] . [J]. Computer Science, 2018, 1(1): 1 .
[2] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75 .
[3] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[4] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[5] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[6] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99 .
[7] ZHOU Yan-ping and YE Qiao-lin. L1-norm Distance Based Least Squares Twin Support Vector Machine[J]. Computer Science, 2018, 45(4): 100 -105 .
[8] LIU Bo-yi, TANG Xiang-yan and CHENG Jie-ren. Recognition Method for Corn Borer Based on Templates Matching in Muliple Growth Periods[J]. Computer Science, 2018, 45(4): 106 -111 .
[9] GENG Hai-jun, SHI Xin-gang, WANG Zhi-liang, YIN Xia and YIN Shao-ping. Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph[J]. Computer Science, 2018, 45(4): 112 -116 .
[10] CUI Qiong, LI Jian-hua, WANG Hong and NAN Ming-li. Resilience Analysis Model of Networked Command Information System Based on Node Repairability[J]. Computer Science, 2018, 45(4): 117 -121 .