By Topic

Notes on “Reducing Algorithm Complexity for Computing an Aggregate Uncertainty Measure”

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Van-Nam Huynh ; Japan Adv. Inst. of Sci. & Technol., Nomi, Japan ; Nakamori, Yoshiteru

In a recent paper, Liu have proposed the so-called F -algorithm which conditionally reduces the computational complexity of the Meyerowitz-Richman-Walker algorithm for the computation of the aggregate-uncertainty measure in the Dempster-Shafer theory of evidence, along with an illustration of its application in a practical scenario of target identification. In this correspondence, we will point out several technical mistakes, which some of them lead to some inexact or incomplete statements in the paper of Liu The corrections of these mistakes will be made, and some further improvement and results will be derived.

Published in:

Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on  (Volume:40 ,  Issue: 1 )