USE OF MAXIMUM-ENTROPY METHOD AS A METHODOLOGY FOR PROBABILISTIC REASONING

Citation
Pc. Rhodes et Gr. Garside, USE OF MAXIMUM-ENTROPY METHOD AS A METHODOLOGY FOR PROBABILISTIC REASONING, Knowledge-based systems, 8(5), 1995, pp. 249-258
Citations number
19
Categorie Soggetti
System Science","Computer Science Artificial Intelligence
Journal title
ISSN journal
09507051
Volume
8
Issue
5
Year of publication
1995
Pages
249 - 258
Database
ISI
SICI code
0950-7051(1995)8:5<249:UOMMAA>2.0.ZU;2-E
Abstract
Current methodologies which use probability theory for handling uncert ainty are designed primarily for use in expert systems and require ver y specific knowledge for encapsulation. However, there are other situa tions where it would be desirable to use probabilistic reasoning but i t would not be realistic to expect the knowledge to be available in a very specific form. For example, in some knowledge domains, such as en gineering/manufacturing, knowledge exists which is not in the form req uired by these systems, and, for some purposes, such as decision suppo rt, it is quite possible for the knowledge provider to know about prim ary cause/effect relationships but not be in a position to assert that other relationships are nonexistent. The paper presents a method for reasoning in small knowledge domains which overcomes the above problem . The method invokes maximum entropy theory to estimate missing inform ation and provide advice based on the knowledge available. The method is also shown to be capable of encapsulating whatever knowledge is ava ilable. The paper concludes by looking at the heavy computational requ irements of the maximum entropy method for large knowledge domains, an d it suggests that these might be alleviated, in many practical cases, because of the sparse nature of human knowledge in any domain. This w ill be the subject of further work.