Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms (Paperback)
暫譯: 使用概率與確定性圖形模型進行推理:精確演算法 (平裝本)

Rina Dechter

  • 出版商: Morgan & Claypool
  • 出版日期: 2013-12-01
  • 售價: $1,700
  • 貴賓價: 9.5$1,615
  • 語言: 英文
  • 頁數: 192
  • 裝訂: Paperback
  • ISBN: 162705197X
  • ISBN-13: 9781627051972
  • 相關分類: Algorithms-data-structures
  • 立即出貨 (庫存=1)

相關主題

商品描述

Graphical models (e.g., Bayesian and constraint networks, influence diagrams, and Markov decision processes) have become a central paradigm for knowledge representation and reasoning in both artificial intelligence and computer science in general. These models are used to perform many reasoning tasks, such as scheduling, planning and learning, diagnosis and prediction, design, hardware and software verification, and bioinformatics. These problems can be stated as the formal tasks of constraint satisfaction and satisfiability, combinatorial optimization, and probabilistic inference. It is well known that the tasks are computationally hard, but research during the past three decades has yielded a variety of principles and techniques that significantly advanced the state of the art.

In this book we provide comprehensive coverage of the primary exact algorithms for reasoning with such models. The main feature exploited by the algorithms is the model's graph. We present inference-based, message-passing schemes (e.g., variable-elimination) and search-based, conditioning schemes (e.g., cycle-cutset conditioning and AND/OR search). Each class possesses distinguished characteristics and in particular has different time vs. space behavior. We emphasize the dependence of both schemes on few graph parameters such as the treewidth, cycle-cutset, and (the pseudo-tree) height. We believe the principles outlined here would serve well in moving forward to approximation and anytime-based schemes. The target audience of this book is researchers and students in the artificial intelligence and machine learning area, and beyond.

Table of Contents: Preface / Introduction / What are Graphical Models / Inference: Bucket Elimination for Deterministic Networks / Inference: Bucket Elimination for Probabilistic Networks / Tree-Clustering Schemes / AND/OR Search Spaces and Algorithms for Graphical Models / Combining Search and Inference: Trading Space for Time / Conclusion / Bibliography / Author's Biography

商品描述(中文翻譯)

圖形模型(例如,貝葉斯網絡、約束網絡、影響圖和馬可夫決策過程)已成為人工智慧和計算機科學中知識表示與推理的核心範式。這些模型用於執行許多推理任務,例如排程、規劃與學習、診斷與預測、設計、硬體與軟體驗證,以及生物資訊學。這些問題可以表述為約束滿足和可滿足性、組合優化以及概率推理的正式任務。眾所周知,這些任務在計算上是困難的,但過去三十年的研究已產生多種原則和技術,顯著推進了該領域的技術水平。

在本書中,我們全面介紹了針對這些模型進行推理的主要精確算法。這些算法利用的主要特徵是模型的圖。我們介紹了基於推理的消息傳遞方案(例如,變量消除)和基於搜索的條件方案(例如,循環切割集條件和AND/OR搜索)。每一類方案都有其獨特的特徵,特別是在時間與空間的行為上有所不同。我們強調這兩種方案對於少數圖參數的依賴,例如樹寬、循環切割集和(偽樹)高度。我們相信這裡概述的原則將有助於推進近似和隨時可用的方案。本書的目標讀者是人工智慧和機器學習領域的研究人員和學生,以及其他相關領域的人士。

目錄:前言 / 介紹 / 什麼是圖形模型 / 推理:確定性網絡的桶消除 / 推理:概率網絡的桶消除 / 樹聚類方案 / 圖形模型的AND/OR搜索空間和算法 / 結合搜索與推理:以空間換取時間 / 結論 / 參考文獻 / 作者簡介