{"url":"/task/constrained-clustering","name":"Constrained Clustering","slug":"constrained-clustering","description_markdown":"Split data into groups, taking into account knowledge in the form of constraints on points, groups of points, or clusters.","categories":[{"name":"Methodology","url":"/area/methodology"},{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":72,"papers_with_code":29,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":2,"parent_tasks":1},"benchmarks":[],"datasets":[],"subtasks":[{"url":"/task/incremental-constrained-clustering","name":"Incremental Constrained Clustering"},{"url":"/task/task-1-grouping","name":"Only Connect Walls Dataset Task 1 (Grouping)"}],"parent_tasks":[{"url":"/task/clustering","name":"Clustering"}],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":29,"of":29,"tagged_in_all":72,"items":[{"url":"/paper/learning-discrete-representations-via-1","title":"Learning Discrete Representations via Constrained Clustering for Effective and Efficient Dense Retrieval","date":"2021-10-12","arxiv_id":"2110.05789","repositories_listed":4,"syntology":{"n":22,"n_ran":5,"n_unverified":17,"n_pointer_only":0}},{"url":"/paper/fp-age-leveraging-face-parsing-attention-for","title":"FP-Age: Leveraging Face Parsing Attention for Facial Age Estimation in the Wild","date":"2021-06-21","arxiv_id":"2106.11145","repositories_listed":2,"syntology":null},{"url":"/paper/towards-uncovering-the-intrinsic-data","title":"Towards Uncovering the Intrinsic Data Structures for Unsupervised Domain Adaptation using Structurally Regularized Deep Clustering","date":"2020-12-08","arxiv_id":"2012.04280","repositories_listed":2,"syntology":null},{"url":"/paper/fast-computation-of-wasserstein-barycenters","title":"Fast Computation of Wasserstein Barycenters","date":"2013-10-16","arxiv_id":"1310.4375","repositories_listed":2,"syntology":null},{"url":"/paper/partial-label-clustering","title":"Partial Label Clustering","date":"2025-05-06","arxiv_id":"2505.03207","repositories_listed":1,"syntology":null},{"url":"/paper/cycleguardian-a-framework-for-automatic","title":"CycleGuardian: A Framework for Automatic RespiratorySound classification Based on Improved Deep clustering and Contrastive Learning","date":"2025-02-02","arxiv_id":"2502.00734","repositories_listed":1,"syntology":null},{"url":"/paper/mc-gta-metric-constrained-model-based","title":"MC-GTA: Metric-Constrained Model-Based Clustering using Goodness-of-fit Tests with Autocorrelations","date":"2024-05-28","arxiv_id":"2405.18395","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/fastlloyd-federated-accurate-secure-and","title":"FastLloyd: Federated, Accurate, Secure, and Tunable $k$-Means Clustering with Differential Privacy","date":"2024-05-03","arxiv_id":"2405.02437","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_unverified":1,"n_pointer_only":3}},{"url":"/paper/a-consensus-constrained-parsimonious-gaussian","title":"A consensus-constrained parsimonious Gaussian mixture model for clustering hyperspectral images","date":"2024-03-05","arxiv_id":"2403.03349","repositories_listed":1,"syntology":null},{"url":"/paper/constraintmatch-for-semi-constrained","title":"ConstraintMatch for Semi-constrained Clustering","date":"2023-11-26","arxiv_id":"2311.15395","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/multi-camera-trajectory-matching-based-on","title":"Multi‑camera trajectory matching based on hierarchical clustering and constraints","date":"2023-10-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/incremental-constrained-clustering-by-minimal","title":"Incremental Constrained Clustering by Minimal Weighted Modification","date":"2023-09-22","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/deep-clustering-with-incomplete-noisy","title":"Deep Clustering with Incomplete Noisy Pairwise Annotations: A Geometric Regularization Approach","date":"2023-05-30","arxiv_id":"2305.19391","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_unverified":1,"n_pointer_only":3}},{"url":"/paper/neural-capacitated-clustering","title":"Neural Capacitated Clustering","date":"2023-02-10","arxiv_id":"2302.05134","repositories_listed":1,"syntology":null},{"url":"/paper/a-bibliographic-view-on-constrained","title":"A Bibliographic View on Constrained Clustering","date":"2022-09-22","arxiv_id":"2209.11125","repositories_listed":1,"syntology":null},{"url":"/paper/constrained-clustering-and-multiple-kernel","title":"Constrained Clustering and Multiple Kernel Learning without Pairwise Constraint Relaxation","date":"2022-03-23","arxiv_id":"2203.12546","repositories_listed":1,"syntology":{"n":10,"n_ran":0,"n_unverified":10,"n_pointer_only":0}},{"url":"/paper/an-exact-algorithm-for-semi-supervised","title":"An Exact Algorithm for Semi-supervised Minimum Sum-of-Squares Clustering","date":"2021-11-30","arxiv_id":"2111.15571","repositories_listed":1,"syntology":null},{"url":"/paper/deep-conditional-gaussian-mixture-model-for","title":"Deep Conditional Gaussian Mixture Model for Constrained Clustering","date":"2021-06-11","arxiv_id":"2106.06385","repositories_listed":1,"syntology":null},{"url":"/paper/weighted-sparse-subspace-representation-a","title":"Weighted Sparse Subspace Representation: A Unified Framework for Subspace Clustering, Constrained Clustering, and Active Learning","date":"2021-06-08","arxiv_id":"2106.04330","repositories_listed":1,"syntology":null},{"url":"/paper/spatially-relaxed-inference-on-high","title":"Spatially relaxed inference on high-dimensional linear models","date":"2021-06-04","arxiv_id":"2106.02590","repositories_listed":1,"syntology":null},{"url":"/paper/advances-in-integration-of-end-to-end-neural","title":"Advances in integration of end-to-end neural and clustering-based diarization for real conversational speech","date":"2021-05-19","arxiv_id":"2105.09040","repositories_listed":1,"syntology":null},{"url":"/paper/a-framework-for-deep-constrained-clustering","title":"A Framework for Deep Constrained Clustering","date":"2021-01-07","arxiv_id":"2101.02792","repositories_listed":1,"syntology":null},{"url":"/paper/statistical-control-for-spatio-temporal-meg","title":"Statistical control for spatio-temporal MEG/EEG source imaging with desparsified multi-task Lasso","date":"2020-09-29","arxiv_id":"2009.14310","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/constrained-k-means-with-general-pairwise-and","title":"Constrained Clustering: General Pairwise and Cardinality Constraints","date":"2019-07-24","arxiv_id":"1907.10410","repositories_listed":1,"syntology":null},{"url":"/paper/deep-constrained-dominant-sets-for-person-re","title":"Deep Constrained Dominant Sets for Person Re-identification","date":"2019-04-25","arxiv_id":"1904.11397","repositories_listed":1,"syntology":{"n":6,"n_ran":0,"n_unverified":6,"n_pointer_only":0}},{"url":"/paper/sponge-a-generalized-eigenproblem-for","title":"SPONGE: A generalized eigenproblem for clustering signed networks","date":"2019-04-18","arxiv_id":"1904.08575","repositories_listed":1,"syntology":null},{"url":"/paper/deep-constrained-clustering-algorithms-and","title":"A Framework for Deep Constrained Clustering -- Algorithms and Advances","date":"2019-01-29","arxiv_id":"1901.10061","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-cluster-in-order-to-transfer","title":"Learning to cluster in order to transfer across domains and tasks","date":"2017-11-28","arxiv_id":"1711.10125","repositories_listed":1,"syntology":null},{"url":"/paper/on-constrained-spectral-clustering-and-its","title":"On Constrained Spectral Clustering and Its Applications","date":"2012-01-25","arxiv_id":"1201.5338","repositories_listed":1,"syntology":null}],"syntology_records":8,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}