Advances in mixture modeling and model based clustering

Show simple item record

dc.contributor Adams, Benjamin Michael
dc.contributor Chakraborti, Subhabrata
dc.contributor Porter, Michael D.
dc.contributor Wang, Le
dc.contributor.advisor Melnykov, Volodymyr Michael, Semhar K. 2017-04-26T14:23:41Z 2017-04-26T14:23:41Z 2015
dc.identifier.other u0015_0000001_0002046
dc.identifier.other Michael_alatus_0004D_12389
dc.description Electronic Thesis or Dissertation
dc.description.abstract Cluster analysis is part of unsupervised learning that deals with finding groups of similar observations in heterogeneous data. There are several clustering approaches with the goal of minimizing the within cluster variance while maximizing the variance between clusters. K-means or hierarchical clustering with different linkages can be thought as distance-based approaches. Another approach is model-based which relies on the idea of finite mixture models. This dissertations will propose new advances in clustering area mostly related to model-based clustering and its extension to the K-means algorithm. This report has five chapters. The first chapter is a literature review on recent advances in the area of model-based clustering and finite mixture modeling. Main advances and challenges are described in the methodology section. Then some interesting and diverse applications of model-based clustering are presented in the application section. The second chapter deals with a simulation study conducted to analyze the factors that affect complexity of model-based clustering. In the third chapter we develop a methodology for model-based clustering of regression time series data and show its application to annual tree rings. In the fourth chapter, we utilize the relationship between model-based clustering and the Kmeans algorithm to develop a methodology for merging clusters formed by K-means to find meaningful grouping. The final chapter is dedicated to the problem of initialization in model-based clustering. It is well known fact that the performance of model-based clustering is highly dependent on initialization of the EM algorithm. So far there is no method that comprehensively works in all situations. In this project, we use the idea of model averaging and initialization using the emEM algorithm to solve this problem.
dc.format.extent 169 p.
dc.format.medium electronic
dc.format.mimetype application/pdf
dc.language English
dc.language.iso en_US
dc.publisher University of Alabama Libraries
dc.relation.ispartof The University of Alabama Electronic Theses and Dissertations
dc.relation.ispartof The University of Alabama Libraries Digital Collections
dc.relation.hasversion born digital
dc.rights All rights reserved by the author unless otherwise indicated.
dc.subject.other Statistics
dc.subject.other Mathematics
dc.title Advances in mixture modeling and model based clustering
dc.type thesis
dc.type text University of Alabama. Dept. of Information Systems, Statistics, and Management Science Applied Statistics The University of Alabama doctoral Ph.D.

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


My Account