In this paper we extend an earlier result within Dempster-Shafer theory ["Fast Dempster-Shafer Clustering Using a Neural Network Structure," in Proc. Seventh Int. Conf. Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU 98)] where a large number of pieces of evidence are clustered into subsets by a neural network structure. The clustering is done by minimizing a metaconflict function. Previously we developed a method based on iterative optimization. While the neural method had a much lower computation time than iterative optimization its average clustering performance was not as good. Here, we develop a hybrid of the two methods. We let the neural structure do the initial clustering in order to achieve a high computational performance. Its solution is fed as the initial state to the iterative optimization in order to improve the clustering performance.
[1]
Glenn Shafer,et al.
A Mathematical Theory of Evidence
,
2020,
A Mathematical Theory of Evidence.
[2]
Johan Schubert.
On nonspecific evidence
,
1993,
Int. J. Intell. Syst..
[3]
Johan Schubert,et al.
Cluster-based Specification Techniques in Dempster-Shafer Theory
,
1995,
ECSQARU.
[4]
Johan Schubert,et al.
Fast Dempster-Shafer clustering using a neural network structure
,
2003,
ArXiv.
[5]
J. J. Hopfield,et al.
“Neural” computation of decisions in optimization problems
,
1985,
Biological Cybernetics.