語系:
繁體中文
English
說明(常見問題)
回圖書館首頁
手機版館藏查詢
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Network Structure Sampling in Bayesi...
~
Sidrow, Evan.
FindBook
Google Book
Amazon
博客來
Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions.
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions./
作者:
Sidrow, Evan.
出版者:
Ann Arbor : ProQuest Dissertations & Theses, : 2018,
面頁冊數:
85 p.
附註:
Source: Masters Abstracts International, Volume: 57-06.
Contained By:
Masters Abstracts International57-06(E).
標題:
Applied mathematics. -
電子資源:
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10809287
ISBN:
9780438045330
Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions.
Sidrow, Evan.
Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions.
- Ann Arbor : ProQuest Dissertations & Theses, 2018 - 85 p.
Source: Masters Abstracts International, Volume: 57-06.
Thesis (M.S.)--University of Colorado at Boulder, 2018.
Bayesian networks are widely considered as powerful tools for modeling risk assessment, uncertainty, and decision making. They have been extensively employed to develop decision support systems in a variety of domains including medical diagnosis, risk assessment and management, human cognition, industrial process and procurement, pavement and bridge management, and system reliability. Bayesian networks are convenient graphical expressions for high dimensional probability distributions which are used to represent complex relationships between a large number of random variables. A Bayesian network is a directed acyclic graph consisting of nodes which represent random variables and arrows which correspond to probabilistic dependencies between them. The ability to recover Bayesian network structures from data is critical to enhance their application in modeling real-world phenomena.
ISBN: 9780438045330Subjects--Topical Terms:
2122814
Applied mathematics.
Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions.
LDR
:02926nmm a2200337 4500
001
2165987
005
20181203094030.5
008
190424s2018 ||||||||||||||||| ||eng d
020
$a
9780438045330
035
$a
(MiAaPQ)AAI10809287
035
$a
(MiAaPQ)colorado:15501
035
$a
AAI10809287
040
$a
MiAaPQ
$c
MiAaPQ
100
1
$a
Sidrow, Evan.
$3
3354087
245
1 0
$a
Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions.
260
1
$a
Ann Arbor :
$b
ProQuest Dissertations & Theses,
$c
2018
300
$a
85 p.
500
$a
Source: Masters Abstracts International, Volume: 57-06.
500
$a
Adviser: Jem N. Corcoran.
502
$a
Thesis (M.S.)--University of Colorado at Boulder, 2018.
520
$a
Bayesian networks are widely considered as powerful tools for modeling risk assessment, uncertainty, and decision making. They have been extensively employed to develop decision support systems in a variety of domains including medical diagnosis, risk assessment and management, human cognition, industrial process and procurement, pavement and bridge management, and system reliability. Bayesian networks are convenient graphical expressions for high dimensional probability distributions which are used to represent complex relationships between a large number of random variables. A Bayesian network is a directed acyclic graph consisting of nodes which represent random variables and arrows which correspond to probabilistic dependencies between them. The ability to recover Bayesian network structures from data is critical to enhance their application in modeling real-world phenomena.
520
$a
Many research efforts have been done on this topic to identify the specific network structure. Friedman and Koller suggest an approach based on the assumption that every Bayesian network has a corresponding ordering of its vertices. An order associated with a Bayesian network can be thought of as a logical ordering of causality, with random variables earlier in the order causing random variables later in the order.
520
$a
The Friedman and Koller (FK) algorithm itself is comprised of two steps: (1) Use Markov Chain Monte Carlo (MCMC) methods to sample the order of a Bayesian network and then (2) sample the parent set for each vertex independently using Bayesian methods. However, since some Bayesian networks are compatible with more orders than others, the FK algorithm is biased towards these networks. The algorithm presented in this thesis corrects this bias while adding minimal algorithmic complexity to the FK algorithm by uniformly drawing linear extensions of the partial ordering of vertices implied by any Bayesian network.
590
$a
School code: 0051.
650
4
$a
Applied mathematics.
$3
2122814
650
4
$a
Statistics.
$3
517247
650
4
$a
Computer science.
$3
523869
690
$a
0364
690
$a
0463
690
$a
0984
710
2
$a
University of Colorado at Boulder.
$b
Applied Mathematics.
$3
1030307
773
0
$t
Masters Abstracts International
$g
57-06(E).
790
$a
0051
791
$a
M.S.
792
$a
2018
793
$a
English
856
4 0
$u
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10809287
筆 0 讀者評論
館藏地:
全部
電子資源
出版年:
卷號:
館藏
1 筆 • 頁數 1 •
1
條碼號
典藏地名稱
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
W9365534
電子資源
11.線上閱覽_V
電子書
EB
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
評論
新增評論
分享你的心得
Export
取書館
處理中
...
變更密碼
登入