How to improve Dempster's combination rule from point of view of random set framework

Yunmin Zhu; X. Rong Li

doi:10.1109/ICCIAS.2006.294089

How to improve Dempster's combination rule from point of view of random set framework

Yunmin Zhu
, X. Rong Li

Sichuan University
University of New Orleans

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

2 引用（Scopus）

摘要

The Dempster's combination rule has been widely used recently since it is a convenient and promising method to combine multi-source information with their own confidence degrees/evidences. On the other hand, it has been criticized and debated upon its some counterintuitive behavior and too restrictive requirements. To clarify the theoretical essence of the Dempster's combination rule and provide a direction to solve these problems, the Dempster's combination rule is formulated based on random set theory first. Then, under this framework, all possible combination rules are presented, and these combination rules based on correlated sensor confidence degrees (evidence supports) are proposed. Finally, the optimal Bayes combination rule can be given whenever all necessary priori conditions are available.

源语言	英语
主期刊名	2006 International Conference on Computational Intelligence and Security, ICCIAS 2006
出版商	IEEE Computer Society
页	51-56
页数	6
ISBN（印刷版）	1424406056, 9781424406050
DOI	https://doi.org/10.1109/ICCIAS.2006.294089
出版状态	已出版 - 2006
已对外发布	是
活动	2006 International Conference on Computational Intelligence and Security, ICCIAS 2006 - Guangzhou, 中国期限: 3 10月 2006 → 6 10月 2006

出版系列

姓名	2006 International Conference on Computational Intelligence and Security, ICCIAS 2006
卷	1

会议

会议	2006 International Conference on Computational Intelligence and Security, ICCIAS 2006
国家/地区	中国
市	Guangzhou
时期	3/10/06 → 6/10/06

访问文件

10.1109/ICCIAS.2006.294089

其它文件与链接

链接到 Scopus 的出版物

引用此

Zhu, Y., & Li, X. R. (2006). How to improve Dempster's combination rule from point of view of random set framework. 在 2006 International Conference on Computational Intelligence and Security, ICCIAS 2006 (页码 51-56). 文章 4072042 (2006 International Conference on Computational Intelligence and Security, ICCIAS 2006; 卷 1). IEEE Computer Society. https://doi.org/10.1109/ICCIAS.2006.294089

@inproceedings{626da30290e547e8aa9667802f750f54,

title = "How to improve Dempster's combination rule from point of view of random set framework",

abstract = "The Dempster's combination rule has been widely used recently since it is a convenient and promising method to combine multi-source information with their own confidence degrees/evidences. On the other hand, it has been criticized and debated upon its some counterintuitive behavior and too restrictive requirements. To clarify the theoretical essence of the Dempster's combination rule and provide a direction to solve these problems, the Dempster's combination rule is formulated based on random set theory first. Then, under this framework, all possible combination rules are presented, and these combination rules based on correlated sensor confidence degrees (evidence supports) are proposed. Finally, the optimal Bayes combination rule can be given whenever all necessary priori conditions are available.",

author = "Yunmin Zhu and Li, \{X. Rong\}",

year = "2006",

doi = "10.1109/ICCIAS.2006.294089",

language = "英语",

isbn = "1424406056",

series = "2006 International Conference on Computational Intelligence and Security, ICCIAS 2006",

publisher = "IEEE Computer Society",

pages = "51--56",

booktitle = "2006 International Conference on Computational Intelligence and Security, ICCIAS 2006",

note = "2006 International Conference on Computational Intelligence and Security, ICCIAS 2006 ; Conference date: 03-10-2006 Through 06-10-2006",

}

Zhu, Y & Li, XR 2006, How to improve Dempster's combination rule from point of view of random set framework. 在 2006 International Conference on Computational Intelligence and Security, ICCIAS 2006., 4072042, 2006 International Conference on Computational Intelligence and Security, ICCIAS 2006, 卷 1, IEEE Computer Society, 页码 51-56, 2006 International Conference on Computational Intelligence and Security, ICCIAS 2006, Guangzhou, 中国, 3/10/06. https://doi.org/10.1109/ICCIAS.2006.294089

How to improve Dempster's combination rule from point of view of random set framework. / Zhu, Yunmin; Li, X. Rong.
2006 International Conference on Computational Intelligence and Security, ICCIAS 2006. IEEE Computer Society, 2006. 页码 51-56 4072042 (2006 International Conference on Computational Intelligence and Security, ICCIAS 2006; 卷 1).

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

TY - GEN

T1 - How to improve Dempster's combination rule from point of view of random set framework

AU - Zhu, Yunmin

AU - Li, X. Rong

PY - 2006

Y1 - 2006

N2 - The Dempster's combination rule has been widely used recently since it is a convenient and promising method to combine multi-source information with their own confidence degrees/evidences. On the other hand, it has been criticized and debated upon its some counterintuitive behavior and too restrictive requirements. To clarify the theoretical essence of the Dempster's combination rule and provide a direction to solve these problems, the Dempster's combination rule is formulated based on random set theory first. Then, under this framework, all possible combination rules are presented, and these combination rules based on correlated sensor confidence degrees (evidence supports) are proposed. Finally, the optimal Bayes combination rule can be given whenever all necessary priori conditions are available.

AB - The Dempster's combination rule has been widely used recently since it is a convenient and promising method to combine multi-source information with their own confidence degrees/evidences. On the other hand, it has been criticized and debated upon its some counterintuitive behavior and too restrictive requirements. To clarify the theoretical essence of the Dempster's combination rule and provide a direction to solve these problems, the Dempster's combination rule is formulated based on random set theory first. Then, under this framework, all possible combination rules are presented, and these combination rules based on correlated sensor confidence degrees (evidence supports) are proposed. Finally, the optimal Bayes combination rule can be given whenever all necessary priori conditions are available.

UR - https://www.scopus.com/pages/publications/38549128181

U2 - 10.1109/ICCIAS.2006.294089

DO - 10.1109/ICCIAS.2006.294089

M3 - 会议稿件

AN - SCOPUS:38549128181

SN - 1424406056

SN - 9781424406050

T3 - 2006 International Conference on Computational Intelligence and Security, ICCIAS 2006

SP - 51

EP - 56

BT - 2006 International Conference on Computational Intelligence and Security, ICCIAS 2006

PB - IEEE Computer Society

T2 - 2006 International Conference on Computational Intelligence and Security, ICCIAS 2006

Y2 - 3 October 2006 through 6 October 2006

ER -

How to improve Dempster's combination rule from point of view of random set framework

摘要

出版系列

会议

访问文件

其它文件与链接

学术指纹

引用此