Normative expert systems have not become commonplace because they have been difficult to build and use. Over the past decade, however, researchers have developed the influence diagram, a graphical representation of a decision maker's beliefs, alternatives, and preferences that serves as the knowledge base of a normative expert system. Most people who have seen the representation find it intuitive and easy to use. Consequently, the influence diagram has overcome significantly the barriers to constructing normative expert systems. Nevertheless, building influence diagrams is not practical for extremely large and complex domains. In this book, I address the difficulties associated with the construction of the probabilistic portion of an influence diagram, called a knowledge map, belief network, or Bayesian network. I introduce two representations that facilitate the generation of large knowledge maps. In particular, I introduce the similarity network, a tool for building the network structure of a knowledge map, and the partition, a tool for assessing the probabilities associated with a knowledge map. I then use these representations to build Pathfinder, a large normative expert system for the diagnosis of lymph-node diseases (the domain contains over 60 diseases and over 100 disease findings). In an early version of the system, I encoded the knowledge of the expert using an erroneous assumption that all disease findings were independent, given each disease. When the expert and I attempted to build a more accurate knowledge map for the domain that would capture the dependencies among the disease findings, we failed. Using a similarity network, however, we built the knowledge-map structure for the entire domain in approximately 40 hours. Furthermore, the partition representation reduced the number of probability assessments required by the expert from 75,000 to 14,000.
Semantic Causal-Factor Inference from Aviation Incident Narratives Using A Variational Autoencoder with Cosine-Similarity-Based Reconstruction
SDAIA-KFUPM Joint Research Center for Artificial Intelligence, King Fahd University of Petroleum and Minerals (KFUPM)(SDAIA-KFUPM人工智能联合研究中心,法赫德国王石油与矿产大学);University of New South Wales(新南威尔士大学)
Methods for computing state similarity in Markov Decision Processes
解决大型概率系统的一种流行方法依赖于基于相似性度量的聚集状态。文献中的许多方法都是启发式的。许多最近的方法依赖于基于互模拟或状态之间的行为等效性的概念的度量(Givan et al,2001,2003; Ferns et al,2004)。这种度量的一个组成部分是概率分布之间的Kantorovich度量。然而,虽然该度量使许多令人满意的理论特性成为可能,但在实践中计算成本很高。在本文中,我们使用网络优化和统计抽样技术来克服这个问题。我们以这种方式获得各种距离函数的MDP状态聚合,不同的时间和空间复杂度之间的权衡,以及聚合的质量。我们提供了这些权衡的实证评估。