By Topic

Reasoning with unlabeled samples and belief functions

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

1 Author(s)
Vannoorenberghe, P. ; Fac. des Sci., Rouen Univ., Mont Saint Aignan, France

This paper presents a decision rule which allows us to reason with unlabeled samples in the framework of Dempster-Shafer (DS) theory of evidence. Thanks to the power of this theoretical framework to represent different kinds of knowledge (from total ignorance to full knowledge), we propose an extension of a so-called evidential classifier which allows to process learning sets whose labeling has been specified with belief functions. This kind of functions can encode partial knowledge on examples of the learning set. In this context, using unlabeled examples can significantly improve the performance of the classifier. In addition, the proposed methodology constitutes by this way a convergence point between supervised and unsupervised learning.

Published in:

Fuzzy Systems, 2003. FUZZ '03. The 12th IEEE International Conference on  (Volume:2 )

Date of Conference:

25-28 May 2003