Computer Science – Artificial Intelligence
Scientific paper
2003-05-16
Soft Computing 5(3) (2001) 215-228
Computer Science
Artificial Intelligence
14 pages, 9 figures
Scientific paper
In this article we investigate a problem within Dempster-Shafer theory where 2**q - 1 pieces of evidence are clustered into q clusters by minimizing a metaconflict function, or equivalently, by minimizing the sum of weight of conflict over all clusters. Previously one of us developed a method based on a Hopfield and Tank model. However, for very large problems we need a method with lower computational complexity. We demonstrate that the weight of conflict of evidence can, as an approximation, be linearized and mapped to an antiferromagnetic Potts Spin model. This facilitates efficient numerical solution, even for large problem sizes. Optimal or nearly optimal solutions are found for Dempster-Shafer clustering benchmark tests with a time complexity of approximately O(N**2 log**2 N). Furthermore, an isomorphism between the antiferromagnetic Potts spin model and a graph optimization problem is shown. The graph model has dynamic variables living on the links, which have a priori probabilities that are directly related to the pairwise conflict between pieces of evidence. Hence, the relations between three different models are shown.
Bengtsson Mats
Schubert Johan
No associations
LandOfFree
Dempster-Shafer clustering using Potts spin mean field theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Dempster-Shafer clustering using Potts spin mean field theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dempster-Shafer clustering using Potts spin mean field theory will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-545301