Critical remarks on the computational complexity in probabilistic inference

  • Authors:
  • S. K. M. Wong;D. Wu;Y. Y. Yao

  • Affiliations:
  • Department of Computer Science, University of Regina, Regina, Saskatchewan, Canada;Department of Computer Science, University of Regina, Regina, Saskatchewan, Canada;Department of Computer Science, University of Regina, Regina, Saskatchewan, Canada

  • Venue:
  • RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we review the historical development of using probability for managing uncertain information from the inference perspective. We discuss in particular the NP-hardness of probabilistic inference in Bayesian networks