Log In Sign Up

Fast Dempster-Shafer clustering using a neural network structure

by   Johan Schubert, et al.

In this article we study a problem within Dempster-Shafer theory where 2**n - 1 pieces of evidence are clustered by a neural structure into n clusters. The clustering is done by minimizing a metaconflict function. Previously we developed a method based on iterative optimization. However, for large scale problems we need a method with lower computational complexity. The neural structure was found to be effective and much faster than iterative optimization for larger problems. While the growth in metaconflict was faster for the neural structure compared with iterative optimization in medium sized problems, the metaconflict per cluster and evidence was moderate. The neural structure was able to find a global minimum over ten runs for problem sizes up to six clusters.


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

In this paper we extend an earlier result within Dempster-Shafer theory ...

Dempster-Shafer clustering using Potts spin mean field theory

In this article we investigate a problem within Dempster-Shafer theory w...

Creating Prototypes for Fast Classification in Dempster-Shafer Clustering

We develop a classification method for incoming pieces of evidence in De...

C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width

For a clustered graph, i.e, a graph whose vertex set is recursively part...

Hierarchical Clustering of Asymmetric Networks

This paper considers networks where relationships between nodes are repr...

Blink: Lightweight Sample Runs for Cost Optimization of Big Data Applications

Distributed in-memory data processing engines accelerate iterative appli...