A Note on the Formal Implementation of the K-means Algorithm with Hard Positive and Negative Constraints

Igor Melnykov () and Volodymyr Melnykov
Additional contact information
Igor Melnykov: University of Minnesota - Duluth
Volodymyr Melnykov: The University of Alabama

Journal of Classification, 2020, vol. 37, issue 3, No 15, 789-809

Abstract: Abstract The paper discusses a new approach for incorporating hard constraints into the K-means algorithm for semi-supervised clustering. An analytic modification of the objective function of K-means is proposed that has not been previously considered in the literature.

Keywords: K-means; Semi-supervised clustering; Hard constraints (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s00357-019-09349-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jclass:v:37:y:2020:i:3:d:10.1007_s00357-019-09349-x

Ordering information: This journal article can be ordered from
http://www.springer. ... hods/journal/357/PS2

DOI: 10.1007/s00357-019-09349-x

Access Statistics for this article

Journal of Classification is currently edited by Douglas Steinley

More articles in Journal of Classification from Springer, The Classification Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().