Semi-supervised k-means++

DOI10.1080/00949655.2017.1327588OpenAlexW2963481827MaRDI QIDQ5106957

Jordan Yoder, Carey E. Priebe

Publication date: 22 April 2020

Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.00360

zbMATH Keywords

clusteringapproximation algorithmk-meanssemi-supervisedpartially labelled

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (3)

Improving K-means method via shrinkage estimation and LVQ algorithm ⋮ Vertex nomination: the canonical sampling and the extended spectral nomination schemes ⋮ Discriminative clustering with representation learning with any ratio of labeled to unlabeled data

Cites Work

• The planar \(k\)-means problem is NP-hard
• Adaptive Sampling for k-Means Clustering
• Least squares quantization in PCM
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Semi-supervised k-means++