{"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/15","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":15,"pages_in_order":108,"rows_per_page":100,"rows":[1401,1500],"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/14","next":"/task/clustering/papers/16","papers":[{"url":"/paper/the-chemical-space-of-terpenes-insights-from","slug":"the-chemical-space-of-terpenes-insights-from","title":"The chemical space of terpenes: insights from data science and AI","date":"2021-10-27","arxiv_id":"2110.15047","repositories_listed":1,"syntology":null},{"url":"/paper/uniform-concentration-bounds-toward-a-unified","slug":"uniform-concentration-bounds-toward-a-unified","title":"Uniform Concentration Bounds toward a Unified Framework for Robust Clustering","date":"2021-10-27","arxiv_id":"2110.14148","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-market-regimes-using-the","slug":"clustering-market-regimes-using-the","title":"Clustering Market Regimes using the Wasserstein Distance","date":"2021-10-22","arxiv_id":"2110.11848","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-of-bank-customers-using-lstm-based","slug":"clustering-of-bank-customers-using-lstm-based","title":"Clustering of Bank Customers using LSTM-based encoder-decoder and Dynamic Time Warping","date":"2021-10-22","arxiv_id":"2110.11769","repositories_listed":1,"syntology":null},{"url":"/paper/multi-view-contrastive-graph-clustering","slug":"multi-view-contrastive-graph-clustering","title":"Multi-view Contrastive Graph Clustering","date":"2021-10-22","arxiv_id":"2110.11842","repositories_listed":1,"syntology":null},{"url":"/paper/robust-representation-and-efficient-feature","slug":"robust-representation-and-efficient-feature","title":"Robust Representation and Efficient Feature Selection Allows for Effective Clustering of SARS-CoV-2 Variants","date":"2021-10-18","arxiv_id":"2110.09622","repositories_listed":1,"syntology":null},{"url":"/paper/deep-clustering-for-general-purpose-audio","slug":"deep-clustering-for-general-purpose-audio","title":"DECAR: Deep Clustering for learning general-purpose Audio Representations","date":"2021-10-17","arxiv_id":"2110.08895","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-based-interpretation-of-deep-relu","slug":"clustering-based-interpretation-of-deep-relu","title":"Clustering-Based Interpretation of Deep ReLU Network","date":"2021-10-13","arxiv_id":"2110.06593","repositories_listed":1,"syntology":null},{"url":"/paper/sssnet-semi-supervised-signed-network","slug":"sssnet-semi-supervised-signed-network","title":"SSSNET: Semi-Supervised Signed Network Clustering","date":"2021-10-13","arxiv_id":"2110.06623","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/sssnet-semi-supervised-signed-network#ran","syntology_url":"https://syntology.ai/paper/2110.06623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.06623"}},"official":{"repos":["sherylhyx/sssnet_signed_clustering"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/novel-features-for-time-series-analysis-a","slug":"novel-features-for-time-series-analysis-a","title":"Novel Features for Time Series Analysis: A Complex Networks Approach","date":"2021-10-11","arxiv_id":"2110.09888","repositories_listed":1,"syntology":null},{"url":"/paper/the-center-of-attention-center-keypoint-1","slug":"the-center-of-attention-center-keypoint-1","title":"The Center of Attention: Center-Keypoint Grouping via Attention for Multi-Person Pose Estimation","date":"2021-10-11","arxiv_id":"2110.05132","repositories_listed":1,"syntology":null},{"url":"/paper/topic-modeling-clade-assisted-sentiment","slug":"topic-modeling-clade-assisted-sentiment","title":"Topic Modeling, Clade-assisted Sentiment Analysis, and Vaccine Brand Reputation Analysis of COVID-19 Vaccine-related Facebook Comments in the Philippines","date":"2021-10-11","arxiv_id":"2111.04416","repositories_listed":1,"syntology":null},{"url":"/paper/mixture-model-auto-encoders-deep-clustering","slug":"mixture-model-auto-encoders-deep-clustering","title":"Mixture Model Auto-Encoders: Deep Clustering through Dictionary Learning","date":"2021-10-10","arxiv_id":"2110.04683","repositories_listed":1,"syntology":null},{"url":"/paper/learning-a-self-expressive-network-for-1","slug":"learning-a-self-expressive-network-for-1","title":"Learning a Self-Expressive Network for Subspace Clustering","date":"2021-10-08","arxiv_id":"2110.04318","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-a-self-expressive-network-for-1#ran","syntology_url":"https://syntology.ai/paper/2110.04318","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.04318"}},"official":{"repos":["zhangsz1998/self-expressive-network"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/clustering-plotted-data-by-image-segmentation","slug":"clustering-plotted-data-by-image-segmentation","title":"Clustering Plotted Data by Image Segmentation","date":"2021-10-06","arxiv_id":"2110.05187","repositories_listed":1,"syntology":null},{"url":"/paper/graphon-based-clustering-and-testing-of","slug":"graphon-based-clustering-and-testing-of","title":"Graphon based Clustering and Testing of Networks: Algorithms and Theory","date":"2021-10-06","arxiv_id":"2110.02722","repositories_listed":1,"syntology":null},{"url":"/paper/row-clustering-of-a-point-process-valued","slug":"row-clustering-of-a-point-process-valued","title":"Row-clustering of a Point Process-valued Matrix","date":"2021-10-04","arxiv_id":"2110.01207","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-and-network-analysis-for-the","slug":"clustering-and-network-analysis-for-the","title":"Clustering and Network Analysis for the Embedding Spaces of Sentences and Sub-Sentences","date":"2021-10-02","arxiv_id":"2110.00697","repositories_listed":1,"syntology":null},{"url":"/paper/moving-object-detection-for-event-based-2","slug":"moving-object-detection-for-event-based-2","title":"Moving Object Detection for Event-based vision using Graph Spectral Clustering","date":"2021-09-30","arxiv_id":"2109.14979","repositories_listed":1,"syntology":null},{"url":"/paper/transfer-learning-based-multi-objective","slug":"transfer-learning-based-multi-objective","title":"Transfer Learning Based Multi-Objective Genetic Algorithm for Dynamic Community Detection","date":"2021-09-30","arxiv_id":"2109.15136","repositories_listed":1,"syntology":null},{"url":"/paper/clustered-task-aware-meta-learning-by","slug":"clustered-task-aware-meta-learning-by","title":"Clustered Task-Aware Meta-Learning by Learning from Learning Paths","date":"2021-09-29","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/gesture2vec-clustering-gestures-using","slug":"gesture2vec-clustering-gestures-using","title":"Gesture2Vec: Clustering Gestures using Representation Learning Methods for Co-speech Gesture Generation","date":"2021-09-29","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/revisit-kernel-pruning-with-lottery-regulated","slug":"revisit-kernel-pruning-with-lottery-regulated","title":"Revisit Kernel Pruning with Lottery Regulated Grouped Convolutions","date":"2021-09-29","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/temporal-clustering-with-external-memory","slug":"temporal-clustering-with-external-memory","title":"Temporal Clustering with External Memory Network for Disease Progression Modeling","date":"2021-09-29","arxiv_id":"2109.14147","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-attribute-and-structure-subspace","slug":"adaptive-attribute-and-structure-subspace","title":"Adaptive Attribute and Structure Subspace Clustering Network","date":"2021-09-28","arxiv_id":"2109.13742","repositories_listed":1,"syntology":null},{"url":"/paper/path-based-hierarchical-clustering-on","slug":"path-based-hierarchical-clustering-on","title":"Path Based Hierarchical Clustering on Knowledge Graphs","date":"2021-09-27","arxiv_id":"2109.13178","repositories_listed":1,"syntology":null},{"url":"/paper/query-based-adversarial-attacks-on-graph-with","slug":"query-based-adversarial-attacks-on-graph-with","title":"Cluster Attack: Query-based Adversarial Attacks on Graphs with Graph-Dependent Priors","date":"2021-09-27","arxiv_id":"2109.13069","repositories_listed":1,"syntology":null},{"url":"/paper/under-the-skin-of-foundation-nft-auctions","slug":"under-the-skin-of-foundation-nft-auctions","title":"Under the Skin of Foundation NFT Auctions","date":"2021-09-25","arxiv_id":"2109.12321","repositories_listed":1,"syntology":null},{"url":"/paper/turn-to-diarize-online-speaker-diarization","slug":"turn-to-diarize-online-speaker-diarization","title":"Turn-to-Diarize: Online Speaker Diarization Constrained by Transformer Transducer Speaker Turn Detection","date":"2021-09-23","arxiv_id":"2109.11641","repositories_listed":1,"syntology":null},{"url":"/paper/deep-variational-clustering-framework-for","slug":"deep-variational-clustering-framework-for","title":"Deep Variational Clustering Framework for Self-labeling of Large-scale Medical Images","date":"2021-09-22","arxiv_id":"2109.10777","repositories_listed":1,"syntology":null},{"url":"/paper/high-dimensional-bayesian-optimization-for","slug":"high-dimensional-bayesian-optimization-for","title":"Bayesian Optimization with Clustering and Rollback for CNN Auto Pruning","date":"2021-09-22","arxiv_id":"2109.10591","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-contextualized-document","slug":"unsupervised-contextualized-document","title":"Unsupervised Contextualized Document Representation","date":"2021-09-22","arxiv_id":"2109.10509","repositories_listed":1,"syntology":null},{"url":"/paper/network-clustering-by-embedding-of-attribute","slug":"network-clustering-by-embedding-of-attribute","title":"Extending Bootstrap AMG for Clustering of Attributed Graphs","date":"2021-09-20","arxiv_id":"2109.09367","repositories_listed":1,"syntology":null},{"url":"/paper/a-divide-and-merge-point-cloud-clustering","slug":"a-divide-and-merge-point-cloud-clustering","title":"A Divide-and-Merge Point Cloud Clustering Algorithm for LiDAR Panoptic Segmentation","date":"2021-09-16","arxiv_id":"2109.08224","repositories_listed":1,"syntology":null},{"url":"/paper/translation-transformers-rediscover-inherent","slug":"translation-transformers-rediscover-inherent","title":"Translation Transformers Rediscover Inherent Data Domains","date":"2021-09-16","arxiv_id":"2109.07864","repositories_listed":1,"syntology":null},{"url":"/paper/a-relation-oriented-clustering-method-for","slug":"a-relation-oriented-clustering-method-for","title":"A Relation-Oriented Clustering Method for Open Relation Extraction","date":"2021-09-15","arxiv_id":"2109.07205","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/a-relation-oriented-clustering-method-for#ran","syntology_url":"https://syntology.ai/paper/2109.07205","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.07205"}},"official":{"repos":["ac-zyx/rocore"],"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/powered-hawkes-dirichlet-process-challenging","slug":"powered-hawkes-dirichlet-process-challenging","title":"Powered Hawkes-Dirichlet Process: Challenging Textual Clustering using a Flexible Temporal Prior","date":"2021-09-15","arxiv_id":"2109.07170","repositories_listed":1,"syntology":null},{"url":"/paper/hemi-multi-view-embedding-in-heterogeneous","slug":"hemi-multi-view-embedding-in-heterogeneous","title":"HeMI: Multi-view Embedding in Heterogeneous Graphs","date":"2021-09-14","arxiv_id":"2109.07008","repositories_listed":1,"syntology":null},{"url":"/paper/overlap-aware-low-latency-online-speaker","slug":"overlap-aware-low-latency-online-speaker","title":"Overlap-aware low-latency online speaker diarization based on end-to-end local segmentation","date":"2021-09-14","arxiv_id":"2109.06483","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-metric-learning-with-graph","slug":"self-supervised-metric-learning-with-graph","title":"Self-Supervised Metric Learning With Graph Clustering For Speaker Diarization","date":"2021-09-14","arxiv_id":"2109.06824","repositories_listed":1,"syntology":null},{"url":"/paper/compositional-affinity-propagation-when","slug":"compositional-affinity-propagation-when","title":"Compositional Clustering: Applications to Multi-Label Object Recognition and Speaker Identification","date":"2021-09-09","arxiv_id":"2109.04160","repositories_listed":1,"syntology":null},{"url":"/paper/popularity-adjusted-block-models-are","slug":"popularity-adjusted-block-models-are","title":"Popularity Adjusted Block Models are Generalized Random Dot Product Graphs","date":"2021-09-09","arxiv_id":"2109.04010","repositories_listed":1,"syntology":null},{"url":"/paper/scale-invariant-representation-of-machine","slug":"scale-invariant-representation-of-machine","title":"Scale-invariant representation of machine learning","date":"2021-09-07","arxiv_id":"2109.02914","repositories_listed":1,"syntology":null},{"url":"/paper/moving-object-detection-for-event-based","slug":"moving-object-detection-for-event-based","title":"Moving Object Detection for Event-based Vision using k-means Clustering","date":"2021-09-04","arxiv_id":"2109.01879","repositories_listed":1,"syntology":null},{"url":"/paper/rama-a-rapid-multicut-algorithm-on-gpu","slug":"rama-a-rapid-multicut-algorithm-on-gpu","title":"RAMA: A Rapid Multicut Algorithm on GPU","date":"2021-09-04","arxiv_id":"2109.01838","repositories_listed":1,"syntology":null},{"url":"/paper/segmentation-of-turbulent-computational-fluid","slug":"segmentation-of-turbulent-computational-fluid","title":"Segmentation of turbulent computational fluid dynamics simulations with unsupervised ensemble learning","date":"2021-09-03","arxiv_id":"2109.01381","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-algorithms-for-fair-clustering-with","slug":"efficient-algorithms-for-fair-clustering-with","title":"Efficient Algorithms For Fair Clustering with a New Fairness Notion","date":"2021-09-02","arxiv_id":"2109.00708","repositories_listed":1,"syntology":null},{"url":"/paper/entity-linking-and-discovery-via-arborescence","slug":"entity-linking-and-discovery-via-arborescence","title":"Entity Linking and Discovery via Arborescence-based Supervised Clustering","date":"2021-09-02","arxiv_id":"2109.01242","repositories_listed":1,"syntology":null},{"url":"/paper/hacam-hierarchical-agglomerative-clustering","slug":"hacam-hierarchical-agglomerative-clustering","title":"HACAM: Hierarchical Agglomerative Clustering Around Medoids - and its Limitations","date":"2021-09-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/modeling-dynamics-of-facial-behavior-for","slug":"modeling-dynamics-of-facial-behavior-for","title":"Modeling Dynamics of Facial Behavior for Mental Health Assessment","date":"2021-08-23","arxiv_id":"2108.09934","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-aware-clustering-for-unsupervised","slug":"uncertainty-aware-clustering-for-unsupervised","title":"Uncertainty-aware Clustering for Unsupervised Domain Adaptive Object Re-identification","date":"2021-08-22","arxiv_id":"2108.09682","repositories_listed":1,"syntology":null},{"url":"/paper/a-technical-survey-and-evaluation-of","slug":"a-technical-survey-and-evaluation-of","title":"A Technical Survey and Evaluation of Traditional Point Cloud Clustering Methods for LiDAR Panoptic Segmentation","date":"2021-08-21","arxiv_id":"2108.09522","repositories_listed":1,"syntology":null},{"url":"/paper/a-framework-for-neural-topic-modeling-of-text","slug":"a-framework-for-neural-topic-modeling-of-text","title":"A Framework for Neural Topic Modeling of Text Corpora","date":"2021-08-19","arxiv_id":"2108.08946","repositories_listed":1,"syntology":null},{"url":"/paper/multi-center-federated-learning-1","slug":"multi-center-federated-learning-1","title":"Multi-Center Federated Learning: Clients Clustering for Better Personalization","date":"2021-08-19","arxiv_id":"2108.08647","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"5 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-center-federated-learning-1#ran","syntology_url":"https://syntology.ai/paper/2108.08647","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.08647"}},"official":{"repos":["mingxuts/multi-center-fed-learning"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hypersf-spectral-hypergraph-coarsening-via","slug":"hypersf-spectral-hypergraph-coarsening-via","title":"HyperSF: Spectral Hypergraph Coarsening via Flow-based Local Clustering","date":"2021-08-17","arxiv_id":"2108.07901","repositories_listed":1,"syntology":null},{"url":"/paper/robust-trimmed-k-means","slug":"robust-trimmed-k-means","title":"Robust Trimmed k-means","date":"2021-08-16","arxiv_id":"2108.07186","repositories_listed":1,"syntology":null},{"url":"/paper/cost-efficient-unsupervised-sample-selection","slug":"cost-efficient-unsupervised-sample-selection","title":"Cost-efficient unsupervised sample selection for multivariate calibration","date":"2021-08-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/clustering-large-data-sets-with-incremental","slug":"clustering-large-data-sets-with-incremental","title":"Clustering Large Data Sets with Incremental Estimation of Low-density Separating Hyperplanes","date":"2021-08-07","arxiv_id":"2108.03442","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-aggregation-for-3d-instance","slug":"hierarchical-aggregation-for-3d-instance","title":"Hierarchical Aggregation for 3D Instance Segmentation","date":"2021-08-05","arxiv_id":"2108.02350","repositories_listed":1,"syntology":null},{"url":"/paper/iart-a-search-engine-for-art-historical","slug":"iart-a-search-engine-for-art-historical","title":"iART: A Search Engine for Art-Historical Images to Support Research in the Humanities","date":"2021-08-03","arxiv_id":"2108.01542","repositories_listed":1,"syntology":null},{"url":"/paper/benchmarking-scalable-methods-for-streaming","slug":"benchmarking-scalable-methods-for-streaming","title":"Benchmarking Scalable Methods for Streaming Cross Document Entity Coreference","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/enslm-ensemble-language-model-for-data","slug":"enslm-ensemble-language-model-for-data","title":"EnsLM: Ensemble Language Model for Data Diversity by Semantic Clustering","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learn-the-big-picture-representation-learning","slug":"learn-the-big-picture-representation-learning","title":"Learn The Big Picture: Representation Learning for Clustering","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/efficient-sparse-spherical-k-means-for","slug":"efficient-sparse-spherical-k-means-for","title":"Efficient Sparse Spherical k-Means for Document Clustering","date":"2021-07-30","arxiv_id":"2108.00895","repositories_listed":1,"syntology":null},{"url":"/paper/graph-constrained-data-representation","slug":"graph-constrained-data-representation","title":"Graph Constrained Data Representation Learning for Human Motion Segmentation","date":"2021-07-28","arxiv_id":"2107.13362","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-constrained-data-representation#ran","syntology_url":"https://syntology.ai/paper/2107.13362","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.13362"}},"official":{"repos":["mdimiccoli/gcrl-for-hms"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/large-sample-spectral-analysis-of-graph-based","slug":"large-sample-spectral-analysis-of-graph-based","title":"Large sample spectral analysis of graph-based multi-manifold clustering","date":"2021-07-28","arxiv_id":"2107.13610","repositories_listed":1,"syntology":null},{"url":"/paper/nearest-neighborhood-based-deep-clustering","slug":"nearest-neighborhood-based-deep-clustering","title":"Nearest Neighborhood-Based Deep Clustering for Source Data-absent Unsupervised Domain Adaptation","date":"2021-07-27","arxiv_id":"2107.12585","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":2,"n_instrument":5,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":9,"phrase":"7 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; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/nearest-neighborhood-based-deep-clustering#ran","syntology_url":"https://syntology.ai/paper/2107.12585","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.12585"}},"official":{"repos":["tntek/N2DCX"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/scalable-community-detection-via-parallel","slug":"scalable-community-detection-via-parallel","title":"Scalable Community Detection via Parallel Correlation Clustering","date":"2021-07-27","arxiv_id":"2108.01731","repositories_listed":1,"syntology":null},{"url":"/paper/structural-learning-of-probabilistic","slug":"structural-learning-of-probabilistic","title":"Structural Learning of Probabilistic Sentential Decision Diagrams under Partial Closed-World Assumption","date":"2021-07-26","arxiv_id":"2107.12130","repositories_listed":1,"syntology":null},{"url":"/paper/rod-reception-aware-online-distillation-for","slug":"rod-reception-aware-online-distillation-for","title":"ROD: Reception-aware Online Distillation for Sparse Graphs","date":"2021-07-25","arxiv_id":"2107.11789","repositories_listed":1,"syntology":null},{"url":"/paper/eggs-eigen-gap-guided-search-making-subspace","slug":"eggs-eigen-gap-guided-search-making-subspace","title":"A Simple Approach to Automated Spectral Clustering","date":"2021-07-23","arxiv_id":"2107.12183","repositories_listed":1,"syntology":null},{"url":"/paper/the-decomposition-of-the-higher-order","slug":"the-decomposition-of-the-higher-order","title":"The decomposition of the higher-order homology embedding constructed from the $k$-Laplacian","date":"2021-07-23","arxiv_id":"2107.10970","repositories_listed":1,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/the-decomposition-of-the-higher-order#ran","syntology_url":"https://syntology.ai/paper/2107.10970","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.10970"}},"official":null}},{"url":"/paper/a-local-approach-to-parameter-space-reduction","slug":"a-local-approach-to-parameter-space-reduction","title":"A local approach to parameter space reduction for regression and classification tasks","date":"2021-07-22","arxiv_id":"2107.10867","repositories_listed":1,"syntology":null},{"url":"/paper/pre-clustering-point-clouds-of-crop-fields","slug":"pre-clustering-point-clouds-of-crop-fields","title":"Pre-Clustering Point Clouds of Crop Fields Using Scalable Methods","date":"2021-07-22","arxiv_id":"2107.10950","repositories_listed":1,"syntology":null},{"url":"/paper/selective-pseudo-label-clustering","slug":"selective-pseudo-label-clustering","title":"Selective Pseudo-label Clustering","date":"2021-07-22","arxiv_id":"2107.10692","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-graph-autoencoder-models-for","slug":"rethinking-graph-autoencoder-models-for","title":"Rethinking Graph Auto-Encoder Models for Attributed Graph Clustering","date":"2021-07-19","arxiv_id":"2107.08562","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":0,"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/rethinking-graph-autoencoder-models-for#ran","syntology_url":"https://syntology.ai/paper/2107.08562","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.08562"}},"official":{"repos":["nairouz/R-GAE"],"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/a-survey-on-role-oriented-network-embedding","slug":"a-survey-on-role-oriented-network-embedding","title":"A Survey on Role-Oriented Network Embedding","date":"2021-07-18","arxiv_id":"2107.08379","repositories_listed":1,"syntology":null},{"url":"/paper/picaso-permutation-invariant-cascaded","slug":"picaso-permutation-invariant-cascaded","title":"PICASO: Permutation-Invariant Cascaded Attentional Set Operator","date":"2021-07-17","arxiv_id":"2107.08305","repositories_listed":1,"syntology":null},{"url":"/paper/scrae-deterministic-regularized-autoencoders","slug":"scrae-deterministic-regularized-autoencoders","title":"ScRAE: Deterministic Regularized Autoencoders with Flexible Priors for Clustering Single-cell Gene Expression Data","date":"2021-07-16","arxiv_id":"2107.07709","repositories_listed":1,"syntology":null},{"url":"/paper/on-designing-good-representation-learning","slug":"on-designing-good-representation-learning","title":"Clustering-Based Representation Learning through Output Translation and Its Application to Remote--Sensing Images","date":"2021-07-13","arxiv_id":"2107.05948","repositories_listed":1,"syntology":null},{"url":"/paper/a-spatial-guided-self-supervised-clustering","slug":"a-spatial-guided-self-supervised-clustering","title":"A Spatial Guided Self-supervised Clustering Network for Medical Image Segmentation","date":"2021-07-11","arxiv_id":"2107.04934","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-spherical-k-means","slug":"accelerating-spherical-k-means","title":"Accelerating Spherical k-Means","date":"2021-07-08","arxiv_id":"2107.04074","repositories_listed":1,"syntology":null},{"url":"/paper/a-simplified-framework-for-air-route","slug":"a-simplified-framework-for-air-route","title":"A Simplified Framework for Air Route Clustering Based on ADS-B Data","date":"2021-07-07","arxiv_id":"2107.12869","repositories_listed":1,"syntology":null},{"url":"/paper/gcn-based-linkage-prediction-for-face","slug":"gcn-based-linkage-prediction-for-face","title":"A Linkage-based Doubly Imbalanced Graph Learning Framework for Face Clustering","date":"2021-07-06","arxiv_id":"2107.02477","repositories_listed":1,"syntology":null},{"url":"/paper/on-generalization-of-graph-autoencoders-with","slug":"on-generalization-of-graph-autoencoders-with","title":"On Generalization of Graph Autoencoders with Adversarial Training","date":"2021-07-06","arxiv_id":"2107.02658","repositories_listed":1,"syntology":null},{"url":"/paper/the-hyperspherical-geometry-of-community","slug":"the-hyperspherical-geometry-of-community","title":"The Hyperspherical Geometry of Community Detection: Modularity as a Distance","date":"2021-07-06","arxiv_id":"2107.02645","repositories_listed":1,"syntology":null},{"url":"/paper/template-based-graph-clustering","slug":"template-based-graph-clustering","title":"Template-Based Graph Clustering","date":"2021-07-05","arxiv_id":"2107.01994","repositories_listed":1,"syntology":null},{"url":"/paper/ucsl-a-machine-learning-expectation","slug":"ucsl-a-machine-learning-expectation","title":"UCSL : A Machine Learning Expectation-Maximization framework for Unsupervised Clustering driven by Supervised Learning","date":"2021-07-05","arxiv_id":"2107.01988","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/ucsl-a-machine-learning-expectation#ran","syntology_url":"https://syntology.ai/paper/2107.01988","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.01988"}},"official":{"repos":["neurospin-projects/2021_rlouiset_ucsl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/latent-structure-blockmodels-for-bayesian","slug":"latent-structure-blockmodels-for-bayesian","title":"Latent structure blockmodels for Bayesian spectral graph clustering","date":"2021-07-04","arxiv_id":"2107.01734","repositories_listed":1,"syntology":null},{"url":"/paper/subspace-clustering-based-analysis-of-neural","slug":"subspace-clustering-based-analysis-of-neural","title":"Subspace Clustering Based Analysis of Neural Networks","date":"2021-07-02","arxiv_id":"2107.01296","repositories_listed":1,"syntology":null},{"url":"/paper/market-regime-classification-with-signatures","slug":"market-regime-classification-with-signatures","title":"Market regime classification with signatures","date":"2021-06-30","arxiv_id":"2107.00066","repositories_listed":1,"syntology":null},{"url":"/paper/s2c2-an-orthogonal-method-for-semi-supervised","slug":"s2c2-an-orthogonal-method-for-semi-supervised","title":"A data-centric approach for improving ambiguous labels with combined semi-supervised classification and clustering","date":"2021-06-30","arxiv_id":"2106.16209","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/s2c2-an-orthogonal-method-for-semi-supervised#ran","syntology_url":"https://syntology.ai/paper/2106.16209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.16209"}},"official":{"repos":["emprime/dc3"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/autonovel-automatically-discovering-and","slug":"autonovel-automatically-discovering-and","title":"AutoNovel: Automatically Discovering and Learning Novel Visual Categories","date":"2021-06-29","arxiv_id":"2106.15252","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-the-analysis-of-software-failures","slug":"enhancing-the-analysis-of-software-failures","title":"Enhancing the Analysis of Software Failures in Cloud Computing Systems with Deep Learning","date":"2021-06-29","arxiv_id":"2106.15182","repositories_listed":1,"syntology":null},{"url":"/paper/federated-graph-classification-over-non-iid","slug":"federated-graph-classification-over-non-iid","title":"Federated Graph Classification over Non-IID Graphs","date":"2021-06-25","arxiv_id":"2106.13423","repositories_listed":1,"syntology":null},{"url":"/paper/primordial-non-gaussianity-from-the-completed","slug":"primordial-non-gaussianity-from-the-completed","title":"Primordial non-Gaussianity from the Completed SDSS-IV extended Baryon Oscillation Spectroscopic Survey I: Catalogue Preparation and Systematic Mitigation","date":"2021-06-25","arxiv_id":"2106.13724","repositories_listed":1,"syntology":null},{"url":"/paper/generalized-unsupervised-clustering-of","slug":"generalized-unsupervised-clustering-of","title":"Generalized Unsupervised Clustering of Hyperspectral Images of Geological Targets in the Near Infrared","date":"2021-06-24","arxiv_id":"2106.13315","repositories_listed":1,"syntology":null},{"url":"/paper/better-algorithms-for-individually-fair-k","slug":"better-algorithms-for-individually-fair-k","title":"Better Algorithms for Individually Fair $k$-Clustering","date":"2021-06-23","arxiv_id":"2106.12150","repositories_listed":1,"syntology":null},{"url":"/paper/a-clustering-based-framework-for-classifying","slug":"a-clustering-based-framework-for-classifying","title":"A Clustering-based Framework for Classifying Data Streams","date":"2021-06-22","arxiv_id":"2106.11823","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":2,"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-clustering-based-framework-for-classifying#ran","syntology_url":"https://syntology.ai/paper/2106.11823","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.11823"}},"official":{"repos":["XuyangAbert/CDSC-AL"],"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","unlocated"]}}},{"url":"/paper/exploring-the-representational-power-of-graph","slug":"exploring-the-representational-power-of-graph","title":"Exploring the Representational Power of Graph Autoencoder","date":"2021-06-22","arxiv_id":"2106.12005","repositories_listed":1,"syntology":null}],"record_sha256":"004823a5399b333cea5db8c97efb2a37e278986641e0bfe047e73b2cec16c202","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}