Belief functions and rough sets: Survey and new insights

被引:43
作者
Campagner, Andrea [1 ]
Ciucci, Davide [1 ]
Denoeux, Thierry [2 ,3 ]
机构
[1] Univ Milano Bicocca, Dipartimento Informat Sistemist & Comunicaz, Milan, Italy
[2] Univ Technol Compiegne, CNRS, UMR Heudiasyc 7253, Compiegne, France
[3] Inst Univ France, Paris, France
关键词
Rough set theory; Evidence theory; Belief functions; Uncertainty representation; Knowledge representation; Machine learning; DEMPSTER-SHAFER THEORY; ATTRIBUTE REDUCTION; C-MEANS; FUZZY-SETS; APPROXIMATION; COMBINATION; ALGORITHM; FRAMEWORK; SYSTEMS; EVCLUS;
D O I
10.1016/j.ijar.2022.01.011
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Rough set theory and belief function theory, two popular mathematical frameworks for uncertainty representation, have been widely applied in different settings and contexts. Despite different origins and mathematical foundations, the fundamental concepts of the two formalisms (i.e., approximations in rough set theory, belief and plausibility functions in belief function theory) are closely related. In this survey article, we review the most relevant contributions studying the links between these two uncertainty representation formalisms. In particular, we discuss the theoretical relationships connecting the two approaches, as well as their applications in knowledge representation and machine learning. Special attention is paid to the combined use of these formalisms as a way of dealing with imprecise and uncertain information. The aim of this work is, thus, to provide a focused picture of these two important fields, discuss some known results and point to relevant future research directions. (C) 2022 Elsevier Inc. All rights reserved.
引用
收藏
页码:192 / 215
页数:24
相关论文
共 127 条
[1]   Variance based three-way clustering approaches for handling overlapping clustering [J].
Afridi, Mohammad Khan ;
Azam, Nouman ;
Yao, JingTao .
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2020, 118 :47-63
[2]   A three-way clustering approach for handling missing data using GTRS [J].
Afridi, Mohammad Khan ;
Azam, Nouman ;
Yao, JingTao ;
Alanazi, Eisa .
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2018, 98 :11-24
[3]  
[Anonymous], 2015, SPRING HDB COMP INT
[4]   CECM: Constrained evidential C-means algorithm [J].
Antoine, V. ;
Quost, B. ;
Masson, M. -H. ;
Denoeux, T. .
COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2012, 56 (04) :894-914
[5]  
Augustin T, 2014, WILEY SER PROBAB ST, P135
[6]  
Bahri Nassim, 2020, Scalable Uncertainty Management. 14th International Conference, SUM 2020. Proceedings. Lecture Notes in Artificial Intelligence Subseries of Lecture Notes in Computer Science (LNAI 12322), P234, DOI 10.1007/978-3-030-58449-8_17
[7]  
Bello R, 2017, STUD COMPUT INTELL, V708, P87, DOI 10.1007/978-3-319-54966-8_5
[8]  
Bezdek J., 1999, FUZZY MODELS ALGORIT
[9]   Fuzzy subsethood and belief functions of fuzzy events [J].
Biacino, Loredana .
FUZZY SETS AND SYSTEMS, 2007, 158 (01) :38-49
[10]   Feature Selection and Disambiguation in Learning from Fuzzy Labels Using Rough Sets [J].
Campagner, Andrea ;
Ciucci, Davide .
ROUGH SETS (IJCRS 2021), 2021, 12872 :164-179