Computer Science ›› 2018, Vol. 45 ›› Issue (11A): 110-112.

• Intelligent Computing • Previous Articles     Next Articles

Relationships Between Several Reductions in Decision System

JING Si-hui, QIN Ke-yun   

  1. College of Mathematic,Southwest Jiaotong University,Chengdu 611756,China
  • Online:2019-02-26 Published:2019-02-26

Abstract: The indiscernibility relation is the basis of rough set theory.Firstly,this paper studied the relationship between λ-reduction,maximal distribution reduction and distribution reduction in decision table.It is proved that a λ-consistent set is a maximal distribution consistent set and a distribution consistent set.Secondly,this paper designed a heuristic reduction algorithm based on the attribute frequency in the distinguishing matrix for λ-reduction,which can reduce the complexity of reduction calculation.Finally,the feasibility and effectiveness of the proposed algorithm was verified by examples.

Key words: Consistent set, Discernibility matrixes, Indiscernibility relationship, Rough set

CLC Number: 

  • TP18
[1]PAWLAK Z.Rough set[J].International Journal of Computer and Information Science,1982,11:341-356.
[2]PAWLAK Z.Rough set approach to multi-attribute decision analysis[J].European Journal of Operational Research,1993,72:443-459.
[3]KRYSZKIEWICZ M.Comparative studies of alternative type of knowledge reduction in inconsistent systems[J].Internatonal Journal of Intelligent Sytems,2001,16(1):105-120.
[4]张文修,米据生,吴伟志.不协调目标信息系统的知识约简[J].计算机学报,2003,26:12-18.
[5]ZHANG W X,MI J S,WU W Z.Approaches to knowledge reductions in inconsistent systems[J].International Journal of Intelligent Systems,2003,18:989-1000.
[6]王国胤,于洪,杨大春.基于条件信息熵的决策表约简[J].计算机学报,2002,25(7):759-766.
[7]QIN K Y,JING S H.The attribute reductions based onindiscernibility and discernibility relations[C]∥Proceedings of 2017 International Joint Conference on Rough Sets.Heidelberg:Springer International Publishing AG,2017:306-316.
[8]SKOWRON A,RAUSZER C.The discernibility matrices and functions in information systems[M].R.Slowinski(Ed.),Intelligent Decision Support,Handbookof Applications and Advances of the Rough Sets Theory,Kluwer,Dordrecht,1992.
[9]王珏,王任,苗夺谦,等.基于Rough Set理论的数据浓缩[J].计算机学报,1998(5):393-400.
[10]苗夺谦,胡桂荣.知识约简的一种启发式算法[J].计算机研究与发展,1999(6):681-684.
[11]贾平,代建华,潘云鹤,等.一种基于互信息增益率的新属性约简算法[J].浙江大学学报,2006(6):1041-1045.
[12]LI M,SHANG C X,FENG S Z,et al.Quick attribute reduction in inconsistent decision tables[J].Information Sciences,2014,254:155-180.
[13]CHEN D,WANG C,HU Q.New approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets[J].Information Sciences,2007,177(17):3500-3518.
[14]ZHAO Y,YAO Y Y,LUO F.Data analysis based on discer-nibility andindiscernibility[J].Information Sciences,2007,177(22):4959-4976.
[15]张小红,裴道武,代建华.模糊数学与rough集理论[M].北京:清华大学出版社,2013:264-265.
[1] CHENG Fu-hao, XU Tai-hua, CHEN Jian-jun, SONG Jing-jing, YANG Xi-bei. Strongly Connected Components Mining Algorithm Based on k-step Search of Vertex Granule and Rough Set Theory [J]. Computer Science, 2022, 49(8): 97-107.
[2] XU Si-yu, QIN Ke-yun. Topological Properties of Fuzzy Rough Sets Based on Residuated Lattices [J]. Computer Science, 2022, 49(6A): 140-143.
[3] FANG Lian-hua, LIN Yu-mei, WU Wei-zhi. Optimal Scale Selection in Random Multi-scale Ordered Decision Systems [J]. Computer Science, 2022, 49(6): 172-179.
[4] CHEN Yu-si, AI Zhi-hua, ZHANG Qing-hua. Efficient Neighborhood Covering Model Based on Triangle Inequality Checkand Local Strategy [J]. Computer Science, 2022, 49(5): 152-158.
[5] SUN Lin, HUANG Miao-miao, XU Jiu-cheng. Weak Label Feature Selection Method Based on Neighborhood Rough Sets and Relief [J]. Computer Science, 2022, 49(4): 152-160.
[6] 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.
[7] WANG Zhi-cheng, GAO Can, XING Jin-ming. Three-way Approximate Reduction Based on Positive Region [J]. Computer Science, 2022, 49(4): 168-173.
[8] XUE Zhan-ao, HOU Hao-dong, SUN Bing-xin, YAO Shou-qian. Label-based Approach for Dynamic Updating Approximations in Incomplete Fuzzy Probabilistic Rough Sets over Two Universes [J]. Computer Science, 2022, 49(3): 255-262.
[9] 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.
[10] XUE Zhan-ao, SUN Bing-xin, HOU Hao-dong, JING Meng-meng. Optimal Granulation Selection Method Based on Multi-granulation Rough Intuitionistic Hesitant Fuzzy Sets [J]. Computer Science, 2021, 48(10): 98-106.
[11] XUE Zhan-ao, ZHANG Min, ZHAO Li-ping, LI Yong-xiang. Variable Three-way Decision Model of Multi-granulation Decision Rough Sets Under Set-pair Dominance Relation [J]. Computer Science, 2021, 48(1): 157-166.
[12] 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.
[13] CHEN Yu-jin, XU Ji-hui, SHI Jia-hui, LIU Yu. Three-way Decision Models Based on Intuitionistic Hesitant Fuzzy Sets and Its Applications [J]. Computer Science, 2020, 47(8): 144-150.
[14] ZHOU Jun-li, GUAN Yan-yong, XU Fa-sheng and WANG Hong-kai. Core in Covering Approximation Space and Its Properties [J]. Computer Science, 2020, 47(6A): 526-529.
[15] ZHANG Qin, CHEN Hong-mei, FENG Yun-fei. Overlapping Community Detection Method Based on Rough Sets and Density Peaks [J]. Computer Science, 2020, 47(5): 72-78.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!