Maximum Likelihood from Evidential Data: An Extension of the EM Algorithm

  • Conference paper
Combining Soft Computing and Statistical Methods in Data Analysis

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 77))

Abstract

We consider the problem of statistical parameter estimation when the data are uncertain and described by belief functions. An extension of the Expectation-Maximization (EM) algorithm, called the Evidential EM (E2M) algorithm, is described and shown to maximize a generalized likelihood function. This general procedure provides a simple mechanism for estimating the parameters in statistical models when observed data are uncertain. The method is illustrated using the problem of univariate normal mean and variance estimation from uncertain data.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
EUR 29.95
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 245.03
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 316.49
Price includes VAT (France)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aggarwal, C.C., Yu, P.S.: A survey of uncertain data algorithms and applications. IEEE Trans. Knowl. Data Eng. 21(5), 609–623 (2009)

    Article  Google Scholar 

  2. Côme, E., Oukhellou, L., Denœux, T., Aknin, P.: Learning from partially supervised data using mixture models and belief functions. Pattern Recogn. 42(3), 334–348 (2009)

    Article  MATH  Google Scholar 

  3. Dempster, A.P.: Upper and lower probabilities induced by a multivalued map**. Ann. Math. Statist. 38, 325–339 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Statist. Soc. Ser. B 39, 1–38 (1977)

    MATH  MathSciNet  Google Scholar 

  5. Denœux, T., Masson, M.-H., Hébert, P.-A.: Nonparametric rank-based statistics and significance tests for fuzzy data. Fuzzy Sets Syst. 153, 1–28 (2005)

    Article  MATH  Google Scholar 

  6. Gebhardt, J., Gil, M.A., Kruse, R.: Fuzzy set-theoretic methods in statistics. In: Slowinski, R. (ed.) Fuzzy sets in decision analysis, operations research and statistics, pp. 311–347. Kluwer Academic Publishers, Boston (1998)

    Google Scholar 

  7. Jraidi, I., Elouedi, Z.: Belief classification approach based on generalized credal EM. In: Mellouli, K. (ed.) ECSQARU 2007. LNCS (LNAI), vol. 4724, pp. 524–535. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. McLachlan, G.J., Krishnan, T.: The EM Algorithm and Extensions. Wiley, New York (1997)

    MATH  Google Scholar 

  9. Shafer, G.: A mathematical theory of evidence. Princeton University Press, Princeton (1976)

    MATH  Google Scholar 

  10. Vannoorenberghe, P., Smets, P.: Partially supervised learning by a credal EM approach. In: Godó, L. (ed.) ECSQARU 2005. LNCS (LNAI), vol. 3571, pp. 956–967. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Zadeh, L.A.: Probability measures of fuzzy events. J. Math. Anal. Appl. 10, 421–427 (1968)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Denœux, T. (2010). Maximum Likelihood from Evidential Data: An Extension of the EM Algorithm. In: Borgelt, C., et al. Combining Soft Computing and Statistical Methods in Data Analysis. Advances in Intelligent and Soft Computing, vol 77. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14746-3_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14746-3_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14745-6

  • Online ISBN: 978-3-642-14746-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Navigation