Abstract
Some general schemes and examples of aggregation of two belief functions into a single belief function are considered in this paper. We find some sufficient conditions of change of ignorance when evidences are combined with the help of various rules. It is shown that combining rules can be regarded as pessimistic or optimistic depending on the sign of the change of ignorance after applying.
Author supplied keywords
Cite
CITATION STYLE
Lepskiy, A. (2014). General Schemes of Combining Rules and the Quality Characteristics of Combining. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8764, 29–38. https://doi.org/10.1007/978-3-319-11191-9_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
