A note on the formal implementation of the \(K\)-means algorithm with hard positive and negative constraints

DOI10.1007/s00357-019-09349-xOpenAlexW2999996073MaRDI QIDQ2220707

Volodymyr Melnykov, Igor Melnykov

Publication date: 25 January 2021

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00357-019-09349-x

zbMATH Keywords

\(K\)-meanshard constraintssemi-supervised clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Uses Software

• MixSim

Cites Work

• Unnamed Item
• Constrained classification: The use of a priori information in cluster analysis
• Semi-supervised model-based clustering with positive and negative constraints
• Constrained clustering with a complex cluster structure
• A minisum location problem with regional demand considering farthest Euclidean distances
• Constrained Clustering
• Finite mixture models

This page was built for publication: A note on the formal implementation of the \(K\)-means algorithm with hard positive and negative constraints