國立虎尾科技大學 |

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.
面頁冊數:	1 online resource (85 pages)
附註:	Source: Masters Abstracts International, Volume: 57-06.
Contained By:	Masters Abstracts International57-06(E).
標題:	Applied mathematics. -
電子資源:	click for full text (PQDT)
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. - 1 online resource (85 pages)

Source: Masters Abstracts International, Volume: 57-06.

Thesis (M.S.)--University of Colorado at Boulder, 2018.

Includes bibliographical references

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.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9780438045330Subjects--Topical Terms:

1069907
Applied mathematics.
Index Terms--Genre/Form:

554714
Electronic books.

Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions.
LDR:03210ntm a2200373Ki 4500 001 920504
005 20181203094030.5
006 m o u
007 cr mn||||a|a||
008 190606s2018 xx obm 000 0 eng d
020 $a 9780438045330
035 $a (MiAaPQ)AAI10809287
035 $a (MiAaPQ)colorado:15501
035 $a AAI10809287
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Sidrow, Evan. $3 1195326
245 1 0 $a Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions.
264 0 $c 2018
300 $a 1 online resource (85 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
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.
504 $a Includes bibliographical references
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.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Applied mathematics. $3 1069907
650 4 $a Statistics. $3 556824
650 4 $a Computer science. $3 573171
655 7 $a Electronic books. $2 local $3 554714
690 $a 0364
690 $a 0463
690 $a 0984
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a University of Colorado at Boulder. $b Applied Mathematics. $3 1182498
773 0 $t Masters Abstracts International $g 57-06(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10809287 $z click for full text (PQDT)