Computer Science ›› 2017, Vol. 44 ›› Issue (8): 274-279.doi: 10.11896/j.issn.1002-137X.2017.08.047

Previous Articles     Next Articles

Rule Acquisition of D-type Probabilistic Decision Formal Context

ZHAO Fan and WEI Ling   

  • Online:2018-11-13 Published:2018-11-13

Abstract: Based on uncertainty decision problems,D-type probabilistic decision formal context was proposed.On this probabilistic decision formal context,a new operator “△” was defined,the probabilistic concepts were obtained and the corresponding concept lattice was constructed.Then we defined the consistence of D-type probability decision formal context and studied the rule acquisition on the consistent D-type probability decision formal context.Furthermore,by eliminating the redundant rules,the rules were simplified.Finally,the algorithms for generating the probability concept lattice and acquiring the decision rules were presented.

Key words: Uncertainty decision,D-type probabilistic decision formal context,Rule acquisition,Redundant rule

[1] FAYYAD U,PIATETSKY-SHAPIOR M,SMYTH G.FromData Mining to Knowledge Discovery in databases[C]∥Proc of Menlo Park.California:AAAI Press,1996:1-35.
[2] WILLE R.Restructuring Lattice Theory:An Approach Basedon Hierarchies of Concepts[M].Heidelberg:Springer Netherlands,1982:445-470.
[3] HO T B.An approach to concept formation based on formalconcept analysis[J].IEICE Transactions on Information and Systems,1995,78(5):553-559.
[4] KUZNETSOV S O.A fast algorithm for computing all intersection of objects in a finite semilattice[J].Automatic Documentation and Mathematical Linguistics,1993,27(5):11-12.
[5] GANTER B,WILLE R.Conceptual scaling [C]∥Proc of Applications of Combinatorics and Graph Theory to the Biological and Social Science.New York:Springer-Verlag,1989:139-167.
[6] WEI L.Reduction Theory and Approach to Rough Set and Concept Lattice [D].Xi’an:Xi’an Jiaotong University,2005.(in Chinese) 魏玲.粗糙集与概念格约简理论与方法[D].西安:西安交通大学,2005.
[7] LI T J,WU W Z,LIU J.Attribute reduction in Decision Formal Context based on Rough Set[J].Computer Science,2009,36(8A):48-61.(in Chinese) 李同军,吴伟志,刘军.基于粗糙集的决策形式背景属性约简[J].计算机科学,2009,36(8A):48-61.
[8] LI J J,ZHANG Y L,WU W Z,et al.Attribute Reduction forFormal Concept and Consistent Decision Formal Concept and Concept Lattice Generation[J].Chinese Journal of Computers,2014,37(8):1768-1774.(in Chinese) 李进金,张燕兰,吴伟志,等.形式背景与协调决策形式背景属性约简与概念格生成[J].计算机学报,2014,37(8):1768-1774.
[9] LI J H,LV Y J.Attribute reduction and Rules Extraction in Decision Formal Context based on Concept Lattice[J].Mathema-tics in Practice and Theory,2009,39(7):182-188.(in Chinese) 李金海,吕跃进.基于概念格的决策形式背景属性约简及规则提取[J].数学的实践与认识,2009,39(7):182-188.
[10] LI T.Rule Acquisition on Decision Formal Context [D].Xi’an:Northwest University,2013.(in Chinese) 李涛.决策形式背景的知识获取[D].西安:西北大学,2013.
[11] YANG S Q,DING S L,CAI S Z,et al.An algorithm of constructing concept lattices for CAT with cognitive diagnosis[J].Knowledge-Based Systems,2008,21(8):852-855.
[12] COLE R,EKLUND P W.Scalability in formal concept analysis[J].Computational Intelligence,2000,15(1):11-27.
[13] WU W Z,LEUNG Y,MI J S.Granular computing and know-ledge and Data Engineering[J].IEEE Transactions on Know-ledge & Data Engineering,2008,21(10):1461-1474.
[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,LV Y J.Incomplete decision contexts:Ap-proximate concept construction,rule acquisition and knowledge reduction[J].International Journal of Approximate Reasoning,2013,54(1):149-165.
[16] LIU B X,LI Y.Construction Principles and Algorithms of Concept Lattice Generated by Random Decision Formal Context[J].Computer Science,2013,40(6A):90-92.(in Chinese) 刘保相,李言.随机决策形式背景下的概念格构建原理与算法[J].计算机科学,2013,40(6A):90-92.
[17] WEI L,Q J J,ZHANG W X.Attribute Reduction of Concept Lattice in Decision Formal Context[J].Science in China (Series E):Information Science,2008,38(2):195-208.(in Chinese) 魏玲,祁建军,张文修.决策形式背景的概念格属性约简[J].中国科学E辑:信息科学,2008,38(2):195-208.
[18] LI J H.Rule Acquisition Oriented Reduction Methods for Concept Lattices and Their Implementation Algorithms [D].Xi’an:Xi’an Jiaotong University,2012.(in Chinese) 李金海.面向规则提取的概念格约简方法及其算法实现[D].西安:西安交通大学,2012.
[19] GANTER B,WILLE R.Formal Concept Aanlysis [M].Mathematical Foundations.New York:Springer-Verlag,1999.
[20] 张文修,仇国芳.基于粗糙集的不确定决策[M].北京:清华大学出版社,2005:185-205.
[21] 张文修,梁怡.不确定性推理原理[M].西安:西安交通大学出版社,1996:56-76.

No related articles found!
Full text



[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75 .
[2] 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 .
[3] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[4] 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 .
[5] 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 .
[6] 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 .
[7] 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 .
[8] 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 .
[9] 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 .
[10] WANG Zhen-chao, HOU Huan-huan and LIAN Rui. Path Optimization Scheme for Restraining Degree of Disorder in CMT[J]. Computer Science, 2018, 45(4): 122 -125 .