Sequential minimal optimization in convex clustering repetitions

DOI10.1002/SAM.10146OpenAlexW2032582793MaRDI QIDQ4969824FDOQ4969824

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 clusteringsequential minimal optimizationempirical-Bayes method

Mathematics Subject Classification ID

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

Cites Work

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

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)