國立虎尾科技大學 |

Computer-based probabilistic-network construction.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Computer-based probabilistic-network construction./
作者:	Herskovits, Edward.
面頁冊數:	1 online resource (215 pages)
附註:	Source: Dissertations Abstracts International, Volume: 53-07, Section: B.
Contained By:	Dissertations Abstracts International53-07B.
標題:	Computer science. -
電子資源:	click for full text (PQDT)
ISBN:	9798208865866

Computer-based probabilistic-network construction.
Herskovits, Edward.

Computer-based probabilistic-network construction. - 1 online resource (215 pages)

Source: Dissertations Abstracts International, Volume: 53-07, Section: B.

Thesis (Ph.D.)--Stanford University, 1991.

Includes bibliographical references

Faced with increasing amounts of data that they cannot analyze manually, biomedical researchers have turned increasingly to computational methods for exploring large databases. In particular, researchers might benefit from a nonparametric, efficient, computer-based method for determining the important associations among variables in a domain, particularly when human expertise is not readily available. In this dissertation, I demonstrate that such computer-based algorithms are conceptually feasible, robust to noise, computationally efficient, theoretically sound, and that they generate models that can classify new cases accurately. I first describe two algorithms that take as input a database of cases and optional user-supplied prior knowledge, and that generate a probabilistic network--in particular, a belief network--as output. The database may have incomplete data, and may contain noise. The resulting belief network may be used to determine important associations among variables in a poorly understood domain, or may be used as a classifier for new cases that were not used in learning. After describing the algorithms, I present simple examples of how these programs generate a belief network from a database. I then present the results of evaluating these algorithms on databases from several domains, including gynecologic pathology, lymph-node pathology, DNA-sequence analysis, and poisonous-mushroom classification. In most cases, the belief networks classify new test cases with high accuracy. In addition to discussing empirical results, I present an overview of proofs that these algorithms are based on metrics that will, as the number of cases in the database increases without limit, always prefer those networks that more closely approximate the true underlying distribution of the data in the database; that is, these algorithms are asymptotically correct. I conclude with a discussion of this work's contributions, and with a list of open research problems.

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

Mode of access: World Wide Web

ISBN: 9798208865866Subjects--Topical Terms:

573171
Computer science.
Subjects--Index Terms:

entropyIndex Terms--Genre/Form:

554714
Electronic books.

Computer-based probabilistic-network construction.
LDR:03256ntm a22003617 4500 001 1147152
005 20240909062230.5
006 m o d
007 cr bn ---uuuuu
008 250605s1991 xx obm 000 0 eng d
020 $a 9798208865866
035 $a (MiAaPQ)AAI9205646
035 $a AAI9205646
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Herskovits, Edward. $3 1472810
245 1 0 $a Computer-based probabilistic-network construction.
264 0 $c 1991
300 $a 1 online resource (215 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: Dissertations Abstracts International, Volume: 53-07, Section: B.
500 $a Publisher info.: Dissertation/Thesis.
500 $a Advisor: Cooper, Gregory.
502 $a Thesis (Ph.D.)--Stanford University, 1991.
504 $a Includes bibliographical references
520 $a Faced with increasing amounts of data that they cannot analyze manually, biomedical researchers have turned increasingly to computational methods for exploring large databases. In particular, researchers might benefit from a nonparametric, efficient, computer-based method for determining the important associations among variables in a domain, particularly when human expertise is not readily available. In this dissertation, I demonstrate that such computer-based algorithms are conceptually feasible, robust to noise, computationally efficient, theoretically sound, and that they generate models that can classify new cases accurately. I first describe two algorithms that take as input a database of cases and optional user-supplied prior knowledge, and that generate a probabilistic network--in particular, a belief network--as output. The database may have incomplete data, and may contain noise. The resulting belief network may be used to determine important associations among variables in a poorly understood domain, or may be used as a classifier for new cases that were not used in learning. After describing the algorithms, I present simple examples of how these programs generate a belief network from a database. I then present the results of evaluating these algorithms on databases from several domains, including gynecologic pathology, lymph-node pathology, DNA-sequence analysis, and poisonous-mushroom classification. In most cases, the belief networks classify new test cases with high accuracy. In addition to discussing empirical results, I present an overview of proofs that these algorithms are based on metrics that will, as the number of cases in the database increases without limit, always prefer those networks that more closely approximate the true underlying distribution of the data in the database; that is, these algorithms are asymptotically correct. I conclude with a discussion of this work's contributions, and with a list of open research problems.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Computer science. $3 573171
650 4 $a Biomedical research. $3 1472811
650 4 $a Biomedical engineering. $3 588770
653 $a entropy
653 $a machine learning
655 7 $a Electronic books. $2 local $3 554714
690 $a 0984
690 $a 0541
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Stanford University. $3 1184533
773 0 $t Dissertations Abstracts International $g 53-07B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=9205646 $z click for full text (PQDT)