Evidence Combination Based on Credal Belief Redistribution for Pattern Classification

被引:185
|
作者
Liu, Zhun-Ga [1 ]
Liu, Yu [2 ]
Dezert, Jean [3 ]
Cuzzolin, Fabio [4 ]
机构
[1] Northwestern Polytech Univ, Sch Automat, Xian 710065, Peoples R China
[2] Naval Aeronaut & Astronaut Univ, Res Inst Informat Fus, Yantai 264001, Peoples R China
[3] Off Natl Etud & Rech Aerosp, F-91761 Palaiseau, France
[4] Oxford Brookes Univ, Sch Engn Comp & Math, Oxford OX3 0BP, England
基金
中国国家自然科学基金;
关键词
Belief functions; classifier fusion; discounting; evidence theory; pattern classification; RULE; CONFLICT;
D O I
10.1109/TFUZZ.2019.2911915
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Evidence theory, also called belief function theory, provides an efficient tool to represent and combine uncertain information for pattern classification. Evidence combination can be interpreted, in some applications, as classifier fusion. The sources of evidence corresponding to multiple classifiers usually exhibit different classification qualities, and they are often discounted using different weights before combination. In order to achieve the best possible fusion performance, a new credal belief redistribution (CBR) method is proposed to revise such evidence. The rationale of CBR consists of transferring belief from one class not just to other classes, but also to the associated disjunctions of classes (i.e., meta-classes). As classification accuracy for different objects in a given classifier can also vary, the evidence is revised according to prior knowledge mined from its training neighbors. If the selected neighbors are relatively close to the evidence, a large amount of belief will be discounted for redistribution. Otherwise, only a small fraction of belief will enter the redistribution procedure. An imprecision matrix estimated based on these neighbors is employed to specifically redistribute the discounted beliefs. This matrix expresses the likelihood of misclassification (i.e., the probability of a test pattern belonging to a class different from the one assigned to it by the classifier). In CBR, the discounted beliefs are divided into two parts. One part is transferred between singleton classes, whereas the other is cautiously committed to the associated meta-classes. By doing this, one can efficiently reduce the chance of misclassification by modeling partial imprecision. The multiple revised pieces of evidence are finally combined by the Dempster-Shafer rule to reduce uncertainty and further improve classification accuracy. The effectiveness of CBR is extensively validated on several real datasets from the UCI repository and critically compared with that of other related fusion methods.
引用
收藏
页码:618 / 631
页数:14
相关论文
共 50 条
  • [31] Feature combination for binary pattern classification
    Hassan, Ehtesham
    Chaudhury, Santanu
    Gopal, M.
    [J]. INTERNATIONAL JOURNAL ON DOCUMENT ANALYSIS AND RECOGNITION, 2014, 17 (04) : 375 - 392
  • [32] Feature combination for binary pattern classification
    Ehtesham Hassan
    Santanu Chaudhury
    M. Gopal
    [J]. International Journal on Document Analysis and Recognition (IJDAR), 2014, 17 : 375 - 392
  • [33] Combination method of multi-evidence based on classification correction
    Wang, Liang
    Lü, Wei-Min
    Teng, Ke-Nan
    Jin, Yong-Chuan
    [J]. Kongzhi yu Juece/Control and Decision, 2015, 30 (01): : 125 - 130
  • [34] Uncertain Pattern Classification Based on Evidence Fusion in Different Domains
    Liu, Zhun-ga
    Huang, Linqing
    Quan Pan
    Zhou, Kuang
    Liu, Rui
    [J]. 2018 21ST INTERNATIONAL CONFERENCE ON INFORMATION FUSION (FUSION), 2018, : 657 - 663
  • [35] An improved conflicting-evidence combination method based on the redistribution of the basic probability assignment
    Yan, Zezheng
    Zhao, Hanping
    Mei, Xiaowen
    [J]. APPLIED INTELLIGENCE, 2022, 52 (04) : 4674 - 4700
  • [36] An improved conflicting-evidence combination method based on the redistribution of the basic probability assignment
    Zezheng Yan
    Hanping Zhao
    Xiaowen Mei
    [J]. Applied Intelligence, 2022, 52 : 4674 - 4700
  • [37] The contradiction between belief functions: Its description, measurement, and correction based on generalized credal sets
    Bronevich, Andrey G.
    Rozenberg, Igor N.
    [J]. INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2019, 112 : 119 - 139
  • [38] Provenance Across Evidence Combination in Theory of Belief Functions
    Kowalski, Pawel
    Martin, Trevor
    [J]. 2018 21ST INTERNATIONAL CONFERENCE ON INFORMATION FUSION (FUSION), 2018, : 635 - 642
  • [39] Heterogeneous information fusion: Combination of multiple supervised and unsupervised classification methods based on belief functions
    Li, Na
    Martin, Arnaud
    Estival, Remi
    [J]. INFORMATION SCIENCES, 2021, 544 : 238 - 265
  • [40] Automatic sleep stage classification based on sparse deep belief net and combination of multiple classifiers
    Zhang, Junming
    Wu, Yan
    Bai, Jing
    Chen, Fuqiang
    [J]. TRANSACTIONS OF THE INSTITUTE OF MEASUREMENT AND CONTROL, 2016, 38 (04) : 435 - 451