Modifiable Combining Functions

Paul R. Cohen, Glenn Shafer, Prakash P. Shenoy

UAI 1987 pp. 357-374

doi:10.1017/S0890060400000147 /uai/1987/cohen1987uai-modifiable/

Abstract

Modifiable combining functions are a synthesis of two common approaches to combining evidence. They offer many of the advantages of these approaches and avoid some disadvantages. Because they facilitate the acquisition, representation, explanation, and modification of knowledge about combinations of evidence, they are proposed as a tool for knowledge engineers who build systems that reason under uncertainty, not as a normative theory of evidence.

PDF UAI Semantic Scholar

Cite

Text

Cohen et al. "Modifiable Combining Functions." Conference on Uncertainty in Artificial Intelligence, 1987. doi:10.1017/S0890060400000147

Markdown

[Cohen et al. "Modifiable Combining Functions." Conference on Uncertainty in Artificial Intelligence, 1987.](https://mlanthology.org/uai/1987/cohen1987uai-modifiable/) doi:10.1017/S0890060400000147

BibTeX

@inproceedings{cohen1987uai-modifiable,
  title     = {{Modifiable Combining Functions}},
  author    = {Cohen, Paul R. and Shafer, Glenn and Shenoy, Prakash P.},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {1987},
  pages     = {357-374},
  doi       = {10.1017/S0890060400000147},
  url       = {https://mlanthology.org/uai/1987/cohen1987uai-modifiable/}
}