{"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/5","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":5,"pages_in_order":108,"rows_per_page":100,"rows":[401,500],"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/4","next":"/task/clustering/papers/6","papers":[{"url":"/paper/learning-from-video-and-text-via-large-scale","slug":"learning-from-video-and-text-via-large-scale","title":"Learning from Video and Text via Large-Scale Discriminative Clustering","date":"2017-07-27","arxiv_id":"1707.09074","repositories_listed":2,"syntology":null},{"url":"/paper/cnn-features-are-also-great-at-unsupervised","slug":"cnn-features-are-also-great-at-unsupervised","title":"CNN features are also great at unsupervised classification","date":"2017-07-06","arxiv_id":"1707.01700","repositories_listed":2,"syntology":null},{"url":"/paper/learning-complex-valued-latent-filters-with","slug":"learning-complex-valued-latent-filters-with","title":"Learning complex-valued latent filters with absolute cosine similarity","date":"2017-06-19","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/clustering-with-t-sne-provably","slug":"clustering-with-t-sne-provably","title":"Clustering with t-SNE, provably","date":"2017-06-08","arxiv_id":"1706.02582","repositories_listed":2,"syntology":null},{"url":"/paper/an-online-hierarchical-algorithm-for-extreme","slug":"an-online-hierarchical-algorithm-for-extreme","title":"An Online Hierarchical Algorithm for Extreme Clustering","date":"2017-04-06","arxiv_id":"1704.01858","repositories_listed":2,"syntology":null},{"url":"/paper/an-embedded-segmental-k-means-model-for","slug":"an-embedded-segmental-k-means-model-for","title":"An embedded segmental K-means model for unsupervised segmentation and clustering of speech","date":"2017-03-23","arxiv_id":"1703.08135","repositories_listed":2,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":3,"phrase":"13 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/an-embedded-segmental-k-means-model-for#ran","syntology_url":"https://syntology.ai/paper/1703.08135","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.08135"}},"official":null}},{"url":"/paper/discriminatively-boosted-image-clustering","slug":"discriminatively-boosted-image-clustering","title":"Discriminatively Boosted Image Clustering with Fully Convolutional Auto-Encoders","date":"2017-03-23","arxiv_id":"1703.07980","repositories_listed":2,"syntology":null},{"url":"/paper/learning-discrete-representations-via","slug":"learning-discrete-representations-via","title":"Learning Discrete Representations via Information Maximizing Self-Augmented Training","date":"2017-02-28","arxiv_id":"1702.08720","repositories_listed":2,"syntology":null},{"url":"/paper/sequential-dirichlet-process-mixtures-of","slug":"sequential-dirichlet-process-mixtures-of","title":"Sequential Dirichlet Process Mixtures of Multivariate Skew t-distributions for Model-based Clustering of Flow Cytometry Data","date":"2017-02-14","arxiv_id":"1702.04407","repositories_listed":2,"syntology":null},{"url":"/paper/name-disambiguation-in-anonymized-graphs","slug":"name-disambiguation-in-anonymized-graphs","title":"Name Disambiguation in Anonymized Graphs using Network Embedding","date":"2017-02-08","arxiv_id":"1702.02287","repositories_listed":2,"syntology":null},{"url":"/paper/fast-exact-k-means-k-medians-and-bregman","slug":"fast-exact-k-means-k-medians-and-bregman","title":"Fast Exact k-Means, k-Medians and Bregman Divergence Clustering in 1D","date":"2017-01-25","arxiv_id":"1701.07204","repositories_listed":2,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/fast-exact-k-means-k-medians-and-bregman#ran","syntology_url":"https://syntology.ai/paper/1701.07204","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.07204"}},"official":null}},{"url":"/paper/bayesian-latent-structure-discovery-from","slug":"bayesian-latent-structure-discovery-from","title":"Bayesian latent structure discovery from multi-neuron recordings","date":"2016-10-26","arxiv_id":"1610.08465","repositories_listed":2,"syntology":null},{"url":"/paper/video-summarization-using-deep-semantic","slug":"video-summarization-using-deep-semantic","title":"Video Summarization using Deep Semantic Features","date":"2016-09-28","arxiv_id":"1609.08758","repositories_listed":2,"syntology":null},{"url":"/paper/sequence-graph-transform-sgt-a-feature","slug":"sequence-graph-transform-sgt-a-feature","title":"Sequence Graph Transform (SGT): A Feature Extraction Function for Sequence Data Mining (Extended Version)","date":"2016-08-11","arxiv_id":"1608.03533","repositories_listed":2,"syntology":null},{"url":"/paper/single-channel-multi-speaker-separation-using","slug":"single-channel-multi-speaker-separation-using","title":"Single-Channel Multi-Speaker Separation using Deep Clustering","date":"2016-07-07","arxiv_id":"1607.02173","repositories_listed":2,"syntology":null},{"url":"/paper/triplet-probabilistic-embedding-for-face","slug":"triplet-probabilistic-embedding-for-face","title":"Triplet Probabilistic Embedding for Face Verification and Clustering","date":"2016-04-19","arxiv_id":"1604.05417","repositories_listed":2,"syntology":null},{"url":"/paper/the-deterministic-information-bottleneck","slug":"the-deterministic-information-bottleneck","title":"The deterministic information bottleneck","date":"2016-04-01","arxiv_id":"1604.00268","repositories_listed":2,"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":3,"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/the-deterministic-information-bottleneck#ran","syntology_url":"https://syntology.ai/paper/1604.00268","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1604.00268"}},"official":null}},{"url":"/paper/fast-k-means-with-accurate-bounds","slug":"fast-k-means-with-accurate-bounds","title":"Fast K-Means with Accurate Bounds","date":"2016-02-08","arxiv_id":"1602.02514","repositories_listed":2,"syntology":null},{"url":"/paper/mxnet-a-flexible-and-efficient-machine","slug":"mxnet-a-flexible-and-efficient-machine","title":"MXNet: A Flexible and Efficient Machine Learning Library for Heterogeneous Distributed Systems","date":"2015-12-03","arxiv_id":"1512.01274","repositories_listed":2,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/mxnet-a-flexible-and-efficient-machine#ran","syntology_url":"https://syntology.ai/paper/1512.01274","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1512.01274"}},"official":null}},{"url":"/paper/neural-network-based-clustering-using","slug":"neural-network-based-clustering-using","title":"Neural network-based clustering using pairwise constraints","date":"2015-11-19","arxiv_id":"1511.06321","repositories_listed":2,"syntology":null},{"url":"/paper/grarep-learning-graph-representations-with","slug":"grarep-learning-graph-representations-with","title":"GraRep: Learning Graph Representations with Global Structural Information","date":"2015-10-17","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/fast-discrete-distribution-clustering-using","slug":"fast-discrete-distribution-clustering-using","title":"Fast Discrete Distribution Clustering Using Wasserstein Barycenter with Sparse Support","date":"2015-09-30","arxiv_id":"1510.00012","repositories_listed":2,"syntology":null},{"url":"/paper/scalable-sparse-subspace-clustering-by","slug":"scalable-sparse-subspace-clustering-by","title":"Scalable Sparse Subspace Clustering by Orthogonal Matching Pursuit","date":"2015-07-05","arxiv_id":"1507.01238","repositories_listed":2,"syntology":null},{"url":"/paper/a-hebbiananti-hebbian-network-derived-from","slug":"a-hebbiananti-hebbian-network-derived-from","title":"A Hebbian/Anti-Hebbian Network Derived from Online Non-Negative Matrix Factorization Can Cluster and Discover Sparse Features","date":"2015-03-02","arxiv_id":"1503.00680","repositories_listed":2,"syntology":null},{"url":"/paper/caffe-convolutional-architecture-for-fast","slug":"caffe-convolutional-architecture-for-fast","title":"Caffe: Convolutional Architecture for Fast Feature Embedding","date":"2014-06-20","arxiv_id":"1408.5093","repositories_listed":2,"syntology":null},{"url":"/paper/how-many-topics-stability-analysis-for-topic","slug":"how-many-topics-stability-analysis-for-topic","title":"How Many Topics? Stability Analysis for Topic Models","date":"2014-04-16","arxiv_id":"1404.4606","repositories_listed":2,"syntology":null},{"url":"/paper/fast-computation-of-wasserstein-barycenters","slug":"fast-computation-of-wasserstein-barycenters","title":"Fast Computation of Wasserstein Barycenters","date":"2013-10-16","arxiv_id":"1310.4375","repositories_listed":2,"syntology":null},{"url":"/paper/from-deformations-to-parts-motion-based","slug":"from-deformations-to-parts-motion-based","title":"From Deformations to Parts: Motion-based Segmentation of 3D Objects","date":"2012-12-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/graph-degree-linkage-agglomerative-clustering","slug":"graph-degree-linkage-agglomerative-clustering","title":"Graph Degree Linkage: Agglomerative Clustering on a Directed Graph","date":"2012-08-25","arxiv_id":"1208.5092","repositories_listed":2,"syntology":null},{"url":"/paper/towards-a-mathematical-foundation-of","slug":"towards-a-mathematical-foundation-of","title":"Towards a Mathematical Foundation of Immunology and Amino Acid Chains","date":"2012-05-28","arxiv_id":"1205.6031","repositories_listed":2,"syntology":null},{"url":"/paper/modern-hierarchical-agglomerative-clustering","slug":"modern-hierarchical-agglomerative-clustering","title":"Modern hierarchical, agglomerative clustering algorithms","date":"2011-09-12","arxiv_id":"1109.2378","repositories_listed":2,"syntology":null},{"url":"/paper/an-inverse-power-method-for-nonlinear-1","slug":"an-inverse-power-method-for-nonlinear-1","title":"An Inverse Power Method for Nonlinear Eigenproblems with Applications in 1-Spectral Clustering and Sparse PCA","date":"2010-12-03","arxiv_id":"1012.0774","repositories_listed":2,"syntology":null},{"url":"/paper/dlib-ml-a-machine-learning-toolkit","slug":"dlib-ml-a-machine-learning-toolkit","title":"Dlib-ml: A Machine Learning Toolkit","date":"2009-01-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/tri-learn-graph-fusion-network-for-attributed","slug":"tri-learn-graph-fusion-network-for-attributed","title":"Tri-Learn Graph Fusion Network for Attributed Graph Clustering","date":"2025-07-18","arxiv_id":"2507.13620","repositories_listed":1,"syntology":null},{"url":"/paper/car-object-counting-and-position-estimation","slug":"car-object-counting-and-position-estimation","title":"Car Object Counting and Position Estimation via Extension of the CLIP-EBC Framework","date":"2025-07-11","arxiv_id":"2507.08240","repositories_listed":1,"syntology":null},{"url":"/paper/hercules-hierarchical-embedding-based","slug":"hercules-hierarchical-embedding-based","title":"HERCULES: Hierarchical Embedding-based Recursive Clustering Using LLMs for Efficient Summarization","date":"2025-06-24","arxiv_id":"2506.19992","repositories_listed":1,"syntology":null},{"url":"/paper/mico-multiple-instance-learning-with-context","slug":"mico-multiple-instance-learning-with-context","title":"MiCo: Multiple Instance Learning with Context-Aware Clustering for Whole Slide Image Analysis","date":"2025-06-22","arxiv_id":"2506.18028","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-learning-of-echocardiographic","slug":"self-supervised-learning-of-echocardiographic","title":"Self-supervised Learning of Echocardiographic Video Representations via Online Cluster Distillation","date":"2025-06-13","arxiv_id":"2506.11777","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":3,"n_ran_checked":3,"n_instrument":5,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":10,"phrase":"8 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/self-supervised-learning-of-echocardiographic#ran","syntology_url":"https://syntology.ai/paper/2506.11777","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.11777"}},"official":{"repos":["mdivyanshu97/discovr"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/structural-spectral-graph-convolution-with","slug":"structural-spectral-graph-convolution-with","title":"Structural-Spectral Graph Convolution with Evidential Edge Learning for Hyperspectral Image Clustering","date":"2025-06-11","arxiv_id":"2506.09920","repositories_listed":1,"syntology":null},{"url":"/paper/clustered-federated-learning-via-embedding","slug":"clustered-federated-learning-via-embedding","title":"Clustered Federated Learning via Embedding Distributions","date":"2025-06-09","arxiv_id":"2506.07769","repositories_listed":1,"syntology":null},{"url":"/paper/modified-k-means-algorithm-with-local","slug":"modified-k-means-algorithm-with-local","title":"Modified K-means Algorithm with Local Optimality Guarantees","date":"2025-06-08","arxiv_id":"2506.06990","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/modified-k-means-algorithm-with-local#ran","syntology_url":"https://syntology.ai/paper/2506.06990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.06990"}},"official":{"repos":["lmingyi/lo-k-means"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/differentially-private-federated-k-means","slug":"differentially-private-federated-k-means","title":"Differentially Private Federated $k$-Means Clustering with Server-Side Data","date":"2025-06-04","arxiv_id":"2506.05408","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":1,"n_no_contract":2,"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, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/differentially-private-federated-k-means#ran","syntology_url":"https://syntology.ai/paper/2506.05408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.05408"}},"official":{"repos":["jonnyascott/fed-dp-kmeans"],"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/learning-to-cluster-neuronal-function","slug":"learning-to-cluster-neuronal-function","title":"Learning to cluster neuronal function","date":"2025-06-03","arxiv_id":"2506.03293","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/learning-to-cluster-neuronal-function#ran","syntology_url":"https://syntology.ai/paper/2506.03293","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.03293"}},"official":{"repos":["nisone2000/sensorium"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/speaker-diarization-with-overlapping","slug":"speaker-diarization-with-overlapping","title":"Speaker Diarization with Overlapping Community Detection Using Graph Attention Networks and Label Propagation Algorithm","date":"2025-06-03","arxiv_id":"2506.02610","repositories_listed":1,"syntology":null},{"url":"/paper/jojoscl-shrinkage-contrastive-learning-for","slug":"jojoscl-shrinkage-contrastive-learning-for","title":"JojoSCL: Shrinkage Contrastive Learning for single-cell RNA sequence Clustering","date":"2025-05-31","arxiv_id":"2506.00410","repositories_listed":1,"syntology":null},{"url":"/paper/how-does-transformer-learn-implicit-reasoning","slug":"how-does-transformer-learn-implicit-reasoning","title":"How does Transformer Learn Implicit Reasoning?","date":"2025-05-29","arxiv_id":"2505.23653","repositories_listed":1,"syntology":null},{"url":"/paper/towards-a-more-generalized-approach-in-open","slug":"towards-a-more-generalized-approach-in-open","title":"Towards a More Generalized Approach in Open Relation Extraction","date":"2025-05-28","arxiv_id":"2505.22801","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-attacks-against-closed-source","slug":"adversarial-attacks-against-closed-source","title":"Adversarial Attacks against Closed-Source MLLMs via Feature Optimal Alignment","date":"2025-05-27","arxiv_id":"2505.21494","repositories_listed":1,"syntology":null},{"url":"/paper/the-avengers-a-simple-recipe-for-uniting","slug":"the-avengers-a-simple-recipe-for-uniting","title":"The Avengers: A Simple Recipe for Uniting Smaller Language Models to Challenge Proprietary Giants","date":"2025-05-26","arxiv_id":"2505.19797","repositories_listed":1,"syntology":null},{"url":"/paper/alpcahus-subspace-clustering-for","slug":"alpcahus-subspace-clustering-for","title":"ALPCAHUS: Subspace Clustering for Heteroscedastic Data","date":"2025-05-25","arxiv_id":"2505.18918","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-and-pruning-in-causal-data-fusion","slug":"clustering-and-pruning-in-causal-data-fusion","title":"Clustering and Pruning in Causal Data Fusion","date":"2025-05-21","arxiv_id":"2505.15215","repositories_listed":1,"syntology":null},{"url":"/paper/csts-a-benchmark-for-the-discovery-of","slug":"csts-a-benchmark-for-the-discovery-of","title":"CSTS: A Benchmark for the Discovery of Correlation Structures in Time Series Clustering","date":"2025-05-20","arxiv_id":"2505.14596","repositories_listed":1,"syntology":null},{"url":"/paper/generalized-category-discovery-via-token","slug":"generalized-category-discovery-via-token","title":"Generalized Category Discovery via Token Manifold Capacity Learning","date":"2025-05-20","arxiv_id":"2505.14044","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-graph-clustering-with-deep","slug":"unsupervised-graph-clustering-with-deep","title":"Unsupervised Graph Clustering with Deep Structural Entropy","date":"2025-05-20","arxiv_id":"2505.14040","repositories_listed":1,"syntology":null},{"url":"/paper/2505-11040","slug":"2505-11040","title":"Efficient Attention via Pre-Scoring: Prioritizing Informative Keys in Transformers","date":"2025-05-16","arxiv_id":"2505.11040","repositories_listed":1,"syntology":null},{"url":"/paper/2505-10699","slug":"2505-10699","title":"Clustering Rooftop PV Systems via Probabilistic Embeddings","date":"2025-05-15","arxiv_id":"2505.10699","repositories_listed":1,"syntology":null},{"url":"/paper/2505-10704","slug":"2505-10704","title":"ZEUS: Zero-shot Embeddings for Unsupervised Separation of Tabular Data","date":"2025-05-15","arxiv_id":"2505.10704","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":2,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"5 ran (of which 2 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) · 3 unverified","sample_list":"/paper/2505-10704#ran","syntology_url":"https://syntology.ai/paper/2505.10704","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.10704"}},"official":{"repos":["gmum/zeus"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/depth-based-local-center-clustering-a","slug":"depth-based-local-center-clustering-a","title":"Depth-Based Local Center Clustering: A Framework for Handling Different Clustering Scenarios","date":"2025-05-14","arxiv_id":"2505.09516","repositories_listed":1,"syntology":null},{"url":"/paper/energy-efficient-federated-learning-for-aiot","slug":"energy-efficient-federated-learning-for-aiot","title":"Energy-Efficient Federated Learning for AIoT using Clustering Methods","date":"2025-05-14","arxiv_id":"2505.09704","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-novel-category-discovery","slug":"few-shot-novel-category-discovery","title":"Few-shot Novel Category Discovery","date":"2025-05-13","arxiv_id":"2505.08260","repositories_listed":1,"syntology":null},{"url":"/paper/fcpca-fuzzy-clustering-of-high-dimensional","slug":"fcpca-fuzzy-clustering-of-high-dimensional","title":"FCPCA: Fuzzy clustering of high-dimensional time series based on common principal component analysis","date":"2025-05-12","arxiv_id":"2505.07276","repositories_listed":1,"syntology":null},{"url":"/paper/kcluster-an-llm-based-clustering-approach-to","slug":"kcluster-an-llm-based-clustering-approach-to","title":"KCluster: An LLM-based Clustering Approach to Knowledge Component Discovery","date":"2025-05-09","arxiv_id":"2505.06469","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-and-robust-dbscan-with-multi-agent","slug":"adaptive-and-robust-dbscan-with-multi-agent","title":"Adaptive and Robust DBSCAN with Multi-agent Reinforcement Learning","date":"2025-05-07","arxiv_id":"2505.04339","repositories_listed":1,"syntology":null},{"url":"/paper/clust-splitter-an-efficient-nonsmooth","slug":"clust-splitter-an-efficient-nonsmooth","title":"Clust-Splitter $-$ an Efficient Nonsmooth Optimization-Based Algorithm for Clustering Large Datasets","date":"2025-05-07","arxiv_id":"2505.04389","repositories_listed":1,"syntology":null},{"url":"/paper/discriminative-ordering-through-ensemble","slug":"discriminative-ordering-through-ensemble","title":"Discriminative Ordering Through Ensemble Consensus","date":"2025-05-07","arxiv_id":"2505.04464","repositories_listed":1,"syntology":null},{"url":"/paper/partial-label-clustering","slug":"partial-label-clustering","title":"Partial Label Clustering","date":"2025-05-06","arxiv_id":"2505.03207","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-internet-memes-through-template","slug":"clustering-internet-memes-through-template","title":"Clustering Internet Memes Through Template Matching and Multi-Dimensional Similarity","date":"2025-04-30","arxiv_id":"2505.00056","repositories_listed":1,"syntology":null},{"url":"/paper/clusterlob-enhancing-trading-strategies-by","slug":"clusterlob-enhancing-trading-strategies-by","title":"ClusterLOB: Enhancing Trading Strategies by Clustering Orders in Limit Order Books","date":"2025-04-29","arxiv_id":"2504.20349","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-price-of-differential-privacy-for","slug":"on-the-price-of-differential-privacy-for","title":"On the Price of Differential Privacy for Hierarchical Clustering","date":"2025-04-22","arxiv_id":"2504.15580","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/on-the-price-of-differential-privacy-for#ran","syntology_url":"https://syntology.ai/paper/2504.15580","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.15580"}},"official":{"repos":["margarita-aicyd/dp-hc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/generalized-probabilistic-canonical","slug":"generalized-probabilistic-canonical","title":"Generalized probabilistic canonical correlation analysis for multi-modal data integration with full or partial observations","date":"2025-04-15","arxiv_id":"2504.11610","repositories_listed":1,"syntology":null},{"url":"/paper/flexibility-of-german-gas-fired-generation","slug":"flexibility-of-german-gas-fired-generation","title":"Flexibility of German gas-fired generation: evidence from clustering empirical operation","date":"2025-04-14","arxiv_id":"2504.16943","repositories_listed":1,"syntology":null},{"url":"/paper/pact-pruning-and-clustering-based-token","slug":"pact-pruning-and-clustering-based-token","title":"PACT: Pruning and Clustering-Based Token Reduction for Faster Visual Language Models","date":"2025-04-11","arxiv_id":"2504.08966","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":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) · 1 unverified","sample_list":"/paper/pact-pruning-and-clustering-based-token#ran","syntology_url":"https://syntology.ai/paper/2504.08966","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.08966"}},"official":{"repos":["orailix/pact"],"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/slicing-the-gaussian-mixture-wasserstein","slug":"slicing-the-gaussian-mixture-wasserstein","title":"Slicing the Gaussian Mixture Wasserstein Distance","date":"2025-04-11","arxiv_id":"2504.08544","repositories_listed":1,"syntology":null},{"url":"/paper/a-scalable-approach-to-clustering-embedding","slug":"a-scalable-approach-to-clustering-embedding","title":"A Scalable Approach to Clustering Embedding Projections","date":"2025-04-09","arxiv_id":"2504.07285","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-dynamic-clustering-based-document","slug":"efficient-dynamic-clustering-based-document","title":"Efficient Dynamic Clustering-Based Document Compression for Retrieval-Augmented-Generation","date":"2025-04-04","arxiv_id":"2504.03165","repositories_listed":1,"syntology":null},{"url":"/paper/bi-level-multi-view-fuzzy-clustering-with","slug":"bi-level-multi-view-fuzzy-clustering-with","title":"Bi-Level Multi-View fuzzy Clustering with Exponential Distance","date":"2025-03-29","arxiv_id":"2503.22932","repositories_listed":1,"syntology":null},{"url":"/paper/fuzzy-cluster-aware-contrastive-clustering","slug":"fuzzy-cluster-aware-contrastive-clustering","title":"Fuzzy Cluster-Aware Contrastive Clustering for Time Series","date":"2025-03-28","arxiv_id":"2503.22211","repositories_listed":1,"syntology":null},{"url":"/paper/nearest-neighbour-equilibrium-clustering","slug":"nearest-neighbour-equilibrium-clustering","title":"Nearest Neighbour Equilibrium Clustering","date":"2025-03-27","arxiv_id":"2503.21431","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-local-clustering-over-attributed","slug":"adaptive-local-clustering-over-attributed","title":"Adaptive Local Clustering over Attributed Graphs","date":"2025-03-26","arxiv_id":"2503.20488","repositories_listed":1,"syntology":null},{"url":"/paper/ontology-based-semantic-similarity-measures","slug":"ontology-based-semantic-similarity-measures","title":"Ontology-based Semantic Similarity Measures for Clustering Medical Concepts in Drug Safety","date":"2025-03-26","arxiv_id":"2503.20737","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-a-principled-framework-for-deep-1","slug":"exploring-a-principled-framework-for-deep-1","title":"Exploring a Principled Framework for Deep Subspace Clustering","date":"2025-03-21","arxiv_id":"2503.17288","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":1,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 1 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/exploring-a-principled-framework-for-deep-1#ran","syntology_url":"https://syntology.ai/paper/2503.17288","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.17288"}},"official":{"repos":["mengxianghan123/PRO-DSC"],"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":["found_in_text","official"]}}},{"url":"/paper/hierarchical-clustering-with-maximum-density","slug":"hierarchical-clustering-with-maximum-density","title":"Hierarchical clustering with maximum density paths and mixture models","date":"2025-03-19","arxiv_id":"2503.15582","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-clustering-behavior-of-sliding-windows","slug":"on-the-clustering-behavior-of-sliding-windows","title":"On the clustering behavior of sliding windows","date":"2025-03-18","arxiv_id":"2503.14393","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-thousands-of-human-annotators-for","slug":"modeling-thousands-of-human-annotators-for","title":"Modeling Thousands of Human Annotators for Generalizable Text-to-Image Person Re-identification","date":"2025-03-13","arxiv_id":"2503.09962","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-by-nonparametric-smoothing","slug":"clustering-by-nonparametric-smoothing","title":"Clustering by Nonparametric Smoothing","date":"2025-03-12","arxiv_id":"2503.09134","repositories_listed":1,"syntology":null},{"url":"/paper/neural-normalized-cut-a-differential-and","slug":"neural-normalized-cut-a-differential-and","title":"Neural Normalized Cut: A Differential and Generalizable Approach for Spectral Clustering","date":"2025-03-12","arxiv_id":"2503.09260","repositories_listed":1,"syntology":null},{"url":"/paper/coreset-spectral-clustering","slug":"coreset-spectral-clustering","title":"Coreset Spectral Clustering","date":"2025-03-10","arxiv_id":"2503.07227","repositories_listed":1,"syntology":null},{"url":"/paper/deepnuparc-a-novel-deep-clustering-framework","slug":"deepnuparc-a-novel-deep-clustering-framework","title":"DeepNuParc: A Novel Deep Clustering Framework for Fine-scale Parcellation of Brain Nuclei Using Diffusion MRI Tractography","date":"2025-03-10","arxiv_id":"2503.07263","repositories_listed":1,"syntology":null},{"url":"/paper/off-clip-improving-normal-detection","slug":"off-clip-improving-normal-detection","title":"OFF-CLIP: Improving Normal Detection Confidence in Radiology CLIP with Simple Off-Diagonal Term Auto-Adjustment","date":"2025-03-03","arxiv_id":"2503.01794","repositories_listed":1,"syntology":null},{"url":"/paper/facroc-a-fairness-measure-for-fair-clustering","slug":"facroc-a-fairness-measure-for-fair-clustering","title":"FACROC: a fairness measure for FAir Clustering through ROC curves","date":"2025-03-02","arxiv_id":"2503.00854","repositories_listed":1,"syntology":null},{"url":"/paper/mirror-multi-modal-pathological-self","slug":"mirror-multi-modal-pathological-self","title":"MIRROR: Multi-Modal Pathological Self-Supervised Representation Learning via Modality Alignment and Retention","date":"2025-03-01","arxiv_id":"2503.00374","repositories_listed":1,"syntology":null},{"url":"/paper/flexible-bivariate-beta-mixture-model-a","slug":"flexible-bivariate-beta-mixture-model-a","title":"Flexible Bivariate Beta Mixture Model: A Probabilistic Approach for Clustering Complex Data Structures","date":"2025-02-27","arxiv_id":"2502.19938","repositories_listed":1,"syntology":null},{"url":"/paper/tight-clusters-make-specialized-experts","slug":"tight-clusters-make-specialized-experts","title":"Tight Clusters Make Specialized Experts","date":"2025-02-21","arxiv_id":"2502.15315","repositories_listed":1,"syntology":null},{"url":"/paper/preordering-a-hybrid-of-correlation","slug":"preordering-a-hybrid-of-correlation","title":"Preordering: A hybrid of correlation clustering and partial ordering","date":"2025-02-20","arxiv_id":"2502.14536","repositories_listed":1,"syntology":null},{"url":"/paper/edge-colored-clustering-in-hypergraphs-beyond","slug":"edge-colored-clustering-in-hypergraphs-beyond","title":"Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges","date":"2025-02-18","arxiv_id":"2502.13000","repositories_listed":1,"syntology":null},{"url":"/paper/k-graph-a-graph-embedding-for-interpretable","slug":"k-graph-a-graph-embedding-for-interpretable","title":"$k$-Graph: A Graph Embedding for Interpretable Time Series Clustering","date":"2025-02-18","arxiv_id":"2502.13049","repositories_listed":1,"syntology":null},{"url":"/paper/urinary-tract-infection-detection-in-digital","slug":"urinary-tract-infection-detection-in-digital","title":"Urinary Tract Infection Detection in Digital Remote Monitoring: Strategies for Managing Participant-Specific Prediction Complexity","date":"2025-02-18","arxiv_id":"2502.17484","repositories_listed":1,"syntology":null},{"url":"/paper/weighted-quantization-using-mmd-from-mean","slug":"weighted-quantization-using-mmd-from-mean","title":"Weighted quantization using MMD: From mean field to mean shift via gradient flows","date":"2025-02-14","arxiv_id":"2502.10600","repositories_listed":1,"syntology":null},{"url":"/paper/prior-constrained-association-learning-for","slug":"prior-constrained-association-learning-for","title":"Prior-Constrained Association Learning for Fine-Grained Generalized Category Discovery","date":"2025-02-13","arxiv_id":"2502.09501","repositories_listed":1,"syntology":null},{"url":"/paper/strong-bounds-for-large-scale-minimum-sum-of","slug":"strong-bounds-for-large-scale-minimum-sum-of","title":"Strong bounds for large-scale Minimum Sum-of-Squares Clustering","date":"2025-02-12","arxiv_id":"2502.08397","repositories_listed":1,"syntology":null}],"record_sha256":"784b7a70f7095eb7cbfe4c8c1fad00bb9110abdff9829a50708849fcd64bc33b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}