High dimensional clustering for mixture models
Clustering is an essential subject in unsupervised learning. It is a common technique used in many fields, including machine learning, statistics, bioinformatics, and computer graphics. Classifying samples into homogeneous groups is based on different criterions. In this thesis, we focus on the clu...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis-Doctor of Philosophy |
| Language: | English |
| Published: |
Nanyang Technological University
2020
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/142941 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | Clustering is an essential subject in unsupervised learning. It is a common technique used in many fields, including machine learning, statistics, bioinformatics, and computer graphics. Classifying samples into homogeneous groups is based on different criterions. In this thesis, we focus on the clusters that are characterized by the different parameters (i.e., means and covariances), and we study the clustering method for the high dimensional mixture data. According to this setting, we propose two new methods, Covariance clustering method and {\it Two-step} method. Also, we investigate and develop the Mean clustering method from both theoretical and practical aspects by random matrix theory.
Specifically, the first part focuses on the clustering when the data are collected from a mixture distribution with distinct covariance matrices. We provide a new algorithm to address this issue and find the misclustering rate theoretically.
In the second part, for the data with different means, we provide a noncentered and centered version of Mean clustering method. Moreover, to give a theoretical justification of these two methods, we prove that the results of no eigenvalue outside the support of the limiting spectral distribution and exact separation of eigenvalues of large-dimensional sample covariance matrices can be extended to low rank information plus general noise models.
In the third part, when either means or covariances are distinct, we propose a Two-step method to do clustering. Both theoretical and numerical properties of the Two-step method are discussed. Simulation studies and real data analysis also demonstrate that the Two-step method outperforms the other methods under a variety of settings. |
|---|