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

DOI10.1007/S00357-019-09349-XMaRDI QIDQ2220707zbMATH OpenOpenAlexFDO

Authors Igor Melnykov, Volodymyr 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)

Cites work

• A minisum location problem with regional demand considering farthest Euclidean distances
• Constrained classification: The use of a priori information in cluster analysis
• Constrained Clustering
• Constrained clustering with a complex cluster structure
• Finite mixture models
• scientific article; zbMATH DE number 3567782 (Why is no real title available?)
• Semi-supervised model-based clustering with positive and negative constraints

Cited in

(2)

• Semi-supervised clustering of time-dependent categorical sequences with application to discovering education-based life patterns
• Combining semi-supervised clustering and classification under a generalized framework

Describes a project that uses

Uses Software

• MixSim

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

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