Learning from partially supervised data using mixture models and belief functions
Authors:
- E. CômeECE. Côme
- L. OukhellouLOL. Oukhellou
- T. DenœuxTDT. Denœux
- P. AkninPAP. Aknin
- 1 March 2009
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 42 (3) , 334-348
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Decision trees as possibilistic classifiersInternational Journal of Approximate Reasoning, 2008
- Pruning belief decision tree methods in averaging and conjunctive approachesInternational Journal of Approximate Reasoning, 2007
- Classification in the presence of class noise using a probabilistic Kernel Fisher methodPattern Recognition, 2007
- Semi-supervised learning with an imperfect supervisorKnowledge and Information Systems, 2005
- Belief decision trees: theoretical foundationsInternational Journal of Approximate Reasoning, 2001
- Handling possibilistic labels in pattern classification using evidential reasoningFuzzy Sets and Systems, 2001
- A k-nearest neighbor classification rule based on Dempster-Shafer theoryIEEE Transactions on Systems, Man, and Cybernetics, 1995
- The transferable belief modelArtificial Intelligence, 1994
- Estimating the Linear Discriminant Function from Initial Samples Containing a Small Number of Unclassified ObservationsJournal of the American Statistical Association, 1977
- A Comparison of Iterative Maximum Likelihood Estimates of the Parameters of a Mixture of Two Normal Distributions Under Three Different Types of Sample1973