pith. sign in

arxiv: cs/0305024 · v1 · submitted 2003-05-16 · 💻 cs.AI · cs.NE

A neural network and iterative optimization hybrid for Dempster-Shafer clustering

classification 💻 cs.AI cs.NE
keywords clusteringneuraliterativeoptimizationdempster-shafernetworkperformancestructure
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.