Methods › General › Clustering › COP-KMeans
Constrained Pairwise k-Means
COP-KMeans
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
COP-KMeans is a modified version the popular k-means algorithm that supports pairwise constraints.
Original paper : Constrained K-means Clustering with Background Knowledge, Wagstaff et al. 2001
Papers archive 2025-07-28
1 shown of 1, newest first. Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code; it is per sample and not a correctness claim.
-
Incremental Constrained Clustering by Minimal Weighted Modification 22 Sep 2023 · 1 repository
Tasks archive 2025-07-28
4 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections