An exemplar-based clustering using efficient variational message passing

DOI10.1007/S10618-020-00720-WMaRDI QIDQ2659279zbMATH OpenOpenAlexFDO

Authors Mohamed Hamza Ibrahim, Rokia Missaoui

Publication date 26 March 2021

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

Full work available at URL https://doi.org/10.1007/s10618-020-00720-w

zbMATH Keywords

affinity propagationcluster analysisexpectation-maximizationgeneralized arc-consistencymessage-passing

Mathematics Subject Classification ID

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

Recommendations

• Exemplar-based clustering via simulated annealing
• Efficient, certifiably optimal clustering with applications to latent variable graphical models
• A variational approach to the consistency of spectral clustering
• A variational expectation-maximization algorithm for temporal data clustering
• Variational Bayes approximations for clustering via mixtures of normal inverse Gaussian distributions
• Clustering hidden Markov models with variational HEM
• Variational algorithms for biclustering models

Cites work

• A Binary Variable Model for Affinity Propagation
• Affinity propagation clustering using path based similarity
• Anytime parallel density-based clustering
• Clustering by passing messages between data points
• Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
• Convergence Analysis of Reweighted Sum-Product Algorithms
• Efficient algorithms for agglomerative hierarchical clustering methods
• Exploiting symmetries for scaling loopy belief propagation and relational training
• Handbook of constraint programming.
• How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis
• scientific article; zbMATH DE number 6381735 (Why is no real title available?)
• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• scientific article; zbMATH DE number 3567782 (Why is no real title available?)
• scientific article; zbMATH DE number 1222290 (Why is no real title available?)
• scientific article; zbMATH DE number 1086058 (Why is no real title available?)
• scientific article; zbMATH DE number 1149880 (Why is no real title available?)
• scientific article; zbMATH DE number 845707 (Why is no real title available?)
• Improving probabilistic inference in graphical models with determinism and cycles
• On clustering validation techniques
• On the convergence properties of the EM algorithm
• On the Slow Convergence of EM and VBEM in Low-Noise Linear Models
• On the Uniqueness of Loopy Belief Propagation Fixed Points
• Probabilistic graphical models.
• Scikit-learn: machine learning in Python
• The EM Algorithm and Extensions, 2E
• Variational message passing

Cited in

(1)

• Clustering by passing messages between data points

Describes a project that uses

Uses Software

• UCI
• Scikit
• apcluster
• APCluster
• k-means++
• AutoClass

This page was built for publication: An exemplar-based clustering using efficient variational message passing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2659279)