{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"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 (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":72,"of":72,"of_with_code":29,"tagged_in_all":72,"counts":{"archive_papers_tagged":72,"with_a_code_link":29,"where_syntology_ran_a_sample":7,"not_listed_spam_title":0,"listed":72,"listed_where_code_ran":7,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":6,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":6,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/learning-discrete-representations-via-1","slug":"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":16,"n_constructed":0,"n_ran_checked":14,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":2,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/learning-discrete-representations-via-1#ran","syntology_url":"https://syntology.ai/paper/2110.05789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.05789"}},"official":{"repos":["jingtaozhan/repconc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/fp-age-leveraging-face-parsing-attention-for","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mc-gta-metric-constrained-model-based#ran","syntology_url":"https://syntology.ai/paper/2405.18395","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.18395"}},"official":{"repos":["Octopolugal/MC-GTA"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fastlloyd-federated-accurate-secure-and","slug":"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_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fastlloyd-federated-accurate-secure-and#ran","syntology_url":"https://syntology.ai/paper/2405.02437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.02437"}},"official":{"repos":["d-diaa/fastlloyd"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-consensus-constrained-parsimonious-gaussian","slug":"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","slug":"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_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/constraintmatch-for-semi-constrained#ran","syntology_url":"https://syntology.ai/paper/2311.15395","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.15395"}},"official":{"repos":["slds-lmu/constraintmatch"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-camera-trajectory-matching-based-on","slug":"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","slug":"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","slug":"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_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-clustering-with-incomplete-noisy#ran","syntology_url":"https://syntology.ai/paper/2305.19391","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19391"}},"official":{"repos":["ductri/volmaxdcc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-capacitated-clustering","slug":"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","slug":"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","slug":"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":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/constrained-clustering-and-multiple-kernel#ran","syntology_url":"https://syntology.ai/paper/2203.12546","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.12546"}},"official":{"repos":["autonlab/constrained-clustering"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/an-exact-algorithm-for-semi-supervised","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/statistical-control-for-spatio-temporal-meg#ran","syntology_url":"https://syntology.ai/paper/2009.14310","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.14310"}},"official":{"repos":["ja-che/hidimstat"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/constrained-k-means-with-general-pairwise-and","slug":"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","slug":"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":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/deep-constrained-dominant-sets-for-person-re#ran","syntology_url":"https://syntology.ai/paper/1904.11397","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.11397"}},"official":null}},{"url":"/paper/sponge-a-generalized-eigenproblem-for","slug":"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","slug":"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","slug":"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","slug":"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},{"url":null,"slug":"enhancing-martian-terrain-recognition-with","title":"Enhancing Martian Terrain Recognition with Deep Constrained Clustering","date":"2025-03-22","arxiv_id":"2503.17633","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-based-validation-splits-for-domain","title":"Clustering-Based Validation Splits for Model Selection under Domain Shift","date":"2024-05-29","arxiv_id":"2405.19461","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-explainable-clustering-a-constrained","title":"Towards Explainable Clustering: A Constrained Declarative based Approach","date":"2024-03-26","arxiv_id":"2403.18101","repositories_listed":0,"syntology":null},{"url":null,"slug":"extreme-point-pursuit-part-ii-further-error","title":"Extreme Point Pursuit -- Part II: Further Error Bound Analysis and Applications","date":"2024-03-11","arxiv_id":"2403.06513","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-scale-constrained-clustering-with","title":"Large Scale Constrained Clustering With Reinforcement Learning","date":"2024-02-15","arxiv_id":"2402.10177","repositories_listed":0,"syntology":null},{"url":null,"slug":"advanced-image-segmentation-techniques-for","title":"Advanced Image Segmentation Techniques for Neural Activity Detection via C-fos Immediate Early Gene Expression","date":"2023-12-13","arxiv_id":"2312.08177","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-weak-coreset","title":"Universal Weak Coreset","date":"2023-05-26","arxiv_id":"2305.16890","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-constrained-clustering-an-in","title":"Semi-Supervised Constrained Clustering: An In-Depth Overview, Ranked Taxonomy and Future Research Directions","date":"2023-02-28","arxiv_id":"2303.00522","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-decision-trees-for-interpretable","title":"Optimal Decision Trees For Interpretable Clustering with Constraints (Extended Version)","date":"2023-01-30","arxiv_id":"2301.12671","repositories_listed":0,"syntology":null},{"url":null,"slug":"spatiotemporal-classification-with-limited","title":"Spatiotemporal Classification with limited labels using Constrained Clustering for large datasets","date":"2022-10-14","arxiv_id":"2210.07522","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-federated-anomaly-detection-for","title":"Deep Federated Anomaly Detection for Multivariate Time Series Data","date":"2022-05-09","arxiv_id":"2205.04041","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-fewer-labels-support-pair-active","title":"Towards Fewer Labels: Support Pair Active Learning for Person Re-identification","date":"2022-04-21","arxiv_id":"2204.10008","repositories_listed":0,"syntology":null},{"url":null,"slug":"tight-fpt-approximation-for-constrained-k","title":"Tight FPT Approximation for Constrained k-Center and k-Supplier","date":"2021-10-27","arxiv_id":"2110.14242","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-quadratic-optimisation-over-the","title":"Sparse Quadratic Optimisation over the Stiefel Manifold with Application to Permutation Synchronisation","date":"2021-09-30","arxiv_id":"2110.00053","repositories_listed":0,"syntology":null},{"url":null,"slug":"cdps-constrained-dtw-preserving-shapelets","title":"CDPS: Constrained DTW-Preserving Shapelets","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"interpretable-methods-for-identifying-product","title":"Interpretable Methods for Identifying Product Variants","date":"2021-04-12","arxiv_id":"2104.05504","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-probabilistic-approach-to-constrained-deep","title":"A Probabilistic Approach to Constrained Deep Clustering","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-control-for-spatio-temporal-meg-1","title":"Statistical control for spatio-temporal MEG/EEG source imaging with desparsified mutli-task Lasso","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"nn-evclus-neural-network-based-evidential","title":"NN-EVCLUS: Neural Network-based Evidential Clustering","date":"2020-09-27","arxiv_id":"2009.12795","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-coresets-for-fair-clustering-in-metric-and","title":"On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications","date":"2020-07-20","arxiv_id":"2007.10137","repositories_listed":0,"syntology":null},{"url":null,"slug":"constrained-dominant-sets-and-its","title":"Constrained Dominant sets and Its applications in computer vision","date":"2020-02-12","arxiv_id":"2002.06028","repositories_listed":0,"syntology":null},{"url":null,"slug":"linear-constrained-rayleigh-quotient","title":"Linear Constrained Rayleigh Quotient Optimization: Theory and Algorithms","date":"2019-11-07","arxiv_id":"1911.02770","repositories_listed":0,"syntology":null},{"url":null,"slug":"benchmark-dataset-for-timetable-optimization","title":"Benchmark Dataset for Timetable Optimization of Bus Routes in the City of New Delhi","date":"2019-10-20","arxiv_id":"1910.08903","repositories_listed":0,"syntology":null},{"url":null,"slug":"190600120","title":"Consensus Clustering: An Embedding Perspective, Extension and Beyond","date":"2019-05-31","arxiv_id":"1906.00120","repositories_listed":0,"syntology":null},{"url":null,"slug":"sub-task-discovery-with-limited-supervision-a","title":"Sub-Task Discovery with Limited Supervision: A Constrained Clustering Approach","date":"2019-03-24","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-framework-for-clustering","title":"A Unified Framework for Clustering Constrained Data without Locality Property","date":"2018-10-02","arxiv_id":"1810.01049","repositories_listed":0,"syntology":null},{"url":null,"slug":"faster-balanced-clusterings-in-high-dimension","title":"Faster Balanced Clusterings in High Dimension","date":"2018-09-04","arxiv_id":"1809.00932","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximation-schemes-for-low-rank-binary","title":"Approximation Schemes for Low-Rank Binary Matrix Approximation Problems","date":"2018-07-18","arxiv_id":"1807.07156","repositories_listed":0,"syntology":null},{"url":"/paper/a-probabilistic-constrained-clustering-for","slug":"a-probabilistic-constrained-clustering-for","title":"A probabilistic constrained clustering for transfer learning and image category discovery","date":"2018-06-28","arxiv_id":"1806.11078","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-clustering-with-prior-knowledge","title":"Hierarchical Clustering with Prior Knowledge","date":"2018-06-09","arxiv_id":"1806.03432","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-with-pairwise-relationships-a","title":"Clustering With Pairwise Relationships: A Generative Approach","date":"2018-05-06","arxiv_id":"1805.02285","repositories_listed":0,"syntology":null},{"url":null,"slug":"size-matters-cardinality-constrained","title":"Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization","date":"2017-05-22","arxiv_id":"1705.07837","repositories_listed":0,"syntology":null},{"url":null,"slug":"multilingual-metaphor-processing-experiments","title":"Multilingual Metaphor Processing: Experiments with Semi-Supervised and Unsupervised Learning","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-robust-framework-for-classifying-evolving","title":"A Robust Framework for Classifying Evolving Document Streams in an Expert-Machine-Crowd Setting","date":"2016-10-06","arxiv_id":"1610.01858","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-union-of-subspace-structure-to","title":"Leveraging Union of Subspace Structure to Improve Constrained Clustering","date":"2016-08-06","arxiv_id":"1608.02146","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-constrained-clustering-based-approach-for","title":"A constrained clustering based approach for matching a collection of feature sets","date":"2016-06-12","arxiv_id":"1606.03731","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-learning-with-explicit","title":"Semi-supervised Learning with Explicit Relationship Regularization","date":"2016-02-11","arxiv_id":"1602.03808","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-use-temporal-driven-constrained","title":"How to Use Temporal-Driven Constrained Clustering to Detect Typical Evolutions","date":"2016-01-11","arxiv_id":"1601.02603","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-with-side-information-from-a","title":"Clustering With Side Information: From a Probabilistic Model to a Deterministic Algorithm","date":"2015-08-25","arxiv_id":"1508.06235","repositories_listed":0,"syntology":null},{"url":null,"slug":"iterative-constrained-clustering-for","title":"Iterative Constrained Clustering for Subjectivity Word Sense Disambiguation","date":"2014-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"constrained-clustering-and-its-application-to","title":"Constrained Clustering and Its Application to Face Clustering in Videos","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"constraints-as-features","title":"Constraints as Features","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-graph-laplacian-regularized-kernel","title":"Fast Graph Laplacian Regularized Kernel Learning via Semidefinite–Quadratic–Linear Programming","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"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"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":7,"papers_where_code_ran_first_page":"/task/constrained-clustering/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/constrained-clustering/papers/ran/1","json":"/task/constrained-clustering/papers/ran/1.json","rows":7}],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"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"},"record_sha256":"d96698d26d10171c873fa8c1fe42a8d567911228d6a2e4a33b2f555d6d341064","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}