{"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/13","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":13,"pages_in_order":108,"rows_per_page":100,"rows":[1201,1300],"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/12","next":"/task/clustering/papers/14","papers":[{"url":"/paper/unsupervised-feature-selection-method-based","slug":"unsupervised-feature-selection-method-based","title":"Unsupervised feature selection method based on iterative similarity graph factorization and clustering by modularity","date":"2022-07-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/image-clustering-with-contrastive-learning","slug":"image-clustering-with-contrastive-learning","title":"Deep Image Clustering with Contrastive Learning and Multi-scale Graph Convolutional Networks","date":"2022-07-14","arxiv_id":"2207.07173","repositories_listed":1,"syntology":null},{"url":"/paper/aclnet-an-attention-and-clustering-based","slug":"aclnet-an-attention-and-clustering-based","title":"ACLNet: An Attention and Clustering-based Cloud Segmentation Network","date":"2022-07-13","arxiv_id":"2207.06277","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-visual-representation-learning-4","slug":"unsupervised-visual-representation-learning-4","title":"Unsupervised Visual Representation Learning by Synchronous Momentum Grouping","date":"2022-07-13","arxiv_id":"2207.06167","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/unsupervised-visual-representation-learning-4#ran","syntology_url":"https://syntology.ai/paper/2207.06167","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.06167"}},"official":null}},{"url":"/paper/the-cosmic-graph-optimal-information","slug":"the-cosmic-graph-optimal-information","title":"The Cosmic Graph: Optimal Information Extraction from Large-Scale Structure using Catalogues","date":"2022-07-11","arxiv_id":"2207.05202","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/the-cosmic-graph-optimal-information#ran","syntology_url":"https://syntology.ai/paper/2207.05202","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.05202"}},"official":{"repos":["tlmakinen/cosmicgraphs"],"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/unsupervised-semantic-segmentation-with-self","slug":"unsupervised-semantic-segmentation-with-self","title":"Unsupervised Semantic Segmentation with Self-supervised Object-centric Representations","date":"2022-07-11","arxiv_id":"2207.05027","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":0,"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/unsupervised-semantic-segmentation-with-self#ran","syntology_url":"https://syntology.ai/paper/2207.05027","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.05027"}},"official":{"repos":["zadaianchuk/comus"],"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/segmentation-of-blood-vessels-optic-disc","slug":"segmentation-of-blood-vessels-optic-disc","title":"Segmentation of Blood Vessels, Optic Disc Localization, Detection of Exudates and Diabetic Retinopathy Diagnosis from Digital Fundus Images","date":"2022-07-09","arxiv_id":"2207.04345","repositories_listed":1,"syntology":null},{"url":"/paper/getting-bart-to-ride-the-idiomatic-train","slug":"getting-bart-to-ride-the-idiomatic-train","title":"Getting BART to Ride the Idiomatic Train: Learning to Represent Idiomatic Expressions","date":"2022-07-08","arxiv_id":"2207.03679","repositories_listed":1,"syntology":null},{"url":"/paper/individual-preference-stability-for","slug":"individual-preference-stability-for","title":"Individual Preference Stability for Clustering","date":"2022-07-07","arxiv_id":"2207.03600","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/individual-preference-stability-for#ran","syntology_url":"https://syntology.ai/paper/2207.03600","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.03600"}},"official":{"repos":["amazon-research/ip-stability-for-clustering"],"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/mitigating-shortage-of-labeled-data-using","slug":"mitigating-shortage-of-labeled-data-using","title":"Mitigating shortage of labeled data using clustering-based active learning with diversity exploration","date":"2022-07-06","arxiv_id":"2207.02964","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mitigating-shortage-of-labeled-data-using#ran","syntology_url":"https://syntology.ai/paper/2207.02964","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.02964"}},"official":{"repos":["xuyangabert/alcs"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/local-sample-weighted-multiple-kernel","slug":"local-sample-weighted-multiple-kernel","title":"Local Sample-weighted Multiple Kernel Clustering with Consensus Discriminative Graph","date":"2022-07-05","arxiv_id":"2207.02846","repositories_listed":1,"syntology":null},{"url":"/paper/a-new-index-for-clustering-evaluation-based","slug":"a-new-index-for-clustering-evaluation-based","title":"A New Index for Clustering Evaluation Based on Density Estimation","date":"2022-07-04","arxiv_id":"2207.01294","repositories_listed":1,"syntology":null},{"url":"/paper/embedding-contrastive-unsupervised-features","slug":"embedding-contrastive-unsupervised-features","title":"Embedding contrastive unsupervised features to cluster in- and out-of-distribution noise in corrupted image datasets","date":"2022-07-04","arxiv_id":"2207.01573","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/embedding-contrastive-unsupervised-features#ran","syntology_url":"https://syntology.ai/paper/2207.01573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.01573"}},"official":{"repos":["paulalbert31/sncf"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/an-empirical-evaluation-of-k-means-coresets","slug":"an-empirical-evaluation-of-k-means-coresets","title":"An Empirical Evaluation of $k$-Means Coresets","date":"2022-07-03","arxiv_id":"2207.00966","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":6,"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/an-empirical-evaluation-of-k-means-coresets#ran","syntology_url":"https://syntology.ai/paper/2207.00966","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.00966"}},"official":{"repos":["sheikhomar/eval-k-means-coresets"],"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/sub-cluster-aware-network-for-few-shot-skin","slug":"sub-cluster-aware-network-for-few-shot-skin","title":"Dynamic Sub-Cluster-Aware Network for Few-Shot Skin Disease Classification","date":"2022-07-03","arxiv_id":"2207.01072","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-cluster-analysis-via-topological","slug":"enhancing-cluster-analysis-via-topological","title":"Enhancing cluster analysis via topological manifold learning","date":"2022-07-01","arxiv_id":"2207.00510","repositories_listed":1,"syntology":null},{"url":"/paper/a-perturbation-bound-on-the-subspace","slug":"a-perturbation-bound-on-the-subspace","title":"A Perturbation Bound on the Subspace Estimator from Canonical Projections","date":"2022-06-28","arxiv_id":"2206.14278","repositories_listed":1,"syntology":null},{"url":"/paper/invaastcluster-on-applying-invariant-based","slug":"invaastcluster-on-applying-invariant-based","title":"InvAASTCluster: On Applying Invariant-Based Program Clustering to Introductory Programming Assignments","date":"2022-06-28","arxiv_id":"2206.14175","repositories_listed":1,"syntology":null},{"url":"/paper/sublinear-time-clustering-oracle-for-signed","slug":"sublinear-time-clustering-oracle-for-signed","title":"Sublinear-Time Clustering Oracle for Signed Graphs","date":"2022-06-28","arxiv_id":"2206.13813","repositories_listed":1,"syntology":null},{"url":"/paper/analyzing-encoded-concepts-in-transformer","slug":"analyzing-encoded-concepts-in-transformer","title":"Analyzing Encoded Concepts in Transformer Language Models","date":"2022-06-27","arxiv_id":"2206.13289","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/analyzing-encoded-concepts-in-transformer#ran","syntology_url":"https://syntology.ai/paper/2206.13289","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.13289"}},"official":{"repos":["hsajjad/conceptx"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/vision-transformer-for-contrastive-clustering","slug":"vision-transformer-for-contrastive-clustering","title":"Vision Transformer for Contrastive Clustering","date":"2022-06-26","arxiv_id":"2206.12925","repositories_listed":1,"syntology":null},{"url":"/paper/slic-self-supervised-learning-with-iterative-1","slug":"slic-self-supervised-learning-with-iterative-1","title":"SLIC: Self-Supervised Learning with Iterative Clustering for Human Action Videos","date":"2022-06-25","arxiv_id":"2206.12534","repositories_listed":1,"syntology":null},{"url":"/paper/secleds-sequence-clustering-in-evolving-data","slug":"secleds-sequence-clustering-in-evolving-data","title":"SECLEDS: Sequence Clustering in Evolving Data Streams via Multiple Medoids and Medoid Voting","date":"2022-06-24","arxiv_id":"2206.12190","repositories_listed":1,"syntology":null},{"url":"/paper/waypoint-generation-in-row-based-crops-with","slug":"waypoint-generation-in-row-based-crops-with","title":"Waypoint Generation in Row-based Crops with Deep Learning and Contrastive Clustering","date":"2022-06-23","arxiv_id":"2206.11623","repositories_listed":1,"syntology":null},{"url":"/paper/automated-cancer-subtyping-via-vector","slug":"automated-cancer-subtyping-via-vector","title":"Automated Cancer Subtyping via Vector Quantization Mutual Information Maximization","date":"2022-06-22","arxiv_id":"2206.10801","repositories_listed":1,"syntology":null},{"url":"/paper/bregman-power-k-means-for-clustering","slug":"bregman-power-k-means-for-clustering","title":"Bregman Power k-Means for Clustering Exponential Family Data","date":"2022-06-22","arxiv_id":"2206.10860","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/bregman-power-k-means-for-clustering#ran","syntology_url":"https://syntology.ai/paper/2206.10860","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.10860"}},"official":{"repos":["avellal14/bregman_power_kmeans"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/object-type-clustering-using-markov-directly","slug":"object-type-clustering-using-markov-directly","title":"Object Type Clustering using Markov Directly-Follow Multigraph in Object-Centric Process Mining","date":"2022-06-22","arxiv_id":"2206.11017","repositories_listed":1,"syntology":null},{"url":"/paper/analysis-of-self-supervised-learning-and","slug":"analysis-of-self-supervised-learning-and","title":"Analysis of Self-Supervised Learning and Dimensionality Reduction Methods in Clustering-Based Active Learning for Speech Emotion Recognition","date":"2022-06-21","arxiv_id":"2206.10188","repositories_listed":1,"syntology":null},{"url":"/paper/position-prior-clustering-based-self","slug":"position-prior-clustering-based-self","title":"Position-prior Clustering-based Self-attention Module for Knee Cartilage Segmentation","date":"2022-06-21","arxiv_id":"2206.10286","repositories_listed":1,"syntology":null},{"url":"/paper/scim-simultaneous-clustering-inference-and","slug":"scim-simultaneous-clustering-inference-and","title":"SCIM: Simultaneous Clustering, Inference, and Mapping for Open-World Semantic Scene Understanding","date":"2022-06-21","arxiv_id":"2206.10670","repositories_listed":1,"syntology":null},{"url":"/paper/decentralized-adaptive-clustering-of-deep","slug":"decentralized-adaptive-clustering-of-deep","title":"Decentralized adaptive clustering of deep nets is beneficial for client collaboration","date":"2022-06-17","arxiv_id":"2206.08839","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-differentially-private-clustering","slug":"scalable-differentially-private-clustering","title":"Scalable Differentially Private Clustering via Hierarchically Separated Trees","date":"2022-06-17","arxiv_id":"2206.08646","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-supervised-vs-unsupervised-1","slug":"beyond-supervised-vs-unsupervised-1","title":"Beyond Supervised vs. Unsupervised: Representative Benchmarking and Analysis of Image Representation Learning","date":"2022-06-16","arxiv_id":"2206.08347","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":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/beyond-supervised-vs-unsupervised-1#ran","syntology_url":"https://syntology.ai/paper/2206.08347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08347"}},"official":{"repos":["mgwillia/unsupervised-analysis"],"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/unsupervised-space-partitioning-for-nearest","slug":"unsupervised-space-partitioning-for-nearest","title":"Unsupervised Space Partitioning for Nearest Neighbor Search","date":"2022-06-16","arxiv_id":"2206.08091","repositories_listed":1,"syntology":null},{"url":"/paper/a-comprehensive-survey-on-deep-clustering","slug":"a-comprehensive-survey-on-deep-clustering","title":"A Comprehensive Survey on Deep Clustering: Taxonomy, Challenges, and Future Directions","date":"2022-06-15","arxiv_id":"2206.07579","repositories_listed":1,"syntology":null},{"url":"/paper/the-classification-of-optical-galaxy","slug":"the-classification-of-optical-galaxy","title":"The Classification of Optical Galaxy Morphology Using Unsupervised Learning Techniques","date":"2022-06-13","arxiv_id":"2206.06165","repositories_listed":1,"syntology":null},{"url":"/paper/convergence-and-recovery-guarantees-of-the-k","slug":"convergence-and-recovery-guarantees-of-the-k","title":"Convergence and Recovery Guarantees of the K-Subspaces Method for Subspace Clustering","date":"2022-06-11","arxiv_id":"2206.05553","repositories_listed":1,"syntology":null},{"url":"/paper/improved-approximation-for-fair-correlation","slug":"improved-approximation-for-fair-correlation","title":"Improved Approximation for Fair Correlation Clustering","date":"2022-06-09","arxiv_id":"2206.05050","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improved-approximation-for-fair-correlation#ran","syntology_url":"https://syntology.ai/paper/2206.05050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.05050"}},"official":{"repos":["moonin12/improved_fair_correlation_clustering"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/pytsk-a-python-toolbox-for-tsk-fuzzy-systems","slug":"pytsk-a-python-toolbox-for-tsk-fuzzy-systems","title":"PyTSK: A Python Toolbox for TSK Fuzzy Systems","date":"2022-06-07","arxiv_id":"2206.03310","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-realistic-test-time-training","slug":"revisiting-realistic-test-time-training","title":"Revisiting Realistic Test-Time Training: Sequential Inference and Adaptation by Anchored Clustering","date":"2022-06-06","arxiv_id":"2206.02721","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":0,"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/revisiting-realistic-test-time-training#ran","syntology_url":"https://syntology.ai/paper/2206.02721","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.02721"}},"official":{"repos":["gorilla-lab-scut/ttac"],"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/clustering-similar-amendments-at-the-italian","slug":"clustering-similar-amendments-at-the-italian","title":"Clustering Similar Amendments at the Italian Senate","date":"2022-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/federated-learning-under-distributed-concept","slug":"federated-learning-under-distributed-concept","title":"Federated Learning under Distributed Concept Drift","date":"2022-06-01","arxiv_id":"2206.00799","repositories_listed":1,"syntology":null},{"url":"/paper/identifying-copied-fragments-in-a-18th","slug":"identifying-copied-fragments-in-a-18th","title":"Identifying Copied Fragments in a 18th Century Dutch Chronicle","date":"2022-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/more-a-metric-learning-based-framework-for","slug":"more-a-metric-learning-based-framework-for","title":"MORE: A Metric Learning Based Framework for Open-domain Relation Extraction","date":"2022-06-01","arxiv_id":"2206.00289","repositories_listed":1,"syntology":null},{"url":"/paper/strongly-augmented-contrastive-clustering","slug":"strongly-augmented-contrastive-clustering","title":"Strongly Augmented Contrastive Clustering","date":"2022-06-01","arxiv_id":"2206.00380","repositories_listed":1,"syntology":null},{"url":"/paper/compressed-hierarchical-representations-for","slug":"compressed-hierarchical-representations-for","title":"Compressed Hierarchical Representations for Multi-Task Learning and Task Clustering","date":"2022-05-31","arxiv_id":"2205.15882","repositories_listed":1,"syntology":null},{"url":"/paper/align-then-fusion-generalized-large-scale","slug":"align-then-fusion-generalized-large-scale","title":"Align then Fusion: Generalized Large-scale Multi-view Clustering with Anchor Matching Correspondences","date":"2022-05-30","arxiv_id":"2205.15075","repositories_listed":1,"syntology":null},{"url":"/paper/deep-embedded-clustering-with-distribution","slug":"deep-embedded-clustering-with-distribution","title":"Deep Embedded Clustering with Distribution Consistency Preservation for Attributed Networks","date":"2022-05-28","arxiv_id":"2205.14303","repositories_listed":1,"syntology":null},{"url":"/paper/mc-gen-multi-level-clustering-for-private","slug":"mc-gen-multi-level-clustering-for-private","title":"MC-GEN:Multi-level Clustering for Private Synthetic Data Generation","date":"2022-05-28","arxiv_id":"2205.14298","repositories_listed":1,"syntology":null},{"url":"/paper/cream-weakly-supervised-object-localization","slug":"cream-weakly-supervised-object-localization","title":"CREAM: Weakly Supervised Object Localization via Class RE-Activation Mapping","date":"2022-05-27","arxiv_id":"2205.13922","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":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/cream-weakly-supervised-object-localization#ran","syntology_url":"https://syntology.ai/paper/2205.13922","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13922"}},"official":{"repos":["jazzcharles/cream"],"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/subspace-clustering-in-high-dimensions-phase","slug":"subspace-clustering-in-high-dimensions-phase","title":"Subspace clustering in high-dimensions: Phase transitions & Statistical-to-Computational gap","date":"2022-05-26","arxiv_id":"2205.13527","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/subspace-clustering-in-high-dimensions-phase#ran","syntology_url":"https://syntology.ai/paper/2205.13527","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13527"}},"official":{"repos":["lucpoisson/subspaceclustering"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/new-intent-discovery-with-pre-training-and-1","slug":"new-intent-discovery-with-pre-training-and-1","title":"New Intent Discovery with Pre-training and Contrastive Learning","date":"2022-05-25","arxiv_id":"2205.12914","repositories_listed":1,"syntology":null},{"url":"/paper/orchestra-unsupervised-federated-learning-via","slug":"orchestra-unsupervised-federated-learning-via","title":"Orchestra: Unsupervised Federated Learning via Globally Consistent Clustering","date":"2022-05-23","arxiv_id":"2205.11506","repositories_listed":1,"syntology":{"n":17,"n_ran":14,"n_constructed":7,"n_ran_checked":7,"n_instrument":7,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":17,"phrase":"14 ran (of which 7 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 7 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/orchestra-unsupervised-federated-learning-via#ran","syntology_url":"https://syntology.ai/paper/2205.11506","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.11506"}},"official":{"repos":["akhilmathurs/orchestra"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":7,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/semi-supervised-subspace-clustering-via","slug":"semi-supervised-subspace-clustering-via","title":"Semi-Supervised Subspace Clustering via Tensor Low-Rank Representation","date":"2022-05-21","arxiv_id":"2205.10481","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-as-attention-unified-image","slug":"clustering-as-attention-unified-image","title":"HCFormer: Unified Image Segmentation with Hierarchical Clustering","date":"2022-05-20","arxiv_id":"2205.09949","repositories_listed":1,"syntology":null},{"url":"/paper/heterformer-a-transformer-architecture-for","slug":"heterformer-a-transformer-architecture-for","title":"Heterformer: Transformer-based Deep Node Representation Learning on Heterogeneous Text-Rich Networks","date":"2022-05-20","arxiv_id":"2205.10282","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/heterformer-a-transformer-architecture-for#ran","syntology_url":"https://syntology.ai/paper/2205.10282","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10282"}},"official":{"repos":["petergriffinjin/heterformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hippocluster-an-efficient-hippocampus","slug":"hippocluster-an-efficient-hippocampus","title":"Hippocluster: an efficient, hippocampus-inspired algorithm for graph clustering","date":"2022-05-19","arxiv_id":"2205.12338","repositories_listed":1,"syntology":null},{"url":"/paper/hyperaid-denoising-in-hyperbolic-spaces-for","slug":"hyperaid-denoising-in-hyperbolic-spaces-for","title":"HyperAid: Denoising in hyperbolic spaces for tree-fitting and hierarchical clustering","date":"2022-05-19","arxiv_id":"2205.09721","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-multi-view-clustering-with-graph","slug":"scalable-multi-view-clustering-with-graph","title":"Scalable Multi-view Clustering with Graph Filtering","date":"2022-05-18","arxiv_id":"2205.09228","repositories_listed":1,"syntology":null},{"url":"/paper/perfect-spectral-clustering-with-discrete","slug":"perfect-spectral-clustering-with-discrete","title":"Perfect Spectral Clustering with Discrete Covariates","date":"2022-05-17","arxiv_id":"2205.08047","repositories_listed":1,"syntology":null},{"url":"/paper/ensemble-clustering-via-co-association-matrix","slug":"ensemble-clustering-via-co-association-matrix","title":"Ensemble Clustering via Co-association Matrix Self-enhancement","date":"2022-05-12","arxiv_id":"2205.05937","repositories_listed":1,"syntology":null},{"url":"/paper/local-motif-clustering-via-hyper-graph","slug":"local-motif-clustering-via-hyper-graph","title":"Local Motif Clustering via (Hyper)Graph Partitioning","date":"2022-05-11","arxiv_id":"2205.06176","repositories_listed":1,"syntology":null},{"url":"/paper/ease-entity-aware-contrastive-learning-of-1","slug":"ease-entity-aware-contrastive-learning-of-1","title":"EASE: Entity-Aware Contrastive Learning of Sentence Embedding","date":"2022-05-09","arxiv_id":"2205.04260","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 4 unverified","sample_list":"/paper/ease-entity-aware-contrastive-learning-of-1#ran","syntology_url":"https://syntology.ai/paper/2205.04260","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.04260"}},"official":{"repos":["studio-ousia/ease"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/local-prediction-aggregation-a-frustratingly","slug":"local-prediction-aggregation-a-frustratingly","title":"Attracting and Dispersing: A Simple Approach for Source-free Domain Adaptation","date":"2022-05-09","arxiv_id":"2205.04183","repositories_listed":1,"syntology":{"n":20,"n_ran":14,"n_constructed":4,"n_ran_checked":6,"n_instrument":8,"n_unverified":6,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":20,"phrase":"14 ran (of which 4 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 8 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/local-prediction-aggregation-a-frustratingly#ran","syntology_url":"https://syntology.ai/paper/2205.04183","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.04183"}},"official":{"repos":["Albert0147/AaD_SFDA"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":4,"n_ran_no_instrument_failure":5,"n_unverified":6,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/surreal-gan-semi-supervised-representation-1","slug":"surreal-gan-semi-supervised-representation-1","title":"Surreal-GAN:Semi-Supervised Representation Learning via GAN for uncovering heterogeneous disease-related imaging patterns","date":"2022-05-09","arxiv_id":"2205.04523","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/surreal-gan-semi-supervised-representation-1#ran","syntology_url":"https://syntology.ai/paper/2205.04523","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.04523"}},"official":{"repos":["zhijian-yang/SurrealGAN"],"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/application-of-clustering-algorithms-for","slug":"application-of-clustering-algorithms-for","title":"Application of Clustering Algorithms for Dimensionality Reduction in Infrastructure Resilience Prediction Models","date":"2022-05-06","arxiv_id":"2205.03316","repositories_listed":1,"syntology":null},{"url":"/paper/covid-19-epidemiology-as-emergent-behavior-on","slug":"covid-19-epidemiology-as-emergent-behavior-on","title":"COVID-19 epidemiology as emergent behavior on a dynamic transmission forest","date":"2022-05-04","arxiv_id":"2205.02150","repositories_listed":1,"syntology":null},{"url":"/paper/dadapy-distance-based-analysis-of-data","slug":"dadapy-distance-based-analysis-of-data","title":"DADApy: Distance-based Analysis of DAta-manifolds in Python","date":"2022-05-04","arxiv_id":"2205.03373","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 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","sample_list":"/paper/dadapy-distance-based-analysis-of-data#ran","syntology_url":"https://syntology.ai/paper/2205.03373","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.03373"}},"official":{"repos":["sissa-data-science/dadapy"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/hiure-hierarchical-exemplar-contrastive-1","slug":"hiure-hierarchical-exemplar-contrastive-1","title":"HiURE: Hierarchical Exemplar Contrastive Learning for Unsupervised Relation Extraction","date":"2022-05-04","arxiv_id":"2205.02225","repositories_listed":1,"syntology":null},{"url":"/paper/centerclip-token-clustering-for-efficient","slug":"centerclip-token-clustering-for-efficient","title":"CenterCLIP: Token Clustering for Efficient Text-Video Retrieval","date":"2022-05-02","arxiv_id":"2205.00823","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/centerclip-token-clustering-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2205.00823","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.00823"}},"official":{"repos":["mzhaoshuai/CenterCLIP"],"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/dfc-anatomically-informed-fiber-clustering","slug":"dfc-anatomically-informed-fiber-clustering","title":"Deep fiber clustering: Anatomically informed fiber clustering with self-supervised deep learning for fast and effective tractography parcellation","date":"2022-05-02","arxiv_id":"2205.00627","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-gaussian-neurons-for-online","slug":"revisiting-gaussian-neurons-for-online","title":"Revisiting Gaussian Neurons for Online Clustering with Unknown Number of Clusters","date":"2022-05-02","arxiv_id":"2205.00920","repositories_listed":1,"syntology":null},{"url":"/paper/the-multivariate-community-hawkes-model-for","slug":"the-multivariate-community-hawkes-model-for","title":"The Multivariate Community Hawkes Model for Dependent Relational Events in Continuous-time Networks","date":"2022-05-02","arxiv_id":"2205.00639","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/the-multivariate-community-hawkes-model-for#ran","syntology_url":"https://syntology.ai/paper/2205.00639","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.00639"}},"official":{"repos":["ideaslabut/multivariate-community-hawkes"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/disentangled-knowledge-transfer-for-ood","slug":"disentangled-knowledge-transfer-for-ood","title":"Disentangled Knowledge Transfer for OOD Intent Discovery with Unified Contrastive Learning","date":"2022-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/quickgraph-a-rapid-annotation-tool-for","slug":"quickgraph-a-rapid-annotation-tool-for","title":"QuickGraph: A Rapid Annotation Tool for Knowledge Graph Extraction from Technical Text","date":"2022-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fractional-vegetation-cover-estimation-using","slug":"fractional-vegetation-cover-estimation-using","title":"Fractional Vegetation Cover Estimation using Hough Lines and Linear Iterative Clustering","date":"2022-04-30","arxiv_id":"2205.00366","repositories_listed":1,"syntology":null},{"url":"/paper/learning-cosmology-and-clustering-with-cosmic","slug":"learning-cosmology-and-clustering-with-cosmic","title":"Learning cosmology and clustering with cosmic graphs","date":"2022-04-28","arxiv_id":"2204.13713","repositories_listed":1,"syntology":{"n":8,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 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) · 6 unverified","sample_list":"/paper/learning-cosmology-and-clustering-with-cosmic#ran","syntology_url":"https://syntology.ai/paper/2204.13713","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.13713"}},"official":{"repos":["PabloVD/CosmoGraphNet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/detecting-backdoor-poisoning-attacks-on-deep","slug":"detecting-backdoor-poisoning-attacks-on-deep","title":"Detecting Backdoor Poisoning Attacks on Deep Neural Networks by Heatmap Clustering","date":"2022-04-27","arxiv_id":"2204.12848","repositories_listed":1,"syntology":null},{"url":"/paper/nonbacktracking-spectral-clustering-of","slug":"nonbacktracking-spectral-clustering-of","title":"Nonbacktracking spectral clustering of nonuniform hypergraphs","date":"2022-04-27","arxiv_id":"2204.13586","repositories_listed":1,"syntology":null},{"url":"/paper/scgc-self-supervised-contrastive-graph","slug":"scgc-self-supervised-contrastive-graph","title":"SCGC : Self-Supervised Contrastive Graph Clustering","date":"2022-04-27","arxiv_id":"2204.12656","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-segmentation-of-hyperspectral-1","slug":"unsupervised-segmentation-of-hyperspectral-1","title":"Unsupervised Segmentation of Hyperspectral Remote Sensing Images with Superpixels","date":"2022-04-26","arxiv_id":"2204.12296","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-hierarchical-semantic","slug":"unsupervised-hierarchical-semantic","title":"Unsupervised Hierarchical Semantic Segmentation with Multiview Cosegmentation and Clustering Transformers","date":"2022-04-25","arxiv_id":"2204.11432","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":2,"n_instrument":7,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 7 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/unsupervised-hierarchical-semantic#ran","syntology_url":"https://syntology.ai/paper/2204.11432","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.11432"}},"official":{"repos":["twke18/hsg"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/embedtrack-simultaneous-cell-segmentation-and","slug":"embedtrack-simultaneous-cell-segmentation-and","title":"EmbedTrack -- Simultaneous Cell Segmentation and Tracking Through Learning Offsets and Clustering Bandwidths","date":"2022-04-22","arxiv_id":"2204.10713","repositories_listed":1,"syntology":null},{"url":"/paper/is-neural-topic-modelling-better-than-1","slug":"is-neural-topic-modelling-better-than-1","title":"Is Neural Topic Modelling Better than Clustering? An Empirical Study on Clustering with Contextual Embeddings for Topics","date":"2022-04-21","arxiv_id":"2204.09874","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/is-neural-topic-modelling-better-than-1#ran","syntology_url":"https://syntology.ai/paper/2204.09874","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.09874"}},"official":{"repos":["hyintell/topicx"],"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/not-all-tokens-are-equal-human-centric-visual","slug":"not-all-tokens-are-equal-human-centric-visual","title":"Not All Tokens Are Equal: Human-centric Visual Analysis via Token Clustering Transformer","date":"2022-04-19","arxiv_id":"2204.08680","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/not-all-tokens-are-equal-human-centric-visual#ran","syntology_url":"https://syntology.ai/paper/2204.08680","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.08680"}},"official":{"repos":["zengwang430521/tcformer"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-greedy-and-optimistic-approach-to","slug":"a-greedy-and-optimistic-approach-to","title":"A Greedy and Optimistic Approach to Clustering with a Specified Uncertainty of Covariates","date":"2022-04-18","arxiv_id":"2204.08205","repositories_listed":1,"syntology":null},{"url":"/paper/big-means-less-is-more-for-k-means-clustering","slug":"big-means-less-is-more-for-k-means-clustering","title":"How to Use K-means for Big Data Clustering?","date":"2022-04-14","arxiv_id":"2204.07485","repositories_listed":1,"syntology":null},{"url":"/paper/implicit-sample-extension-for-unsupervised","slug":"implicit-sample-extension-for-unsupervised","title":"Implicit Sample Extension for Unsupervised Person Re-Identification","date":"2022-04-14","arxiv_id":"2204.06892","repositories_listed":1,"syntology":null},{"url":"/paper/active-diffusion-and-vca-assisted-image","slug":"active-diffusion-and-vca-assisted-image","title":"Active Diffusion and VCA-Assisted Image Segmentation of Hyperspectral Images","date":"2022-04-13","arxiv_id":"2204.06298","repositories_listed":1,"syntology":null},{"url":"/paper/bmd-a-general-class-balanced-multicentric","slug":"bmd-a-general-class-balanced-multicentric","title":"BMD: A General Class-balanced Multicentric Dynamic Prototype Strategy for Source-free Domain Adaptation","date":"2022-04-06","arxiv_id":"2204.02811","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/bmd-a-general-class-balanced-multicentric#ran","syntology_url":"https://syntology.ai/paper/2204.02811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.02811"}},"official":{"repos":["ispc-lab/bmd"],"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/correlation-based-feature-selection-to","slug":"correlation-based-feature-selection-to","title":"Correlation-based feature selection to identify functional dynamics in proteins","date":"2022-04-06","arxiv_id":"2204.02770","repositories_listed":1,"syntology":null},{"url":"/paper/cgc-contrastive-graph-clustering-for","slug":"cgc-contrastive-graph-clustering-for","title":"CGC: Contrastive Graph Clustering for Community Detection and Tracking","date":"2022-04-05","arxiv_id":"2204.08504","repositories_listed":1,"syntology":null},{"url":"/paper/pareto-optimal-clustering-with-the-primal","slug":"pareto-optimal-clustering-with-the-primal","title":"Pareto-optimal clustering with the primal deterministic information bottleneck","date":"2022-04-05","arxiv_id":"2204.02489","repositories_listed":1,"syntology":null},{"url":"/paper/a-computational-analysis-of-pitch-drift-in","slug":"a-computational-analysis-of-pitch-drift-in","title":"A Computational Analysis of Pitch Drift in Unaccompanied Solo Singing using DBSCAN Clustering","date":"2022-04-03","arxiv_id":"2204.01009","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-biomedical-term-clustering-by","slug":"automatic-biomedical-term-clustering-by","title":"Automatic Biomedical Term Clustering by Learning Fine-grained Term Representations","date":"2022-04-01","arxiv_id":"2204.00391","repositories_listed":1,"syntology":null},{"url":"/paper/deepdpm-deep-clustering-with-an-unknown","slug":"deepdpm-deep-clustering-with-an-unknown","title":"DeepDPM: Deep Clustering With an Unknown Number of Clusters","date":"2022-03-27","arxiv_id":"2203.14309","repositories_listed":1,"syntology":null},{"url":"/paper/feature-extraction-using-spectral-clustering","slug":"feature-extraction-using-spectral-clustering","title":"Feature extraction using Spectral Clustering for Gene Function Prediction using Hierarchical Multi-label Classification","date":"2022-03-25","arxiv_id":"2203.13551","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/feature-extraction-using-spectral-clustering#ran","syntology_url":"https://syntology.ai/paper/2203.13551","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.13551"}},"official":{"repos":["migueleci/clustering_hmc"],"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/smaragd-synthesized-smatch-for-accurate-and","slug":"smaragd-synthesized-smatch-for-accurate-and","title":"SMARAGD: Learning SMatch for Accurate and Rapid Approximate Graph Distance","date":"2022-03-24","arxiv_id":"2203.13226","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/semi-supervised-graph-learning-meets","slug":"semi-supervised-graph-learning-meets","title":"Semi-Supervised Graph Learning Meets Dimensionality Reduction","date":"2022-03-23","arxiv_id":"2203.12522","repositories_listed":1,"syntology":null}],"record_sha256":"89e240610425816a26c3bbea3def328c04d4bfe0efaa4655d117039128cae93a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}