Matrix‐based method for solving decision domains of neighbourhood multigranulation decision‐theoretic rough sets
Authors: 
Jiajun Chen, Shuhao Yu, Wenjie Wei, Yan MaAuthors Info & Claims
Jiajun Chen, Shuhao Yu, Wenjie Wei, Yan MaAuthors Info & ClaimsPages 313 - 327
Abstract
It is more and more important to analyse and process complex data for gaining more valuable knowledge and making more accurate decisions. The multigranulation decision theory based on conditional probability and cost loss has the advantage of processing decision‐making problems from multi‐levels and multi‐angles, and the neighbourhood rough set model (NRS) can facilitate the analysis and processing of numerical or mixed type data, and can address the limitation of multigranulation decision‐theoretic rough sets (MG‐DTRS), which is not easy to cope with complex data. Based on the in‐depth study of hybrid‐valued decision systems and MG‐DTRS models, this study analysed neighbourhood MG‐DTRS (NMG‐DTRS) deeply by fusing MG‐DTRS and NRS; a matrix‐based approach for approximation sets of NMG‐DTRS model was proposed on the basis of the matrix representations of concepts; the positive, boundary and negative domains were constructed from the matrix perspective, and the concept of positive decision recognition rate was introduced. Furthermore, the authors explored the related properties of NMG‐DTRS model, and designed and described the corresponding solving algorithms in detail. Finally, some experimental results that were employed not only verified the effectiveness and feasibility of the proposed algorithm, but also showed the relationship between the decision recognition rate and the granularity and threshold.
References
[1]
Pawlak, Z.: Rough sets [J]. Int. J. Comput. Inf. Sci. 11(5), 341–356 (1982)
[2]
Kryszkiewicz, M.: Rough set approach to incomplete information systems[J]. Information Sciences. 112(1‐4). 39–49 (1998)
[3]
Miao, D., Li, D.: Rough Set Theory, Algorithm and Application[M]. Science Press, Beijing (2007)
[4]
Yao, Y.: Decision‐theoretic rough set models [J]. Rough Sets and Knowledge Technology. 4481, 1–12 (2007)
[5]
Qian, Y., et al.: Multigranulation decision‐theoretic rough sets[J]. Int. J. Approx. Reason. 55, 225–237 (2014)
[6]
Yang, H.L., Guo, Z.L.: Multigranulation decision‐theoretic rough sets in incomplete information systems[J]. Int. J. Mach. Learn. Cybernetics. 6(6), 1005–1018 (2015)
[7]
Ju, H., et al.: Cost‐sensitive rough set: a multi‐granulation approach[J]. Knowl. Base. Syst. 123(1), 137–153 (2017)
[8]
Chen, J., et al.: Granularity reduction method based on positive decision holding for multi‐granulation decision‐theoretic rough set[J]. J. Eng. 2018(10), 1389–1395 (2018)
[9]
Li, H., Zhou, X.: Risk decision making based on decision‐theoretic rough set: a three‐way view decision model[J]. Int. J. Comput. Intell. Syst. 4(1), 1–11 (2011)
[10]
Dou, H., et al.: Decision‐theoretic rough set: a multicost strategy [J]. Knowl. Base Syst. 91(91), 71–83 (2016)
[11]
Suo, M., et al.: Single‐parameter decision‐theoretic rough set[J]. Information Sci. 539(539), 49–80 (2020)
[12]
Yin, T., et al.: Decision‐theoretic rough set: a fusion strategy[8]. IEEE Access. 8(8), 221027–221038 (2020)
[13]
Guo, Y., et al.: Adaptive weighted generalized multi‐granulation interval‐valued decision‐theoretic rough sets[J]. Knowl. Base Syst. 187(187), 104804 (2020)
[14]
Chen, J., et al.: Incomplete neighbourhood multi‐granulation decision‐theoretic rough set in the hybrid valued decision system[J]. J. Eng. 2019(12), 8477–8488 (2019)
[15]
Qian, Y., et al.: multi‐granulation decision‐theoretic rough sets[J]. Int. J. Approx. Reason. 55, 225–237 (2014)
[16]
Lin, T.Y.: Neighbourhood systems and approximation in database and knowledge base systems[C]. In: Proceedings of the Fourth International Symposium on Methodologies of Intelligent Systems Poster Session. pp. 75–86. Cambridge (1989)
[17]
Lin, T.Y.: Granular and nearest neighbourhoods: rough set approach[J]. Stud. Fuzziness Soft Comput. 70(15), 125–142 (2001)
[18]
Li, W., et al.: Neighbourhood based decision‐theoretic rough set models[J]. Int. J. Approx. Reason. 69(C), 1–17 (2016)
[19]
Sun, L., et al.: Neighbourhood multi‐granulation rough sets‐based attribute reduction using Lebesgue and entropy measures in incomplete neighbourhood decision systems[J]. Knowl. Base Syst. 192, 105373 (2020)
[20]
Hu, C., Zhang, L.: A dynamic framework for updating neighbourhood multigranulation approximations with the variation of objects[J]. Inf. Sci. 519(519), 382–406 (2020)
[21]
Zhang, J.B., et al.: Rough sets based matrix approaches with dynamic attribute variation in set‐valued information systems[J]. Approximate Reasoning. 53(4), 620–635 (2012)
[22]
Luo, C., et al.: Matrix approach to decision‐theoretic rough sets for evolving data[J]. Knowl. Base Syst. 99(99), 123–134 (2016)
[23]
Hu, X., Liu, S.X., Liu, G.X.: Matrix‐based approaches for dynamic updating approximations in multigranulation rough sets[J]. Knowl. Base Syst. 122(122), 51–63 (2017)
[24]
Zhang, J., et al.: A parallel matrix‐based method for computing approximations in incomplete information systems[J]. IEEE Trans. Knowl. Data Eng. (27), 326–339 (2015)
[25]
Yu, P., et al.: Matrix‐based approaches for updating approximations in neighbourhood multigranulation rough sets while neighbourhood classes decreasing or increasing[J]. J. Intell. Fuzzy Syst. 37(2), 2847–2867 (2019)
[26]
CaihuiLiu, K., et al.: Novel matrix‐based approaches to computing minimal and maximal descriptions in covering‐based rough sets[J]. Inf. Sci. 539(539), 312–326 (2020)
[27]
Alcantud, José Carlos, R., Zhan, J.: Multi‐granular soft rough covering sets[J]. Soft Compute 24, 9391–9402 (2020)
[28]
Ma, X., et al.: Novel classes of coverings based multigranulation fuzzy rough sets and corresponding applications to multiple attribute group decision‐making[J]. Artif. Intell. Rev. 53, 6197–6256 (2020)
Recommendations
Multigranulation decision-theoretic rough sets
The Bayesian decision-theoretic rough sets propose a framework for studying rough set approximations using probabilistic theory, which can interprete the parameters from existing forms of probabilistic approaches to rough sets. Exploring rough sets in ...
Covering-based multigranulation decision-theoretic rough sets
In this paper, we study covering-based multigranulation decision-theoretic rough sets in a multi-covering space. From viewpoints of granule, we propose the notions of covering-based mean multigranulation decision-theoretic rough sets, covering-based ...
On local multigranulation covering decision-theoretic rough sets
Multi-granulation decision-theoretic rough sets uses the granular structures induced by multiple binary relations to approximate the target concept, which can get a more accurate description of the approximate space. However, Multi-granulation decision-...
Comments
Information & Contributors
Information
Published In
© 2021 The Authors. CAAI Transactions on Intelligence Technology published by John Wiley & Sons Ltd on behalf of The Institution of Engineering and Technology and Chongqing University of Technology.
This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.
Publisher
John Wiley & Sons, Inc.
United States
Publication History
Published: 22 August 2021
Author Tags
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 13 Sep 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in