東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Finite mixture models for clustering...

Lin, Xiaodong.

Linked to FindBook

Google Book

Amazon

博客來

Finite mixture models for clustering, dimension reduction and privacy preserving data mining.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Finite mixture models for clustering, dimension reduction and privacy preserving data mining./
Author:	Lin, Xiaodong.
Description:	111 p.
Notes:	Source: Dissertation Abstracts International, Volume: 64-11, Section: B, page: 5591.
Contained By:	Dissertation Abstracts International64-11B.
Subject:	Statistics. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3113835

Finite mixture models for clustering, dimension reduction and privacy preserving data mining.
Lin, Xiaodong.

Finite mixture models for clustering, dimension reduction and privacy preserving data mining. - 111 p.

Source: Dissertation Abstracts International, Volume: 64-11, Section: B, page: 5591.

Thesis (Ph.D.)--Purdue University, 2003.

Gaussian mixture models have been used extensively in model-based clustering. It is well known that the likelihood function for this model is unbounded and the global MLE does not exist. Existing methods confine the parameter estimates in the interior of the parameter space and the MLE is shown to be consistent. We proposed the artificially contaminated Gaussian mixture model (ACM), which achieves the MLE consistency globally. Furthermore, the usual assumption that the true parameter is in the interior of the parameter space can be dropped. The variance of the artificial contamination is allowed to decrease to zero in a polynomial rate while the MLE maintains its consistency. Empirical studies demonstrate that ACM out-performs the competing methods such as the constrained Gaussian mixture model and the penalized Gaussian mixture model.Subjects--Topical Terms:

517247
Statistics.

Finite mixture models for clustering, dimension reduction and privacy preserving data mining.
LDR:03338nmm 2200301 4500 001 1861417
005 20041111121757.5
008 130614s2003 eng d
035 $a (UnM)AAI3113835
035 $a AAI3113835
040 $a UnM $c UnM
100 1 $a Lin, Xiaodong. $3 1949018
245 1 0 $a Finite mixture models for clustering, dimension reduction and privacy preserving data mining.
300 $a 111 p.
500 $a Source: Dissertation Abstracts International, Volume: 64-11, Section: B, page: 5591.
500 $a Major Professor: Yu Michael Zhu.
502 $a Thesis (Ph.D.)--Purdue University, 2003.
520 $a Gaussian mixture models have been used extensively in model-based clustering. It is well known that the likelihood function for this model is unbounded and the global MLE does not exist. Existing methods confine the parameter estimates in the interior of the parameter space and the MLE is shown to be consistent. We proposed the artificially contaminated Gaussian mixture model (ACM), which achieves the MLE consistency globally. Furthermore, the usual assumption that the true parameter is in the interior of the parameter space can be dropped. The variance of the artificial contamination is allowed to decrease to zero in a polynomial rate while the MLE maintains its consistency. Empirical studies demonstrate that ACM out-performs the competing methods such as the constrained Gaussian mixture model and the penalized Gaussian mixture model.
520 $a A degenerate EM (DEM) algorithm is proposed to handle the degenerations for the multivariate Gaussian mixture models. By adaptively changing the singular covariance matrices, the DEM algorithm is able to identify the genuine degenerate components while discarding the spurious ones. At the same time, the DEM algorithm solves the EM break-down problems.
520 $a Traditionally, clustering and dimension reduction are performed separately. The mixture of factor analyzers (MFA) model has been developed for simultaneous dimension reduction and clustering. We show that a constraint based on the total variation can drastically improve the performance of the MFA model. An EM algorithm is developed to solve the optimization problem involving a quadratic constraint. A two-step model selection procedure is proposed to speed up the model selection process. Comparative evaluations show that the constrained MFA (CMFA) model performs demonstrably better than methods including the MFA and the LPCA model in a number of problems. There seems to be a real potential for the CMFA model in high dimensional data analysis.
520 $a Privacy preserving data mining has received tremendous attention recently. With the imminent growth of distributed database and data mining technology, individual privacy has become a very important issue. We proposed a privacy preserving clustering algorithm based on the finite mixture models which preserves the privacy of the individual data items and the local summary results. Problems regarding privacy preserving statistical analysis will be discussed.
590 $a School code: 0183.
650 4 $a Statistics. $3 517247
650 4 $a Computer Science. $3 626642
690 $a 0463
690 $a 0984
710 2 0 $a Purdue University. $3 1017663
773 0 $t Dissertation Abstracts International $g 64-11B.
790 1 0 $a Zhu, Yu Michael, $e advisor
790 $a 0183
791 $a Ph.D.
792 $a 2003
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3113835