An improved evidence combination method of D-S theory

Haobin Shi, Shuyun Yang, Zhenliang Cao, Wei Pan, Weihua Li

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

Dempster-Shafer evidence theory provides a useful computational scheme for integrating uncertain information from multiple sources. However, the combination result can be paradoxical when the evidences seriously conflict with each other. In this paper, we present an improved D-S algorithm which verifies the weights of conflicting evidences. Firstly, we calculate the distance between any two of the evidences by the Jousselme distance formula and obtain the entropy index of distance correspondingly by using information entropy theory. Secondly, compute the relative support degree and absolute support degree so as to modifies the basic probability assignment (BPA). Experiments show that this method has a more comprehensive consideration of conflict evidences problem and more sensitive on the differences of focal element.

Original languageEnglish
Title of host publicationProceedings - 2016 IEEE International Symposium on Computer, Consumer and Control, IS3C 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages319-322
Number of pages4
ISBN (Electronic)9781509030712
DOIs
StatePublished - 16 Aug 2016
Event2016 IEEE International Symposium on Computer, Consumer and Control, IS3C 2016 - Xi'an, China
Duration: 4 Jul 20166 Jul 2016

Publication series

NameProceedings - 2016 IEEE International Symposium on Computer, Consumer and Control, IS3C 2016

Conference

Conference2016 IEEE International Symposium on Computer, Consumer and Control, IS3C 2016
Country/TerritoryChina
CityXi'an
Period4/07/166/07/16

Keywords

  • Combination rule
  • Conflict
  • Data fusion
  • Dempster-Shafer theory
  • Information entropy

Fingerprint

Dive into the research topics of 'An improved evidence combination method of D-S theory'. Together they form a unique fingerprint.

Cite this