東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Collective approach for Bayesian net...

Chen, Rong.

Linked to FindBook

Google Book

Amazon

博客來

Collective approach for Bayesian network learning from distributed heterogeneous database.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Collective approach for Bayesian network learning from distributed heterogeneous database./
Author:	Chen, Rong.
Description:	153 p.
Notes:	Source: Dissertation Abstracts International, Volume: 65-03, Section: B, page: 1460.
Contained By:	Dissertation Abstracts International65-03B.
Subject:	Engineering, Electronics and Electrical. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3125501
ISBN:	0496727907

Collective approach for Bayesian network learning from distributed heterogeneous database.
Chen, Rong.

Collective approach for Bayesian network learning from distributed heterogeneous database. - 153 p.

Source: Dissertation Abstracts International, Volume: 65-03, Section: B, page: 1460.

Thesis (Ph.D.)--Washington State University, 2003.

In this dissertation we concentrate on learning Bayesian Networks (BN) from distributed heterogeneous databases. We need to develop distributed techniques that save communication overhead, offer better scalability, and require minimal communication of possibly secure data. The objective of this work is to learn a collective BN from data that is distributed among geographically diverse sites. The data distribution is heterogeneous. The collective BN must be close to a BN learned by a centralized method and must require only a small amount of data transmission among different sites. In general, the collective learning algorithms have four steps: local learning, sample selection, cross learning, and combination. The key points in the proposed methods are: (1) use the BN decomposability property; (2) identify the samples that are most likely to be evidence of cross terms. We show that low-likelihood samples in each site are most likely to be the evidence of cross terms.

ISBN: 0496727907Subjects--Topical Terms:

626636
Engineering, Electronics and Electrical.

Collective approach for Bayesian network learning from distributed heterogeneous database.
LDR:03239nmm 2200289 4500 001 1846162
005 20051117110057.5
008 130614s2003 eng d
020 $a 0496727907
035 $a (UnM)AAI3125501
035 $a AAI3125501
040 $a UnM $c UnM
100 1 $a Chen, Rong. $3 1917541
245 1 0 $a Collective approach for Bayesian network learning from distributed heterogeneous database.
300 $a 153 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-03, Section: B, page: 1460.
500 $a Chair: Krishnamoorthy Sivakumar.
502 $a Thesis (Ph.D.)--Washington State University, 2003.
520 $a In this dissertation we concentrate on learning Bayesian Networks (BN) from distributed heterogeneous databases. We need to develop distributed techniques that save communication overhead, offer better scalability, and require minimal communication of possibly secure data. The objective of this work is to learn a collective BN from data that is distributed among geographically diverse sites. The data distribution is heterogeneous. The collective BN must be close to a BN learned by a centralized method and must require only a small amount of data transmission among different sites. In general, the collective learning algorithms have four steps: local learning, sample selection, cross learning, and combination. The key points in the proposed methods are: (1) use the BN decomposability property; (2) identify the samples that are most likely to be evidence of cross terms. We show that low-likelihood samples in each site are most likely to be the evidence of cross terms.
520 $a One collective structure learning and two collective parameter learning methods are proposed. For structure learning, the collective method can find the correct structure of local variables by choosing a base structure learning algorithm with the decomposability property. Some extra links may be introduced due to the hidden variable problem. Sample selection chooses low-likelihood samples in local sites and transmits them to a central site. In cross learning, the structure of cross variables and cross set are identified. In combination, we add all cross links and remove extra local links. For parameter learning, Collective Method 1 (CM1) and Collective Method 2 (CM2) can learn a BN which is close to Bcntr using a small portion of samples. Local learning learns parameters for local variables. Cross learning learns the parameters of cross variables. The combination step aggregates the parameters of local variables and cross variables. In order to handle applications with real-time constraints, we have developed CM2. Using a notion of cross set, CM2 chooses a subset of features in a local site to do the likelihood computation and data selection. This can greatly reduce the local computation and the data transmission overhead. Experimental results demonstrate the efficiency and accuracy of these methods.
590 $a School code: 0251.
650 4 $a Engineering, Electronics and Electrical. $3 626636
650 4 $a Computer Science. $3 626642
690 $a 0544
690 $a 0984
710 2 0 $a Washington State University. $3 678588
773 0 $t Dissertation Abstracts International $g 65-03B.
790 1 0 $a Sivakumar, Krishnamoorthy, $e advisor
790 $a 0251
791 $a Ph.D.
792 $a 2003
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3125501