Sequential minimal optimization in convex clustering repetitions

DOI10.1002/SAM.10146MaRDI QIDQ4969824zbMATH OpenOpenAlexFDO

Authors 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

convex clusteringempirical-Bayes methodsequential minimal optimization

Mathematics Subject Classification ID

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

Cites work

• Clustering by passing messages between data points
• Direct importance estimation for covariate shift adaptation
• Gibbs Sampling Methods for Stick-Breaking Priors
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• scientific article; zbMATH DE number 3888710 (Why is no real title available?)
• scientific article; zbMATH DE number 3469876 (Why is no real title available?)
• scientific article; zbMATH DE number 3567782 (Why is no real title available?)
• scientific article; zbMATH DE number 823069 (Why is no real title available?)
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• Information Theory and Statistics: A Tutorial
• Mixture Densities, Maximum Likelihood and the EM Algorithm
• Mixtures of Dirichlet processes with applications to Bayesian nonparametric problems
• Retrospective Markov chain Monte Carlo methods for Dirichlet process hierarchical models
• Sampling the Dirichlet Mixture Model with Slices
• Variational inference for Dirichlet process mixtures

Describes a project that uses

Uses Software

• apcluster
• APCluster

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

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