Going deep in clustering high-dimensional data: deep mixtures of unigrams for uncovering topics in textual data

02/18/2019
by   Laura Anderlucci, et al.
0

Mixtures of Unigrams (Nigam et al., 2000) are one of the simplest and most efficient tools for clustering textual data, as they assume that documents related to the same topic have similar distributions of terms, naturally described by Multinomials. When the classification task is particularly challenging, such as when the document-term matrix is high-dimensional and extremely sparse, a more composite representation can provide better insight on the grouping structure. In this work, we developed a deep version of mixtures of Unigrams for the unsupervised classification of very short documents with a large number of terms, by allowing for models with further deeper latent layers; the proposal is derived in a Bayesian framework. Simulation studies and real data analysis prove that going deep in clustering such data highly improves the classification accuracy with respect to more `shallow' methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/12/2019

Flexible Clustering with a Sparse Mixture of Generalized Hyperbolic Distributions

Robust clustering of high-dimensional data is an important topic because...
research
03/08/2016

A Bayesian non-parametric method for clustering high-dimensional binary data

In many real life problems, objects are described by large number of bin...
research
03/04/2023

Bayesian clustering of high-dimensional data via latent repulsive mixtures

Model-based clustering of moderate or large dimensional data is notoriou...
research
02/18/2019

Classifying textual data: shallow, deep and ensemble methods

This paper focuses on a comparative evaluation of the most common and mo...
research
11/20/2019

Bayesian sparse convex clustering via global-local shrinkage priors

Sparse convex clustering is to cluster observations and conduct variable...
research
07/01/2021

Dealing with overdispersion in multivariate count data

The problem of overdispersion in multivariate count data is a challengin...
research
03/12/2018

Poisson Kernel-Based Clustering on the Sphere: Convergence Properties, Identifiability, and a Method of Sampling

Many applications of interest involve data that can be analyzed as unit ...

Please sign up or login with your details

Forgot password? Click here to reset