Change search
ReferencesLink to record
Permanent link

Direct link
Computationally efficient multiple hypothesis association of intelligence reports
KTH, School of Architecture and the Built Environment (ABE), Philosophy and History of Technology, Philosophy.
2006 (English)In: 2006 9th International Conference on Information Fusion, Vols 1-4, 2006, 961-966 p.Conference paper (Refereed)
Abstract [en]

In this paper we develop a computationally efficient multiple hypothesis association algorithm for generation of alternative association hypotheses regarding cluster memberships of intelligence reports represented as belief functions. We have previously an O((NK2)-K-2) clustering algorithm using a measure of pairwise conflicts, and a fast algorithm for classification of clusters using a more advanced measure. As these measures are similar but not identical and may have different minima we generate additional multiple association hypotheses around the solution found by the clustering algorithm. These hypotheses may then be evaluated by the classification algorithm in order to find the best overall classification of all clusters. In order to maintain the computational complexity we will investigate algorithms that run in no worse than O((NK2)-K-2) time.

Place, publisher, year, edition, pages
2006. 961-966 p.
Keyword [en]
multiple hypotheses association, clustering, Dempster-Shafer theory, intelligence processing, belief function, force aggregation
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-42264DOI: 10.1109/ICIF.2006.301695ISI: 000245998000135ScopusID: 2-s2.0-50149087522ISBN: 978-1-4244-0953-2OAI: diva2:446102
2006 9th International Conference on Information Fusion, FUSION, Florence, Italy, JUL 10-13, 2006

QC 20141107

Available from: 2011-10-06 Created: 2011-10-06 Last updated: 2014-11-07Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Cantwell, John
By organisation
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 19 hits
ReferencesLink to record
Permanent link

Direct link