Research map / Learning theory and algorithms / Clustering
Bayesian Nonparametric Clustering for Positive Definite Matrices
Anoop Cherian, Vassilios Morellas, Nikolaos P. Papanikolopoulos
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Learning Log-Determinant Divergences for Positive Definite Matrices (TPAMI 2021 · similarity 0.87)
- Dynamic Clustering Algorithms via Small-Variance Analysis of Markov Chain Mixture Models (TPAMI 2018 · similarity 0.87)
- Maximum Margin Dirichlet Process Mixtures for Clustering (AAAI 2016 · similarity 0.86)
- Achieving Optimal Clustering in Gaussian Mixture Models with Anisotropic Covariance Structures (NeurIPS 2024 · similarity 0.86)
- SPD-DDPM: Denoising Diffusion Probabilistic Models in the Symmetric Positive Definite Space (AAAI 2024 · similarity 0.84)
- Gaussian Mixture Models in Hilbert Spaces via Kernel Methods (NeurIPS 2026 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
