{"url":"/method/cop-kmeans-1","slug":"cop-kmeans-1","name":"COP-KMeans","full_name":"Constrained Pairwise k-Means","full_name_withheld":false,"description_markdown":"COP-KMeans is a modified version the popular k-means algorithm that supports pairwise constraints. \r\n\r\nOriginal paper : Constrained K-means Clustering with Background Knowledge, Wagstaff et al. 2001","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":null,"title":null,"url_on_a_paper_host":false},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Clustering","url":"/methods/category/clustering","pwc_aliases":[]}],"n_papers_tagged":1,"archive_num_papers":1,"papers_newest_first":[{"paper":"/paper/incremental-constrained-clustering-by-minimal","title":"Incremental Constrained Clustering by Minimal Weighted Modification","date":"2023-09-22","arxiv_id":null,"n_code_links":1,"syntology":null}],"papers_shown":1,"tasks":[{"task":"/task/clustering","name":"Clustering","papers":1},{"task":"/task/constrained-clustering","name":"Constrained Clustering","papers":1},{"task":"/task/incremental-constrained-clustering","name":"Incremental Constrained Clustering","papers":1},{"task":"/task/time-series-1","name":"Time Series","papers":1}],"tasks_shown":4,"n_tasks":4,"usage_by_year":[{"year":"2023","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/cop-kmeans-1"},"syntology_read_at":"2026-09-24T18:15:14+00:00"}