publication . Preprint . Article . 2013

Modifiable combining functions

Paul R. Cohen; Glenn Shafer; Prakash P. Shenoy;
Open Access English
  • Published: 27 Mar 2013
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.
Subjects
free text keywords: Computer Science - Artificial Intelligence, Industrial and Manufacturing Engineering, Artificial Intelligence, Machine learning, computer.software_genre, computer, business.industry, business, Computer science, Normative

[1] Bylander, T. & Mittal, S. (1986). CSRL: A language for classificatory problem solving and uncertainty handling. AI Magazine, 7(3), 66-77.

[2] Chandrasakeran,B., Mittal, S., & Smith, J. W. (1982). Reasoning with uncertain knowledge: the MDX approach. Proceedings of the Congress of American M·edical Informatics Association, San Francisco, 335-339.

[3] Cohen, P., Day, D., Delisio, J., Greenberg, M., Kjeldsen, R., Suthers, D., & Berman, P. (1987). Management of uncertainty in medicine. Internaticmal Journal of Approximate Reasoning. 1(1). Forthcoming.

[4] Gruber, T. R. & Cohen, P. RDesign for acquisition: principles of knowledge system design to facilitate knowledge acquisition. To appear in the International Journal of Man Machine Studies, 1987.

[5] Patil, R.S., Szolovits, P., and Schwartz, W. B. 1981. Causal understanding of patient illness in medical diagnosis. Proceedings of 7th International Conference on Artificial Intelligence. 893-899. [OpenAIRE]

[6] Pauker, S., Gorry, G., Kassirer, J., and Schwartz, W. 1976. Toward the simulation of clinical cognition: Taking a present illness by computer. American Journal of Medicine. 60:981-995 [OpenAIRE]

[7] Pearl, J. 1986. Fusion, propagation, and structuring in Bayesian networks. Artificial Intelligence. 29: 241-288. [OpenAIRE]

[8] Pople, H. 1977. The formation of composite hypotheses in diagnostic problem solving- an exercise in synthetic reasoning, IJCAIS. 1030-1037

[9] Samuel, A. L. 1959. Some studies in machine learning using the game of checkers.IBM Journal of research and development. 3:210:229.

[10] Shafer, G. 1981. Jefrey's rule of conditioning. Philosophy of Science.48(3): 337-362.

[11] Shortlife, E. (1976). Com puter-Based Medical Consultations: MYCIN. New York: AmericanElsevier.

[12] Shortlife, E. H. & Buchanan, B. G. {1975). A model of inexact reasoning in Biosciences. 23:351-379.

[13] Shafer, G. and Tversky, A. 1985 Languages and Designs for Probability Judgment, Cognitive Science. 9:309-339.

[14] Shenoy, P. and Shafer, G. 1986. Propagating belief functions with local computations.IEEE Expert. 1{3):43-52.

Any information missing or wrong?Report an Issue