{"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/clustering/papers/12","list_of":"/task/clustering","task":"Clustering","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":12,"pages_in_order":108,"rows_per_page":100,"rows":[1101,1200],"of":10718,"counts":{"archive_papers_tagged":10718,"with_a_code_link":2823,"where_syntology_ran_a_sample":419,"not_listed_spam_title":0,"listed":10718,"listed_where_code_ran":419,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":335,"every_run_a_failure_of_syntologys_instrument":84,"listed_with_a_run_with_no_instrument_failure":335,"listed_every_run_a_failure_of_syntologys_instrument":84,"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"},"first_page":"/task/clustering","prev":"/task/clustering/papers/11","next":"/task/clustering/papers/13","papers":[{"url":"/paper/visclust-a-visual-clustering-algorithm-based","slug":"visclust-a-visual-clustering-algorithm-based","title":"visClust: A visual clustering algorithm based on orthogonal projections","date":"2022-11-07","arxiv_id":"2211.03894","repositories_listed":1,"syntology":null},{"url":"/paper/direct-deduction-of-chemical-class-from-nmr","slug":"direct-deduction-of-chemical-class-from-nmr","title":"Direct deduction of chemical class from NMR spectra","date":"2022-11-06","arxiv_id":"2211.03173","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-the-positive-role-of-cluster","slug":"rethinking-the-positive-role-of-cluster","title":"Rethinking the positive role of cluster structure in complex networks for link prediction tasks","date":"2022-11-04","arxiv_id":"2211.02396","repositories_listed":1,"syntology":null},{"url":"/paper/cluster-based-autoencoders-for-volumetric","slug":"cluster-based-autoencoders-for-volumetric","title":"Cluster-Based Autoencoders for Volumetric Point Clouds","date":"2022-11-02","arxiv_id":"2211.01009","repositories_listed":1,"syntology":null},{"url":"/paper/slicer-learning-universal-audio","slug":"slicer-learning-universal-audio","title":"SLICER: Learning universal audio representations using low-resource self-supervised pre-training","date":"2022-11-02","arxiv_id":"2211.01519","repositories_listed":1,"syntology":null},{"url":"/paper/improved-learning-augmented-algorithms-for-k","slug":"improved-learning-augmented-algorithms-for-k","title":"Improved Learning-augmented Algorithms for k-means and k-medians Clustering","date":"2022-10-31","arxiv_id":"2210.17028","repositories_listed":1,"syntology":null},{"url":"/paper/sl3d-self-supervised-self-labeled-3d","slug":"sl3d-self-supervised-self-labeled-3d","title":"SL3D: Self-supervised-Self-labeled 3D Recognition","date":"2022-10-30","arxiv_id":"2210.16810","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-prompting-making-pre-trained-language","slug":"beyond-prompting-making-pre-trained-language","title":"Beyond Prompting: Making Pre-trained Language Models Better Zero-shot Learners by Clustering Representations","date":"2022-10-29","arxiv_id":"2210.16637","repositories_listed":1,"syntology":null},{"url":"/paper/federated-clustering-with-gan-based-data","slug":"federated-clustering-with-gan-based-data","title":"Federated clustering with GAN-based data synthesis","date":"2022-10-29","arxiv_id":"2210.16524","repositories_listed":1,"syntology":null},{"url":"/paper/machine-unlearning-of-federated-clusters","slug":"machine-unlearning-of-federated-clusters","title":"Machine Unlearning of Federated Clusters","date":"2022-10-28","arxiv_id":"2210.16424","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/machine-unlearning-of-federated-clusters#ran","syntology_url":"https://syntology.ai/paper/2210.16424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.16424"}},"official":{"repos":["thupchnsky/mufc"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/scalable-spectral-clustering-with-group","slug":"scalable-spectral-clustering-with-group","title":"Scalable Spectral Clustering with Group Fairness Constraints","date":"2022-10-28","arxiv_id":"2210.16435","repositories_listed":1,"syntology":null},{"url":"/paper/graphmad-graph-mixup-for-data-augmentation","slug":"graphmad-graph-mixup-for-data-augmentation","title":"GraphMAD: Graph Mixup for Data Augmentation using Data-Driven Convex Clustering","date":"2022-10-27","arxiv_id":"2210.15721","repositories_listed":1,"syntology":null},{"url":"/paper/coresets-for-vertical-federated-learning","slug":"coresets-for-vertical-federated-learning","title":"Coresets for Vertical Federated Learning: Regularized Linear Regression and $K$-Means Clustering","date":"2022-10-26","arxiv_id":"2210.14664","repositories_listed":1,"syntology":null},{"url":"/paper/hyperef-spectral-hypergraph-coarsening-by","slug":"hyperef-spectral-hypergraph-coarsening-by","title":"HyperEF: Spectral Hypergraph Coarsening by Effective-Resistance Clustering","date":"2022-10-26","arxiv_id":"2210.14813","repositories_listed":1,"syntology":null},{"url":"/paper/prosit-latent-variable-discovery-with","slug":"prosit-latent-variable-discovery-with","title":"ProSiT! Latent Variable Discovery with PROgressive SImilarity Thresholds","date":"2022-10-26","arxiv_id":"2210.14763","repositories_listed":1,"syntology":null},{"url":"/paper/highly-efficient-real-time-streaming-and","slug":"highly-efficient-real-time-streaming-and","title":"Highly Efficient Real-Time Streaming and Fully On-Device Speaker Diarization with Multi-Stage Clustering","date":"2022-10-25","arxiv_id":"2210.13690","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-few-shot-image-classification-by","slug":"unsupervised-few-shot-image-classification-by","title":"Unsupervised Few-Shot Image Classification by Learning Features into Clustering Space","date":"2022-10-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/an-improved-algorithm-for-clustered-federated","slug":"an-improved-algorithm-for-clustered-federated","title":"An Improved Algorithm for Clustered Federated Learning","date":"2022-10-20","arxiv_id":"2210.11538","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-heterogeneous-graph-pre","slug":"self-supervised-heterogeneous-graph-pre","title":"Self-supervised Heterogeneous Graph Pre-training Based on Structural Clustering","date":"2022-10-19","arxiv_id":"2210.10462","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/self-supervised-heterogeneous-graph-pre#ran","syntology_url":"https://syntology.ai/paper/2210.10462","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.10462"}},"official":{"repos":["kepsail/SHGP"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/clustering-categorical-data-soft-rounding-k","slug":"clustering-categorical-data-soft-rounding-k","title":"Clustering Categorical Data: Soft Rounding k-modes","date":"2022-10-18","arxiv_id":"2210.09640","repositories_listed":1,"syntology":null},{"url":"/paper/k-means-clustering-for-persistent-homology","slug":"k-means-clustering-for-persistent-homology","title":"$k$-Means Clustering for Persistent Homology","date":"2022-10-18","arxiv_id":"2210.10003","repositories_listed":1,"syntology":null},{"url":"/paper/watch-the-neighbors-a-unified-k-nearest","slug":"watch-the-neighbors-a-unified-k-nearest","title":"Watch the Neighbors: A Unified K-Nearest Neighbor Contrastive Learning Framework for OOD Intent Discovery","date":"2022-10-17","arxiv_id":"2210.08909","repositories_listed":1,"syntology":null},{"url":"/paper/amd-dbscan-an-adaptive-multi-density-dbscan","slug":"amd-dbscan-an-adaptive-multi-density-dbscan","title":"AMD-DBSCAN: An Adaptive Multi-density DBSCAN for datasets of extremely variable density","date":"2022-10-15","arxiv_id":"2210.08162","repositories_listed":1,"syntology":null},{"url":"/paper/d-mca-outlier-detection-with-explicit-micro","slug":"d-mca-outlier-detection-with-explicit-micro","title":"D.MCA: Outlier Detection with Explicit Micro-Cluster Assignments","date":"2022-10-15","arxiv_id":"2210.08212","repositories_listed":1,"syntology":null},{"url":"/paper/polycentric-clustering-and-structural","slug":"polycentric-clustering-and-structural","title":"Polycentric Clustering and Structural Regularization for Source-free Unsupervised Domain Adaptation","date":"2022-10-14","arxiv_id":"2210.07463","repositories_listed":1,"syntology":null},{"url":"/paper/outlier-robust-group-inference-via-gradient","slug":"outlier-robust-group-inference-via-gradient","title":"Outlier-Robust Group Inference via Gradient Space Clustering","date":"2022-10-13","arxiv_id":"2210.06759","repositories_listed":1,"syntology":null},{"url":"/paper/the-hidden-uniform-cluster-prior-in-self","slug":"the-hidden-uniform-cluster-prior-in-self","title":"The Hidden Uniform Cluster Prior in Self-Supervised Learning","date":"2022-10-13","arxiv_id":"2210.07277","repositories_listed":1,"syntology":null},{"url":"/paper/variational-graph-generator-for-multi-view","slug":"variational-graph-generator-for-multi-view","title":"Variational Graph Generator for Multi-View Graph Clustering","date":"2022-10-13","arxiv_id":"2210.07011","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-embedding-tables-without-first","slug":"clustering-embedding-tables-without-first","title":"Clustering the Sketch: A Novel Approach to Embedding Table Compression","date":"2022-10-12","arxiv_id":"2210.05974","repositories_listed":1,"syntology":null},{"url":"/paper/generalised-mutual-information-for","slug":"generalised-mutual-information-for","title":"Generalised Mutual Information for Discriminative Clustering","date":"2022-10-12","arxiv_id":"2210.06300","repositories_listed":1,"syntology":null},{"url":"/paper/robust-diversified-graph-contrastive-network","slug":"robust-diversified-graph-contrastive-network","title":"Robust Diversified Graph Contrastive Network for Incomplete Multi-view Clustering","date":"2022-10-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/multiple-object-tracking-from-appearance-by","slug":"multiple-object-tracking-from-appearance-by","title":"Multiple Object Tracking from appearance by hierarchically clustering tracklets","date":"2022-10-07","arxiv_id":"2210.03355","repositories_listed":1,"syntology":null},{"url":"/paper/ccc-wav2vec-2-0-clustering-aided-cross","slug":"ccc-wav2vec-2-0-clustering-aided-cross","title":"CCC-wav2vec 2.0: Clustering aided Cross Contrastive Self-supervised learning of speech representations","date":"2022-10-05","arxiv_id":"2210.02592","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":2,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/ccc-wav2vec-2-0-clustering-aided-cross#ran","syntology_url":"https://syntology.ai/paper/2210.02592","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.02592"}},"official":{"repos":["speech-lab-iitm/ccc-wav2vec-2.0"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/particle-clustering-in-turbulence-prediction","slug":"particle-clustering-in-turbulence-prediction","title":"Particle clustering in turbulence: Prediction of spatial and statistical properties with deep learning","date":"2022-10-05","arxiv_id":"2210.02339","repositories_listed":1,"syntology":null},{"url":"/paper/robust-fair-clustering-a-novel-fairness","slug":"robust-fair-clustering-a-novel-fairness","title":"Robust Fair Clustering: A Novel Fairness Attack and Defense Framework","date":"2022-10-04","arxiv_id":"2210.01953","repositories_listed":1,"syntology":null},{"url":"/paper/generating-synthetic-data-with-the-nearest","slug":"generating-synthetic-data-with-the-nearest","title":"Generating Synthetic Data with Locally Estimated Distributions for Disclosure Control","date":"2022-10-03","arxiv_id":"2210.00884","repositories_listed":1,"syntology":null},{"url":"/paper/intrinsicnerf-learning-intrinsic-neural","slug":"intrinsicnerf-learning-intrinsic-neural","title":"IntrinsicNeRF: Learning Intrinsic Neural Radiance Fields for Editable Novel View Synthesis","date":"2022-10-02","arxiv_id":"2210.00647","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"3 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; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/intrinsicnerf-learning-intrinsic-neural#ran","syntology_url":"https://syntology.ai/paper/2210.00647","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.00647"}},"official":{"repos":["zju3dv/intrinsicnerf"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/parea-multi-view-ensemble-clustering-for","slug":"parea-multi-view-ensemble-clustering-for","title":"Parea: multi-view ensemble clustering for cancer subtype discovery","date":"2022-09-30","arxiv_id":"2209.15399","repositories_listed":1,"syntology":null},{"url":"/paper/neighborhood-gradient-clustering-an-efficient","slug":"neighborhood-gradient-clustering-an-efficient","title":"Neighborhood Gradient Clustering: An Efficient Decentralized Learning Method for Non-IID Data Distributions","date":"2022-09-28","arxiv_id":"2209.14390","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-clustering-based-pseudo-labeling","slug":"rethinking-clustering-based-pseudo-labeling","title":"Rethinking Clustering-Based Pseudo-Labeling for Unsupervised Meta-Learning","date":"2022-09-27","arxiv_id":"2209.13635","repositories_listed":1,"syntology":null},{"url":"/paper/deep-fair-clustering-via-maximizing-and","slug":"deep-fair-clustering-via-maximizing-and","title":"Deep Fair Clustering via Maximizing and Minimizing Mutual Information: Theory, Algorithm and Metric","date":"2022-09-26","arxiv_id":"2209.12396","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/deep-fair-clustering-via-maximizing-and#ran","syntology_url":"https://syntology.ai/paper/2209.12396","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.12396"}},"official":{"repos":["PengxinZeng/2023-CVPR-FCMI"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-image-clustering-through-sample","slug":"improving-image-clustering-through-sample","title":"Improving Image Clustering through Sample Ranking and Its Application to remote--sensing images","date":"2022-09-26","arxiv_id":"2209.12621","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/enhancing-cluster-analysis-with-explainable","slug":"enhancing-cluster-analysis-with-explainable","title":"Enhancing Cluster Analysis With Explainable AI and Multidimensional Cluster Prototypes","date":"2022-09-22","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/high-order-multi-view-clustering-for-generic","slug":"high-order-multi-view-clustering-for-generic","title":"High-order Multi-view Clustering for Generic Data","date":"2022-09-22","arxiv_id":"2209.10838","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-learning-for-clustering-of","slug":"self-supervised-learning-for-clustering-of","title":"Self-supervised Learning for Clustering of Wireless Spectrum Activity","date":"2022-09-22","arxiv_id":"2210.02899","repositories_listed":1,"syntology":null},{"url":"/paper/approximate-sampling-and-estimation-of","slug":"approximate-sampling-and-estimation-of","title":"Approximate sampling and estimation of partition functions using neural networks","date":"2022-09-21","arxiv_id":"2209.10423","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-without-knowing-how-to-application","slug":"clustering-without-knowing-how-to-application","title":"Clustering Without Knowing How To: Application and Evaluation","date":"2022-09-21","arxiv_id":"2209.10267","repositories_listed":1,"syntology":null},{"url":"/paper/fal-cur-fair-active-learning-using","slug":"fal-cur-fair-active-learning-using","title":"FAL-CUR: Fair Active Learning using Uncertainty and Representativeness on Fair Clustering","date":"2022-09-21","arxiv_id":"2209.12756","repositories_listed":1,"syntology":null},{"url":"/paper/sgc-a-semi-supervised-pipeline-for-gene","slug":"sgc-a-semi-supervised-pipeline-for-gene","title":"SGC: A semi-supervised pipeline for gene clustering using self-training approach in gene co-expression networks","date":"2022-09-21","arxiv_id":"2209.10545","repositories_listed":1,"syntology":null},{"url":"/paper/non-linguistic-supervision-for-contrastive","slug":"non-linguistic-supervision-for-contrastive","title":"Non-Linguistic Supervision for Contrastive Learning of Sentence Embeddings","date":"2022-09-20","arxiv_id":"2209.09433","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":3,"n_ran_checked":3,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":8,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/non-linguistic-supervision-for-contrastive#ran","syntology_url":"https://syntology.ai/paper/2209.09433","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.09433"}},"official":{"repos":["yiren-jian/NonLing-CSE"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/sanity-check-for-external-clustering","slug":"sanity-check-for-external-clustering","title":"Sanity Check for External Clustering Validation Benchmarks using Internal Validation Measures","date":"2022-09-20","arxiv_id":"2209.10042","repositories_listed":1,"syntology":null},{"url":"/paper/a-simple-and-powerful-global-optimization-for","slug":"a-simple-and-powerful-global-optimization-for","title":"A Simple and Powerful Global Optimization for Unsupervised Video Object Segmentation","date":"2022-09-19","arxiv_id":"2209.09341","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":2,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-simple-and-powerful-global-optimization-for#ran","syntology_url":"https://syntology.ai/paper/2209.09341","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.09341"}},"official":{"repos":["ponimatkin/ssl-vos"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/global-optimization-for-cardinality","slug":"global-optimization-for-cardinality","title":"Global Optimization for Cardinality-constrained Minimum Sum-of-Squares Clustering via Semidefinite Programming","date":"2022-09-19","arxiv_id":"2209.08901","repositories_listed":1,"syntology":null},{"url":"/paper/hipart-hierarchical-divisive-clustering","slug":"hipart-hierarchical-divisive-clustering","title":"HiPart: Hierarchical Divisive Clustering Toolbox","date":"2022-09-18","arxiv_id":"2209.08680","repositories_listed":1,"syntology":null},{"url":"/paper/sf2se3-clustering-scene-flow-into-se-3","slug":"sf2se3-clustering-scene-flow-into-se-3","title":"SF2SE3: Clustering Scene Flow into SE(3)-Motions via Proposal and Selection","date":"2022-09-18","arxiv_id":"2209.08532","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-deep-clustering-of-human-activities","slug":"efficient-deep-clustering-of-human-activities","title":"Efficient Deep Clustering of Human Activities and How to Improve Evaluation","date":"2022-09-17","arxiv_id":"2209.08335","repositories_listed":1,"syntology":null},{"url":"/paper/findings-of-the-shared-task-on-multilingual","slug":"findings-of-the-shared-task-on-multilingual","title":"Findings of the Shared Task on Multilingual Coreference Resolution","date":"2022-09-16","arxiv_id":"2209.07841","repositories_listed":1,"syntology":null},{"url":"/paper/wasserstein-k-means-for-clustering-1","slug":"wasserstein-k-means-for-clustering-1","title":"Wasserstein $K$-means for clustering probability distributions","date":"2022-09-14","arxiv_id":"2209.06975","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/wasserstein-k-means-for-clustering-1#ran","syntology_url":"https://syntology.ai/paper/2209.06975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.06975"}},"official":{"repos":["yubo02/wasserstein-k-means-for-clustering-probability-distributions"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/autoencoder-based-iterative-modeling-and","slug":"autoencoder-based-iterative-modeling-and","title":"Autoencoder Based Iterative Modeling and Multivariate Time-Series Subsequence Clustering Algorithm","date":"2022-09-09","arxiv_id":"2209.04213","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-multi-view-clustering-via-unified","slug":"efficient-multi-view-clustering-via-unified","title":"Efficient Multi-view Clustering via Unified and Discrete Bipartite Graph Learning","date":"2022-09-09","arxiv_id":"2209.04187","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-search-of-active-inference-policy","slug":"efficient-search-of-active-inference-policy","title":"Efficient search of active inference policy spaces using k-means","date":"2022-09-06","arxiv_id":"2209.02550","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-symmetric-matrix-factorization-a","slug":"rethinking-symmetric-matrix-factorization-a","title":"Rethinking Symmetric Matrix Factorization: A More General and Better Clustering Perspective","date":"2022-09-06","arxiv_id":"2209.02528","repositories_listed":1,"syntology":null},{"url":"/paper/autonomous-cross-domain-adaptation-under","slug":"autonomous-cross-domain-adaptation-under","title":"Autonomous Cross Domain Adaptation under Extreme Label Scarcity","date":"2022-09-04","arxiv_id":"2209.01548","repositories_listed":1,"syntology":null},{"url":"/paper/artifact-tolerant-clustering-guided","slug":"artifact-tolerant-clustering-guided","title":"Artifact-Tolerant Clustering-Guided Contrastive Embedding Learning for Ophthalmic Images","date":"2022-09-02","arxiv_id":"2209.00773","repositories_listed":1,"syntology":null},{"url":"/paper/higher-order-clustering-and-pooling-for-graph","slug":"higher-order-clustering-and-pooling-for-graph","title":"Higher-order Clustering and Pooling for Graph Neural Networks","date":"2022-09-02","arxiv_id":"2209.03473","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/higher-order-clustering-and-pooling-for-graph#ran","syntology_url":"https://syntology.ai/paper/2209.03473","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.03473"}},"official":{"repos":["alexduvalinho/hoscpool"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/federated-online-clustering-of-bandits","slug":"federated-online-clustering-of-bandits","title":"Federated Online Clustering of Bandits","date":"2022-08-31","arxiv_id":"2208.14865","repositories_listed":1,"syntology":null},{"url":"/paper/dual-representation-learning-for-one-step","slug":"dual-representation-learning-for-one-step","title":"Dual Representation Learning for One-Step Clustering of Multi-View Data","date":"2022-08-30","arxiv_id":"2208.14450","repositories_listed":1,"syntology":null},{"url":"/paper/k-ms-a-novel-clustering-algorithm-based-on","slug":"k-ms-a-novel-clustering-algorithm-based-on","title":"k-MS: A novel clustering algorithm based on morphological reconstruction","date":"2022-08-30","arxiv_id":"2208.14390","repositories_listed":1,"syntology":null},{"url":"/paper/geometrical-homogeneous-clustering-for-image","slug":"geometrical-homogeneous-clustering-for-image","title":"Geometrical Homogeneous Clustering for Image Data Reduction","date":"2022-08-27","arxiv_id":"2208.13079","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/geometrical-homogeneous-clustering-for-image#ran","syntology_url":"https://syntology.ai/paper/2208.13079","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.13079"}},"official":{"repos":["sonisiddharth/ghcidr"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mori-ran-multi-view-robust-representation","slug":"mori-ran-multi-view-robust-representation","title":"MORI-RAN: Multi-view Robust Representation Learning via Hybrid Contrastive Fusion","date":"2022-08-26","arxiv_id":"2208.12545","repositories_listed":1,"syntology":null},{"url":"/paper/time-series-clustering-with-an-em-algorithm","slug":"time-series-clustering-with-an-em-algorithm","title":"Time Series Clustering with an EM algorithm for Mixtures of Linear Gaussian State Space Models","date":"2022-08-25","arxiv_id":"2208.11907","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-incomplete-multi-view-clustering","slug":"a-survey-on-incomplete-multi-view-clustering","title":"A Survey on Incomplete Multi-view Clustering","date":"2022-08-17","arxiv_id":"2208.08040","repositories_listed":1,"syntology":null},{"url":"/paper/ctrl-clustering-training-losses-for-label","slug":"ctrl-clustering-training-losses-for-label","title":"CTRL: Clustering Training Losses for Label Error Detection","date":"2022-08-17","arxiv_id":"2208.08464","repositories_listed":1,"syntology":null},{"url":"/paper/sensorscan-self-supervised-learning-and-deep","slug":"sensorscan-self-supervised-learning-and-deep","title":"SensorSCAN: Self-Supervised Learning and Deep Clustering for Fault Diagnosis in Chemical Processes","date":"2022-08-17","arxiv_id":"2208.08879","repositories_listed":1,"syntology":null},{"url":"/paper/fec-fast-euclidean-clustering-for-point-cloud","slug":"fec-fast-euclidean-clustering-for-point-cloud","title":"FEC: Fast Euclidean Clustering for Point Cloud Segmentation","date":"2022-08-16","arxiv_id":"2208.07678","repositories_listed":1,"syntology":null},{"url":"/paper/hypergraphs-with-edge-dependent-vertex","slug":"hypergraphs-with-edge-dependent-vertex","title":"Hypergraphs with Edge-Dependent Vertex Weights: p-Laplacians and Spectral Clustering","date":"2022-08-15","arxiv_id":"2208.07457","repositories_listed":1,"syntology":null},{"url":"/paper/pocs-based-clustering-algorithm","slug":"pocs-based-clustering-algorithm","title":"POCS-based Clustering Algorithm","date":"2022-08-15","arxiv_id":"2208.08888","repositories_listed":1,"syntology":null},{"url":"/paper/regime-based-implied-stochastic-volatility","slug":"regime-based-implied-stochastic-volatility","title":"Regime-based Implied Stochastic Volatility Model for Crypto Option Pricing","date":"2022-08-15","arxiv_id":"2208.12614","repositories_listed":1,"syntology":null},{"url":"/paper/ccrl-contrastive-cell-representation-learning","slug":"ccrl-contrastive-cell-representation-learning","title":"CCRL: Contrastive Cell Representation Learning","date":"2022-08-12","arxiv_id":"2208.06445","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-segmentation-of-tooth-from-3d","slug":"semi-supervised-segmentation-of-tooth-from-3d","title":"Semi-supervised segmentation of tooth from 3D Scanned Dental Arches","date":"2022-08-10","arxiv_id":"2208.05539","repositories_listed":1,"syntology":null},{"url":"/paper/an-efficient-person-clustering-algorithm-for","slug":"an-efficient-person-clustering-algorithm-for","title":"An Efficient Person Clustering Algorithm for Open Checkout-free Groceries","date":"2022-08-05","arxiv_id":"2208.02973","repositories_listed":1,"syntology":null},{"url":"/paper/localized-sparse-incomplete-multi-view","slug":"localized-sparse-incomplete-multi-view","title":"Localized Sparse Incomplete Multi-view Clustering","date":"2022-08-05","arxiv_id":"2208.02998","repositories_listed":1,"syntology":null},{"url":"/paper/domestic-activity-clustering-from-audio-via","slug":"domestic-activity-clustering-from-audio-via","title":"Domestic Activity Clustering from Audio via Depthwise Separable Convolutional Autoencoder Network","date":"2022-08-04","arxiv_id":"2208.02406","repositories_listed":1,"syntology":null},{"url":"/paper/xcon-learning-with-experts-for-fine-grained","slug":"xcon-learning-with-experts-for-fine-grained","title":"XCon: Learning with Experts for Fine-grained Category Discovery","date":"2022-08-03","arxiv_id":"2208.01898","repositories_listed":1,"syntology":null},{"url":"/paper/a-tighter-analysis-of-spectral-clustering-and","slug":"a-tighter-analysis-of-spectral-clustering-and","title":"A Tighter Analysis of Spectral Clustering, and Beyond","date":"2022-08-02","arxiv_id":"2208.01724","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-tighter-analysis-of-spectral-clustering-and#ran","syntology_url":"https://syntology.ai/paper/2208.01724","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.01724"}},"official":{"repos":["pmacg/spectral-clustering-meta-graphs"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/late-fusion-multi-view-clustering-via-global","slug":"late-fusion-multi-view-clustering-via-global","title":"Late Fusion Multi-view Clustering via Global and Local Alignment Maximization","date":"2022-08-02","arxiv_id":"2208.01198","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-machine-learning-framework-for","slug":"unsupervised-machine-learning-framework-for","title":"Unsupervised machine learning framework for discriminating major variants of concern during COVID-19","date":"2022-08-01","arxiv_id":"2208.01439","repositories_listed":1,"syntology":null},{"url":"/paper/simplex-clustering-via-sbeta-with","slug":"simplex-clustering-via-sbeta-with","title":"Simplex Clustering via sBeta with Applications to Online Adjustment of Black-Box Predictions","date":"2022-07-30","arxiv_id":"2208.00287","repositories_listed":1,"syntology":null},{"url":"/paper/learning-idempotent-representation-for","slug":"learning-idempotent-representation-for","title":"Learning idempotent representation for subspace clustering","date":"2022-07-29","arxiv_id":"2207.14431","repositories_listed":1,"syntology":null},{"url":"/paper/utterance-by-utterance-overlap-aware-neural","slug":"utterance-by-utterance-overlap-aware-neural","title":"Utterance-by-utterance overlap-aware neural diarization with Graph-PIT","date":"2022-07-28","arxiv_id":"2207.13888","repositories_listed":1,"syntology":null},{"url":"/paper/on-mitigating-hard-clusters-for-face","slug":"on-mitigating-hard-clusters-for-face","title":"On Mitigating Hard Clusters for Face Clustering","date":"2022-07-25","arxiv_id":"2207.11895","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 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) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/on-mitigating-hard-clusters-for-face#ran","syntology_url":"https://syntology.ai/paper/2207.11895","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.11895"}},"official":{"repos":["echoanran/on-mitigating-hard-clusters"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tensor-based-multi-view-spectral-clustering","slug":"tensor-based-multi-view-spectral-clustering","title":"Tensor-based Multi-view Spectral Clustering via Shared Latent Space","date":"2022-07-23","arxiv_id":"2207.11559","repositories_listed":1,"syntology":null},{"url":"/paper/divide-and-conquer-3d-point-cloud-instance","slug":"divide-and-conquer-3d-point-cloud-instance","title":"Divide and Conquer: 3D Point Cloud Instance Segmentation With Point-Wise Binarization","date":"2022-07-22","arxiv_id":"2207.11209","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/divide-and-conquer-3d-point-cloud-instance#ran","syntology_url":"https://syntology.ai/paper/2207.11209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.11209"}},"official":{"repos":["weiguangzhao/PBNet"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/collaborating-domain-shared-and-target","slug":"collaborating-domain-shared-and-target","title":"Collaborating Domain-shared and Target-specific Feature Clustering for Cross-domain 3D Action Recognition","date":"2022-07-20","arxiv_id":"2207.09767","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/collaborating-domain-shared-and-target#ran","syntology_url":"https://syntology.ai/paper/2207.09767","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.09767"}},"official":{"repos":["canbaoburen/CoDT"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/goca-guided-online-cluster-assignment-for","slug":"goca-guided-online-cluster-assignment-for","title":"GOCA: Guided Online Cluster Assignment for Self-Supervised Video Representation Learning","date":"2022-07-20","arxiv_id":"2207.10158","repositories_listed":1,"syntology":null},{"url":"/paper/expert-lasts-expert-knowledge-guided-latent","slug":"expert-lasts-expert-knowledge-guided-latent","title":"Expert-LaSTS: Expert-Knowledge Guided Latent Space for Traffic Scenarios","date":"2022-07-19","arxiv_id":"2207.09120","repositories_listed":1,"syntology":null},{"url":"/paper/global-and-local-features-through-gaussian","slug":"global-and-local-features-through-gaussian","title":"Global and Local Features through Gaussian Mixture Models on Image Semantic Segmentation","date":"2022-07-19","arxiv_id":"2207.09162","repositories_listed":1,"syntology":null},{"url":"/paper/simplifying-clustering-with-graph-neural","slug":"simplifying-clustering-with-graph-neural","title":"Simplifying Clustering with Graph Neural Networks","date":"2022-07-18","arxiv_id":"2207.08779","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/simplifying-clustering-with-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2207.08779","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.08779"}},"official":{"repos":["filippomb/simplifying-clustering-with-graph-neural-networks"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-experimental-evaluation-of-machine","slug":"an-experimental-evaluation-of-machine","title":"An Experimental Evaluation of Machine Learning Training on a Real Processing-in-Memory System","date":"2022-07-16","arxiv_id":"2207.07886","repositories_listed":1,"syntology":null}],"record_sha256":"14648f59f7160e7fea318ded04df973b128bdd04d6e86d1e4608f2da08d6ba44","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}