Partially supervised learning by a Credal EM approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3571 LNAI, Issue , 2005, Pages 956-967

  Vannoorenberghe, Patrick ^a   Smets, Philippe ^b  

^a UNIVERSITÉ DE ROUEN   (France)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Belief functions; EM; Learning; Transferable belief model

Indexed keywords

ALGORITHMS; FUNCTIONS; KNOWLEDGE ENGINEERING; PROBABILITY; SET THEORY; SUPERVISORY AND EXECUTIVE PROGRAMS; UNCERTAIN SYSTEMS;

BELIEF FUNCTIONS; PROBABILITY FUNCTION; SUPERVISED LEARNING; TRANSFERABLE BELIEF MODEL;

LEARNING SYSTEMS;

EID: 26944470740     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11518655_80     Document Type: Conference Paper

References (15)

1. Ambroise, C., Denoeux, T., Govaert, G., &: Smets, P. (2001). Learning from an imprecise teacher: probabilistic and evidential approaches. In Proceedings of asmda'2001 (Vol. 1, pp. 100-105). Compiègne, France.
2. Ambroise, C., & Govaert, G. (2000). EM algorithm for partially known labels. In Proceeding of IFCS'2000 (Vol. 1). Namur, Belgium.
3. Delmotte, F., & Smets, P. (2004). Target identification based on the transferable belief model interpretation of Dempster-Shafer model. IEEE Transactions on Systems, Man and Cybernetics, A 34, 457-471.
4. Dempster, A., Laird, N., & Rubin, D. (1977). Maximum likelihood estimation from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, series B, 39, 1-38.
5. Denœux, T. (1995). A k-nearest neighbor classification rule based on Dempster-Shafer theory. IEEE Transactions on Systems, Man and Cybernetics, 25(5), 804-813.
6. Denœux, T., & Zouhal, L. M. (2001). Handling possibilistic labels in pattern classification using evidential reasoning. Puzzy Sets and Systems, 122, 47-62.
7. Figueiredo, M. A. T., & Jain, A. K. (2002). Unsupervised learning of finite mixture models. IEEE Trans. Pattern Anal. Mach. Intell., 24(3), 381-396.
8. Hastie, T., & Tibshirani, R. J. (1996). Discriminant analysis by gaussian mixtures. Journal of the Royal Statistical Society B, 58, 155-176.
9. Kennes, R. (1992). Computational aspects of the Möbius transform of a graph. IEEE-SMC, 22, 201-223.
10. McLaclan, G. J., &: Krishnan, T. (1997). The EM algorithm and extensions. New York: John Wiley.
11. Smets, P. (1993). Belief functions: the disjunctive rule of combination and the generalized Bayesian theorem. Int. J. Approximate Reasoning, 9, 1-35.
12. Smets, P. (1998). The transferable belief model for quantified belief representation. In D. M. Gabbay & P. Smets (Eds.), Handbook of defeasible reasoning and uncertainty management systems (Vol. 1, pp. 267-301). Kluwer, Doordrecht, The Netherlands.
13. Smets, P. (2005). Decision making in the TBM: the necessity of the pignistic transformation. Int. J. Approximate Reasoning, 38, 133-147.
14. Smets, P., & Kennes, R. (1994). The transferable belief model. Artificial Intelligence, 66, 191-234.
15. Zouhal, L. M., & Denoeux, T. (1998). An evidence theoretic k-nn rule with parameter optimisation. IEEE Transactions on Systems, Man and Cybernetics - Part C, 28, 263-271.