Bayesian unsupervised classification framework based on stochastic partitions of data and a parallel search strategy
2009 (English)In: Advances in Data Analysis and Classification, ISSN 1862-5347, Vol. 3, no 1, 3-24 p.Article in journal (Refereed) Published
Advantages of statistical model-based unsupervised classification over heuristic alternatives have been widely demonstrated in the scientific literature. However, the existing model-based approaches are often both conceptually and numerically instable for large and complex data sets. Here we consider a Bayesian model-based method for unsupervised classification of discrete valued vectors, that has certain advantages over standard solutions based on latent class models. Our theoretical formulation defines a posterior probability measure on the space of classification solutions corresponding to stochastic partitions of observed data. To efficiently explore the classification space we use a parallel search strategy based on non-reversible stochastic processes. A decision-theoretic approach is utilized to formalize the inferential process in the context of unsupervised classification. Both real and simulated data sets are used for the illustration of the discussed methods.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2009. Vol. 3, no 1, 3-24 p.
Bayesian classification, Markov chain Monte Carlo, Statistical learning, Stochastic optimization
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-83214DOI: 10.1007/s11634-009-0036-9ScopusID: 2-s2.0-67651049356OAI: oai:DiVA.org:kth-83214DiVA: diva2:498790
QC 201202142012-02-142012-02-122012-02-14Bibliographically approved