An exemplar-based clustering using efficient variational message passing
From MaRDI portal
Publication:2659279
DOI10.1007/s10618-020-00720-wzbMath1476.62137OpenAlexW3097249106MaRDI QIDQ2659279
Rokia Missaoui, Mohamed Hamza Ibrahim
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
cluster analysisexpectation-maximizationaffinity propagationmessage-passinggeneralized arc-consistency
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Statistical aspects of big data and data science (62R07)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clustering by Passing Messages Between Data Points
- Exploiting symmetries for scaling loopy belief propagation and relational training
- On the convergence properties of the EM algorithm
- Efficient algorithms for agglomerative hierarchical clustering methods
- Affinity propagation clustering using path based similarity
- Anytime parallel density-based clustering
- Improving probabilistic inference in graphical models with determinism and cycles
- The EM Algorithm and Extensions, 2E
- Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
- How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis
- Convergence Analysis of Reweighted Sum-Product Algorithms
- On the Uniqueness of Loopy Belief Propagation Fixed Points
- A Binary Variable Model for Affinity Propagation
- On the Slow Convergence of EM and VBEM in Low-Noise Linear Models
- On clustering validation techniques