Repository landing page
research
Controling the number of focal elements
Abstract
International audienceA basic belief assignment can have up to 2n focal elements, and combining them with a simple conjunctive operator will need O(22n ) opera- tions. This article proposes some techniques to limit the size of the focal sets of the bbas to be combined while preserving a large part of the information they carry. The first section revisits some well-known definitions with an algorithmic point of vue. The second section proposes a matrix way of building the least committed isopignistic, and extends it to some other bodies of evidence. The third section adapts the k-means algorithm for an unsupervized clustering of the focal elements of a given bba- info:eu-repo/semantics/conferenceObject
- Conference papers
- Basic belief assignments
- Combinatorial complexity
- Focal elements
- k-means
- Pignistic probability
- Body of evidence
- Least commitment
- [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT]
- [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]
- [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]