東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Computer-based probabilistic-network...

Herskovits, Edward.

Linked to FindBook

Google Book

Amazon

博客來

Computer-based probabilistic-network construction.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Computer-based probabilistic-network construction./
Author:	Herskovits, Edward.
Published:	Ann Arbor : ProQuest Dissertations & Theses, : 1991,
Description:	215 p.
Notes:	Source: Dissertations Abstracts International, Volume: 53-07, Section: B.
Contained By:	Dissertations Abstracts International53-07B.
Subject:	Computer science. -
Online resource:	https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=9205646
ISBN:	9798208865866

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

Computer-based probabilistic-network construction. - Ann Arbor : ProQuest Dissertations & Theses, 1991 - 215 p.

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

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

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.

ISBN: 9798208865866Subjects--Topical Terms:

523869
Computer science.
Subjects--Index Terms:

entropy

Computer-based probabilistic-network construction.
LDR:03044nmm a2200349 4500 001 2399056
005 20240909062230.5
006 m o d
007 cr#unu||||||||
008 251215s1991 ||||||||||||||||| ||eng d
020 $a 9798208865866
035 $a (MiAaPQ)AAI9205646
035 $a AAI9205646
040 $a MiAaPQ $c MiAaPQ
100 1 $a Herskovits, Edward. $3 3769023
245 1 0 $a Computer-based probabilistic-network construction.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 1991
300 $a 215 p.
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.
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.
590 $a School code: 0212.
650 4 $a Computer science. $3 523869
650 4 $a Biomedical research. $3 3433833
650 4 $a Biomedical engineering. $3 535387
653 $a entropy
653 $a machine learning
690 $a 0984
690 $a 0541
710 2 $a Stanford University. $3 754827
773 0 $t Dissertations Abstracts International $g 53-07B.
790 $a 0212
791 $a Ph.D.
792 $a 1991
793 $a English
856 4 0 $u https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=9205646