Efficient mixture model for clustering of sparse high dimensional binary data

DOI10.1007/S10618-019-00635-1zbMath1464.62328arXiv1707.03157OpenAlexW2963096346WikidataQ127757941 ScholiaQ127757941MaRDI QIDQ2218380

Krzysztof Hajto, Marek Śmieja, Jacek Tabor

Publication date: 15 January 2021

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.03157

zbMATH Keywords

data compressionBernoulli mixture modelentropy clusteringhigh-dimensional binary data

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Statistical aspects of big data and data science (62R07)

Related Items (1)

A robust high dimensional estimation of a finite mixture of the generalized linear model

Uses Software

• UCI-ml
• CLUTO
• RCV1
• mixtools
• AS 136
• PaDEL-Descriptor
• COOLCAT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cross-entropy clustering
• Algorithm AS 136: A K-Means Clustering Algorithm
• Clustering and variable selection for categorical multivariate data
• Semi-supervised cross-entropy clustering with information bottleneck constraint
• Multi-sample cluster analysis using Akaike's information criterion
• Mixture of latent trait analyzers for model-based clustering of categorical data
• Discrete data clustering using finite mixture models
• Clustering criteria for discrete data and latent class models
• Estimating the dimension of a model
• Model based clustering of high-dimensional binary data
• Clustering of multivariate binary data with dimension reduction via \(L_{1}\)-regularized likelihood maximization
• On the posterior distribution of the number of components in a finite mixture
• On the use of Bernoulli mixture models for text classification
• An optimization algorithm for clustering using weighted dissimilarity measures
• Lossy compression approach to subspace clustering
• Latent classification models for binary data
• A novel attribute weighting algorithm for clustering high-dimensional categorical data
• On multivariate binary data clustering and feature weighting
• Estimating Component Cumulative Distribution Functions in Finite Mixture Models
• Clustering and its validation in a symbolic framework
• Classification of binary vectors by using ΔSC distance to minimize stochastic complexity
• Unsupervised learning of parsimonious mixtures on large spaces with integrated feature and component selection
• Structured Sparse Subspace Clustering: A Joint Affinity Learning and Subspace Clustering Framework
• Innovation Pursuit: A New Approach to Subspace Clustering
• A factor mixture analysis model for multivariate binary data
• Entropy of the Mixture of Sources and Entropy Dimension
• The Deterministic Information Bottleneck

This page was built for publication: Efficient mixture model for clustering of sparse high dimensional binary data