Sequential minimal optimization in convex clustering repetitions

DOI10.1002/sam.10146OpenAlexW2032582793MaRDI QIDQ4969824

Rikiya Takahashi

Publication date: 14 October 2020

Published in: Statistical Analysis and Data Mining: The ASA Data Science Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/sam.10146

zbMATH Keywords

sequential minimal optimizationconvex clusteringempirical-Bayes method

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Uses Software

• apcluster
• APCluster

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clustering by Passing Messages Between Data Points
• Direct importance estimation for covariate shift adaptation
• Mixtures of Dirichlet processes with applications to Bayesian nonparametric problems
• Mixture Densities, Maximum Likelihood and the EM Algorithm
• Sampling the Dirichlet Mixture Model with Slices
• Retrospective Markov chain Monte Carlo methods for Dirichlet process hierarchical models
• Gibbs Sampling Methods for Stick-Breaking Priors
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• Information Theory and Statistics: A Tutorial
• Variational inference for Dirichlet process mixtures

This page was built for publication: Sequential minimal optimization in convex clustering repetitions