{"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/6","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":6,"pages_in_order":108,"rows_per_page":100,"rows":[501,600],"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/5","next":"/task/clustering/papers/7","papers":[{"url":"/paper/a-flag-decomposition-for-hierarchical","slug":"a-flag-decomposition-for-hierarchical","title":"A Flag Decomposition for Hierarchical Datasets","date":"2025-02-11","arxiv_id":"2502.07782","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/a-flag-decomposition-for-hierarchical#ran","syntology_url":"https://syntology.ai/paper/2502.07782","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.07782"}},"official":{"repos":["nmank/FD"],"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/evclust-python-library-for-evidential","slug":"evclust-python-library-for-evidential","title":"evclust: Python library for evidential clustering","date":"2025-02-10","arxiv_id":"2502.06587","repositories_listed":1,"syntology":null},{"url":"/paper/learning-clustering-based-prototypes-for","slug":"learning-clustering-based-prototypes-for","title":"Learning Clustering-based Prototypes for Compositional Zero-shot Learning","date":"2025-02-10","arxiv_id":"2502.06501","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":3,"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/learning-clustering-based-prototypes-for#ran","syntology_url":"https://syntology.ai/paper/2502.06501","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.06501"}},"official":{"repos":["quhongyu/cluspro"],"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/mask-informed-deep-contrastive-incomplete","slug":"mask-informed-deep-contrastive-incomplete","title":"Mask-informed Deep Contrastive Incomplete Multi-view Clustering","date":"2025-02-04","arxiv_id":"2502.02234","repositories_listed":1,"syntology":null},{"url":"/paper/cycleguardian-a-framework-for-automatic","slug":"cycleguardian-a-framework-for-automatic","title":"CycleGuardian: A Framework for Automatic RespiratorySound classification Based on Improved Deep clustering and Contrastive Learning","date":"2025-02-02","arxiv_id":"2502.00734","repositories_listed":1,"syntology":null},{"url":"/paper/deep-clustering-via-probabilistic-ratio-cut","slug":"deep-clustering-via-probabilistic-ratio-cut","title":"Deep Clustering via Probabilistic Ratio-Cut Optimization","date":"2025-02-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/dbscan-in-domains-with-periodic-boundary","slug":"dbscan-in-domains-with-periodic-boundary","title":"DBSCAN in domains with periodic boundary conditions","date":"2025-01-28","arxiv_id":"2501.16894","repositories_listed":1,"syntology":null},{"url":"/paper/reliable-pseudo-labeling-via-optimal","slug":"reliable-pseudo-labeling-via-optimal","title":"Reliable Pseudo-labeling via Optimal Transport with Attention for Short Text Clustering","date":"2025-01-25","arxiv_id":"2501.15194","repositories_listed":1,"syntology":null},{"url":"/paper/guaranteed-recovery-of-unambiguous-clusters","slug":"guaranteed-recovery-of-unambiguous-clusters","title":"Guaranteed Recovery of Unambiguous Clusters","date":"2025-01-22","arxiv_id":"2501.13093","repositories_listed":1,"syntology":null},{"url":"/paper/on-accelerating-deep-neural-network-mutation","slug":"on-accelerating-deep-neural-network-mutation","title":"On Accelerating Deep Neural Network Mutation Analysis by Neuron and Mutant Clustering","date":"2025-01-22","arxiv_id":"2501.12598","repositories_listed":1,"syntology":null},{"url":"/paper/timefilter-patch-specific-spatial-temporal","slug":"timefilter-patch-specific-spatial-temporal","title":"TimeFilter: Patch-Specific Spatial-Temporal Graph Filtration for Time Series Forecasting","date":"2025-01-22","arxiv_id":"2501.13041","repositories_listed":1,"syntology":null},{"url":"/paper/multi-view-spectral-clustering-for-graphs","slug":"multi-view-spectral-clustering-for-graphs","title":"Multi-View Spectral Clustering for Graphs with Multiple View Structures","date":"2025-01-20","arxiv_id":"2501.11422","repositories_listed":1,"syntology":null},{"url":"/paper/on-learning-informative-trajectory-embeddings","slug":"on-learning-informative-trajectory-embeddings","title":"On Learning Informative Trajectory Embeddings for Imitation, Classification and Regression","date":"2025-01-16","arxiv_id":"2501.09327","repositories_listed":1,"syntology":null},{"url":"/paper/improving-the-efficiency-of-self-supervised","slug":"improving-the-efficiency-of-self-supervised","title":"Improving the Efficiency of Self-Supervised Adversarial Training through Latent Clustering-Based Selection","date":"2025-01-15","arxiv_id":"2501.10466","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":1,"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/improving-the-efficiency-of-self-supervised#ran","syntology_url":"https://syntology.ai/paper/2501.10466","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.10466"}},"official":{"repos":["somrita99/SSATwithLCS"],"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":["found_in_text","official"]}}},{"url":"/paper/discrete-speech-unit-extraction-via","slug":"discrete-speech-unit-extraction-via","title":"Discrete Speech Unit Extraction via Independent Component Analysis","date":"2025-01-11","arxiv_id":"2501.06562","repositories_listed":1,"syntology":null},{"url":"/paper/discriminative-representation-learning-via","slug":"discriminative-representation-learning-via","title":"Discriminative Representation learning via Attention-Enhanced Contrastive Learning for Short Text Clustering","date":"2025-01-07","arxiv_id":"2501.03584","repositories_listed":1,"syntology":null},{"url":"/paper/balanced-multi-view-clustering","slug":"balanced-multi-view-clustering","title":"Balanced Multi-view Clustering","date":"2025-01-05","arxiv_id":"2501.02564","repositories_listed":1,"syntology":null},{"url":"/paper/merging-context-clustering-with-visual-state","slug":"merging-context-clustering-with-visual-state","title":"Merging Context Clustering with Visual State Space Models for Medical Image Segmentation","date":"2025-01-03","arxiv_id":"2501.01618","repositories_listed":1,"syntology":null},{"url":"/paper/risk-forecasting-using-long-short-term-memory","slug":"risk-forecasting-using-long-short-term-memory","title":"Risk forecasting using Long Short-Term Memory Mixture Density Networks","date":"2025-01-02","arxiv_id":"2501.01278","repositories_listed":1,"syntology":null},{"url":"/paper/a-hubness-perspective-on-representation","slug":"a-hubness-perspective-on-representation","title":"A Hubness Perspective on Representation Learning for Graph-Based Multi-View Clustering","date":"2025-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/task-aware-clustering-for-prompting-vision","slug":"task-aware-clustering-for-prompting-vision","title":"Task-Aware Clustering for Prompting Vision-Language Models","date":"2025-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/unveiling-differences-in-generative-models-a","slug":"unveiling-differences-in-generative-models-a","title":"Unveiling Differences in Generative Models: A Scalable Differential Clustering Approach","date":"2025-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/asynchronous-federated-clustering-with","slug":"asynchronous-federated-clustering-with","title":"Asynchronous Federated Clustering with Unknown Number of Clusters","date":"2024-12-29","arxiv_id":"2412.20341","repositories_listed":1,"syntology":null},{"url":"/paper/graph-cut-guided-maximal-coding-rate","slug":"graph-cut-guided-maximal-coding-rate","title":"Graph Cut-guided Maximal Coding Rate Reduction for Learning Image Embedding and Clustering","date":"2024-12-25","arxiv_id":"2412.18930","repositories_listed":1,"syntology":null},{"url":"/paper/tpch-tensor-interacted-projection-and","slug":"tpch-tensor-interacted-projection-and","title":"TPCH: Tensor-interacted Projection and Cooperative Hashing for Multi-view Clustering","date":"2024-12-25","arxiv_id":"2412.18847","repositories_listed":1,"syntology":null},{"url":"/paper/graphhash-graph-clustering-enables-parameter","slug":"graphhash-graph-clustering-enables-parameter","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","date":"2024-12-23","arxiv_id":"2412.17245","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-vector-quantization-for","slug":"hierarchical-vector-quantization-for","title":"Hierarchical Vector Quantization for Unsupervised Action Segmentation","date":"2024-12-23","arxiv_id":"2412.17640","repositories_listed":1,"syntology":null},{"url":"/paper/anchor-learning-with-potential-cluster","slug":"anchor-learning-with-potential-cluster","title":"Anchor Learning with Potential Cluster Constraints for Multi-view Clustering","date":"2024-12-21","arxiv_id":"2412.16519","repositories_listed":1,"syntology":null},{"url":"/paper/trusted-mamba-contrastive-network-for-multi","slug":"trusted-mamba-contrastive-network-for-multi","title":"Trusted Mamba Contrastive Network for Multi-View Clustering","date":"2024-12-21","arxiv_id":"2412.16487","repositories_listed":1,"syntology":null},{"url":"/paper/spatial-clustering-of-citizen-science-data","slug":"spatial-clustering-of-citizen-science-data","title":"Spatial Clustering of Citizen Science Data Improves Downstream Species Distribution Models","date":"2024-12-20","arxiv_id":"2412.15559","repositories_listed":1,"syntology":null},{"url":"/paper/clustertalk-corpus-exploration-framework","slug":"clustertalk-corpus-exploration-framework","title":"ClusterTalk: Corpus Exploration Framework using Multi-Dimensional Exploratory Search","date":"2024-12-19","arxiv_id":"2412.14533","repositories_listed":1,"syntology":null},{"url":"/paper/log-time-k-means-clustering-for-1d-data-novel","slug":"log-time-k-means-clustering-for-1d-data-novel","title":"Log-Time K-Means Clustering for 1D Data: Novel Approaches with Proof and Implementation","date":"2024-12-19","arxiv_id":"2412.15295","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/log-time-k-means-clustering-for-1d-data-novel#ran","syntology_url":"https://syntology.ai/paper/2412.15295","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.15295"}},"official":{"repos":["SyphonArch/flash1dkmeans"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/information-theoretic-generative-clustering","slug":"information-theoretic-generative-clustering","title":"Information-Theoretic Generative Clustering of Documents","date":"2024-12-18","arxiv_id":"2412.13534","repositories_listed":1,"syntology":null},{"url":"/paper/pasco-parallel-structured-coarsening-an","slug":"pasco-parallel-structured-coarsening-an","title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","date":"2024-12-18","arxiv_id":"2412.13592","repositories_listed":1,"syntology":null},{"url":"/paper/personalized-clustering-via-targeted","slug":"personalized-clustering-via-targeted","title":"Personalized Clustering via Targeted Representation Learning","date":"2024-12-18","arxiv_id":"2412.13690","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":4,"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/personalized-clustering-via-targeted#ran","syntology_url":"https://syntology.ai/paper/2412.13690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.13690"}},"official":{"repos":["hhdxwen/pcl"],"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/clustem4ano-clustering-text-embeddings-of","slug":"clustem4ano-clustering-text-embeddings-of","title":"ClustEm4Ano: Clustering Text Embeddings of Nominal Textual Attributes for Microdata Anonymization","date":"2024-12-17","arxiv_id":"2412.12649","repositories_listed":1,"syntology":null},{"url":"/paper/refining-dimensions-for-improving-clustering","slug":"refining-dimensions-for-improving-clustering","title":"Refining Dimensions for Improving Clustering-based Cross-lingual Topic Models","date":"2024-12-17","arxiv_id":"2412.12433","repositories_listed":1,"syntology":null},{"url":"/paper/an-incremental-clustering-baseline-for-event","slug":"an-incremental-clustering-baseline-for-event","title":"An Incremental Clustering Baseline for Event Detection on Twitter","date":"2024-12-16","arxiv_id":"2412.15257","repositories_listed":1,"syntology":null},{"url":"/paper/deep-spectral-clustering-via-joint-spectral","slug":"deep-spectral-clustering-via-joint-spectral","title":"Deep Spectral Clustering via Joint Spectral Embedding and Kmeans","date":"2024-12-15","arxiv_id":"2412.11080","repositories_listed":1,"syntology":null},{"url":"/paper/one-node-one-model-featuring-the-missing-half","slug":"one-node-one-model-featuring-the-missing-half","title":"One Node One Model: Featuring the Missing-Half for Graph Clustering","date":"2024-12-13","arxiv_id":"2412.09902","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":7,"phrase":"4 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/one-node-one-model-featuring-the-missing-half#ran","syntology_url":"https://syntology.ai/paper/2412.09902","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.09902"}},"official":{"repos":["xiexuanting/fpgc"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/sims-an-interactive-tool-for-geospatial","slug":"sims-an-interactive-tool-for-geospatial","title":"Sims: An Interactive Tool for Geospatial Matching and Clustering","date":"2024-12-13","arxiv_id":"2412.10184","repositories_listed":1,"syntology":null},{"url":"/paper/k-hyperedge-medoids-for-clustering-ensemble","slug":"k-hyperedge-medoids-for-clustering-ensemble","title":"k-HyperEdge Medoids for Clustering Ensemble","date":"2024-12-11","arxiv_id":"2412.08289","repositories_listed":1,"syntology":null},{"url":"/paper/learning-cluster-representatives-for","slug":"learning-cluster-representatives-for","title":"Learning Cluster Representatives for Approximate Nearest Neighbor Search","date":"2024-12-08","arxiv_id":"2412.05921","repositories_listed":1,"syntology":null},{"url":"/paper/learnable-similarity-and-dissimilarity-guided","slug":"learnable-similarity-and-dissimilarity-guided","title":"Learnable Similarity and Dissimilarity Guided Symmetric Non-Negative Matrix Factorization","date":"2024-12-05","arxiv_id":"2412.04082","repositories_listed":1,"syntology":null},{"url":"/paper/grapix-exploring-graph-modularity","slug":"grapix-exploring-graph-modularity","title":"GraPix: Exploring Graph Modularity Optimization for Unsupervised Pixel Clustering","date":"2024-12-04","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/provably-extending-pagerank-based-local","slug":"provably-extending-pagerank-based-local","title":"Provably Extending PageRank-based Local Clustering Algorithm to Weighted Directed Graphs with Self-Loops and to Hypergraphs","date":"2024-12-04","arxiv_id":"2412.03008","repositories_listed":1,"syntology":null},{"url":"/paper/i-spy-with-my-little-eye-a-minimum-cost","slug":"i-spy-with-my-little-eye-a-minimum-cost","title":"I Spy With My Little Eye: A Minimum Cost Multicut Investigation of Dataset Frames","date":"2024-12-02","arxiv_id":"2412.01296","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-self-supervised-heterogeneous","slug":"revisiting-self-supervised-heterogeneous","title":"Revisiting Self-Supervised Heterogeneous Graph Learning from Spectral Clustering Perspective","date":"2024-12-01","arxiv_id":"2412.00742","repositories_listed":1,"syntology":null},{"url":"/paper/bootstraping-clustering-of-gaussians-for-view","slug":"bootstraping-clustering-of-gaussians-for-view","title":"Bootstraping Clustering of Gaussians for View-consistent 3D Scene Understanding","date":"2024-11-29","arxiv_id":"2411.19551","repositories_listed":1,"syntology":{"n":12,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":9,"n_pointer_only":12,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 2 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bootstraping-clustering-of-gaussians-for-view#ran","syntology_url":"https://syntology.ai/paper/2411.19551","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.19551"}},"official":{"repos":["wb014/FreeGS"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/spatial-clustering-of-molecular-localizations","slug":"spatial-clustering-of-molecular-localizations","title":"Spatial Clustering of Molecular Localizations with Graph Neural Networks","date":"2024-11-29","arxiv_id":"2412.00173","repositories_listed":1,"syntology":null},{"url":"/paper/graph-max-shift-a-hill-climbing-method-for","slug":"graph-max-shift-a-hill-climbing-method-for","title":"Graph Max Shift: A Hill-Climbing Method for Graph Clustering","date":"2024-11-27","arxiv_id":"2411.18794","repositories_listed":1,"syntology":null},{"url":"/paper/dwcl-dual-weighted-contrastive-learning-for","slug":"dwcl-dual-weighted-contrastive-learning-for","title":"DWCL: Dual-Weighted Contrastive Learning for Multi-View Clustering","date":"2024-11-26","arxiv_id":"2411.17354","repositories_listed":1,"syntology":null},{"url":"/paper/online-high-frequency-trading-stock","slug":"online-high-frequency-trading-stock","title":"Online High-Frequency Trading Stock Forecasting with Automated Feature Clustering and Radial Basis Function Neural Networks","date":"2024-11-23","arxiv_id":"2412.16160","repositories_listed":1,"syntology":null},{"url":"/paper/data-pruning-in-generative-diffusion-models","slug":"data-pruning-in-generative-diffusion-models","title":"Data Pruning in Generative Diffusion Models","date":"2024-11-19","arxiv_id":"2411.12523","repositories_listed":1,"syntology":null},{"url":"/paper/spectral-subspace-clustering-for-attributed","slug":"spectral-subspace-clustering-for-attributed","title":"Spectral Subspace Clustering for Attributed Graphs","date":"2024-11-17","arxiv_id":"2411.11074","repositories_listed":1,"syntology":null},{"url":"/paper/fast-disentangled-slim-tensor-learning-for","slug":"fast-disentangled-slim-tensor-learning-for","title":"Fast Disentangled Slim Tensor Learning for Multi-view Clustering","date":"2024-11-12","arxiv_id":"2411.07685","repositories_listed":1,"syntology":null},{"url":"/paper/fitting-multiple-machine-learning-models-with","slug":"fitting-multiple-machine-learning-models-with","title":"Fitting Multiple Machine Learning Models with Performance Based Clustering","date":"2024-11-10","arxiv_id":"2411.06572","repositories_listed":1,"syntology":null},{"url":"/paper/clustergraph-a-new-tool-for-visualization-and","slug":"clustergraph-a-new-tool-for-visualization-and","title":"ClusterGraph: a new tool for visualization and compression of multidimensional data","date":"2024-11-08","arxiv_id":"2411.05443","repositories_listed":1,"syntology":null},{"url":"/paper/navigating-trade-offs-policy-summarization","slug":"navigating-trade-offs-policy-summarization","title":"Navigating Trade-offs: Policy Summarization for Multi-Objective Reinforcement Learning","date":"2024-11-07","arxiv_id":"2411.04784","repositories_listed":1,"syntology":null},{"url":"/paper/customized-multiple-clustering-via-multi","slug":"customized-multiple-clustering-via-multi","title":"Customized Multiple Clustering via Multi-Modal Subspace Proxy Learning","date":"2024-11-06","arxiv_id":"2411.03978","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"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) · 2 unverified","sample_list":"/paper/customized-multiple-clustering-via-multi#ran","syntology_url":"https://syntology.ai/paper/2411.03978","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.03978"}},"official":{"repos":["alexander-yao/multi-sub"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/breaking-the-reclustering-barrier-in-centroid","slug":"breaking-the-reclustering-barrier-in-centroid","title":"Breaking the Reclustering Barrier in Centroid-based Deep Clustering","date":"2024-11-04","arxiv_id":"2411.02275","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/breaking-the-reclustering-barrier-in-centroid#ran","syntology_url":"https://syntology.ai/paper/2411.02275","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.02275"}},"official":{"repos":["probabilistic-and-interactive-ml/breaking-the-reclustering-barrier"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/unsegmedgat-unsupervised-medical-image","slug":"unsegmedgat-unsupervised-medical-image","title":"UnSegMedGAT: Unsupervised Medical Image Segmentation using Graph Attention Networks Clustering","date":"2024-11-04","arxiv_id":"2411.01966","repositories_listed":1,"syntology":null},{"url":"/paper/co-clustering-for-federated-recommender","slug":"co-clustering-for-federated-recommender","title":"Co-clustering for Federated Recommender System","date":"2024-11-03","arxiv_id":"2411.01690","repositories_listed":1,"syntology":null},{"url":"/paper/similarity-and-dissimilarity-guided-co","slug":"similarity-and-dissimilarity-guided-co","title":"Similarity and Dissimilarity Guided Co-association Matrix Construction for Ensemble Clustering","date":"2024-11-01","arxiv_id":"2411.00904","repositories_listed":1,"syntology":null},{"url":"/paper/a-dual-adaptive-assignment-approach-for","slug":"a-dual-adaptive-assignment-approach-for","title":"RDSA: A Robust Deep Graph Clustering Framework via Dual Soft Assignment","date":"2024-10-29","arxiv_id":"2410.21745","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-transfer-clustering-a-unified","slug":"adaptive-transfer-clustering-a-unified","title":"Adaptive Transfer Clustering: A Unified Framework","date":"2024-10-28","arxiv_id":"2410.21263","repositories_listed":1,"syntology":null},{"url":"/paper/robust-variational-contrastive-learning-for","slug":"robust-variational-contrastive-learning-for","title":"Robust Variational Contrastive Learning for Partially View-unaligned Clustering","date":"2024-10-28","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/pseudo-label-enhanced-prototypical","slug":"pseudo-label-enhanced-prototypical","title":"Pseudo-Label Enhanced Prototypical Contrastive Learning for Uniformed Intent Discovery","date":"2024-10-26","arxiv_id":"2410.20219","repositories_listed":1,"syntology":null},{"url":"/paper/classifier-clustering-and-feature-alignment","slug":"classifier-clustering-and-feature-alignment","title":"Classifier Clustering and Feature Alignment for Federated Learning under Distributed Concept Drift","date":"2024-10-24","arxiv_id":"2410.18478","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-clustering-for-conditional","slug":"hierarchical-clustering-for-conditional","title":"Hierarchical Clustering for Conditional Diffusion in Image Generation","date":"2024-10-22","arxiv_id":"2410.16910","repositories_listed":1,"syntology":null},{"url":"/paper/upsampling-dinov2-features-for-unsupervised","slug":"upsampling-dinov2-features-for-unsupervised","title":"Upsampling DINOv2 features for unsupervised vision tasks and weakly supervised materials segmentation","date":"2024-10-20","arxiv_id":"2410.19836","repositories_listed":1,"syntology":null},{"url":"/paper/a-semidefinite-relaxation-approach-for-fair","slug":"a-semidefinite-relaxation-approach-for-fair","title":"A Semidefinite Relaxation Approach for Fair Graph Clustering","date":"2024-10-19","arxiv_id":"2410.15233","repositories_listed":1,"syntology":null},{"url":"/paper/byocl-build-your-own-consistent-latent-with","slug":"byocl-build-your-own-consistent-latent-with","title":"BYOCL: Build Your Own Consistent Latent with Hierarchical Representative Latent Clustering","date":"2024-10-19","arxiv_id":"2410.15060","repositories_listed":1,"syntology":null},{"url":"/paper/tabseq-a-framework-for-deep-learning-on","slug":"tabseq-a-framework-for-deep-learning-on","title":"TabSeq: A Framework for Deep Learning on Tabular Data via Sequential Ordering","date":"2024-10-17","arxiv_id":"2410.13203","repositories_listed":1,"syntology":null},{"url":"/paper/bridging-gaps-federated-multi-view-clustering","slug":"bridging-gaps-federated-multi-view-clustering","title":"Bridging Gaps: Federated Multi-View Clustering in Heterogeneous Hybrid Views","date":"2024-10-12","arxiv_id":"2410.09484","repositories_listed":1,"syntology":null},{"url":"/paper/dying-clusters-is-all-you-need-deep","slug":"dying-clusters-is-all-you-need-deep","title":"Dying Clusters Is All You Need -- Deep Clustering With an Unknown Number of Clusters","date":"2024-10-12","arxiv_id":"2410.09491","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-affinity-propagation-for-improved","slug":"enhancing-affinity-propagation-for-improved","title":"Enhancing Affinity Propagation for Improved Public Sentiment Insights","date":"2024-10-12","arxiv_id":"2410.12862","repositories_listed":1,"syntology":null},{"url":"/paper/retraining-free-merging-of-sparse-mixture-of","slug":"retraining-free-merging-of-sparse-mixture-of","title":"Retraining-Free Merging of Sparse MoE via Hierarchical Clustering","date":"2024-10-11","arxiv_id":"2410.08589","repositories_listed":1,"syntology":{"n":22,"n_ran":15,"n_constructed":0,"n_ran_checked":8,"n_instrument":7,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 7 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/retraining-free-merging-of-sparse-mixture-of#ran","syntology_url":"https://syntology.ai/paper/2410.08589","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.08589"}},"official":{"repos":["wazenmai/hc-smoe"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/a-column-generation-algorithm-with-dynamic","slug":"a-column-generation-algorithm-with-dynamic","title":"A column generation algorithm with dynamic constraint aggregation for minimum sum-of-squares clustering","date":"2024-10-08","arxiv_id":"2410.06187","repositories_listed":1,"syntology":null},{"url":"/paper/syllablelm-learning-coarse-semantic-units-for","slug":"syllablelm-learning-coarse-semantic-units-for","title":"SyllableLM: Learning Coarse Semantic Units for Speech Language Models","date":"2024-10-05","arxiv_id":"2410.04029","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":3,"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/syllablelm-learning-coarse-semantic-units-for#ran","syntology_url":"https://syntology.ai/paper/2410.04029","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.04029"}},"official":{"repos":["alanbaade/SyllableLM"],"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/clustering-alzheimer-s-disease-subtypes-via","slug":"clustering-alzheimer-s-disease-subtypes-via","title":"Clustering Alzheimer's Disease Subtypes via Similarity Learning and Graph Diffusion","date":"2024-10-04","arxiv_id":"2410.03937","repositories_listed":1,"syntology":null},{"url":"/paper/automated-tone-transcription-and-clustering","slug":"automated-tone-transcription-and-clustering","title":"Automated Tone Transcription and Clustering with Tone2Vec","date":"2024-10-03","arxiv_id":"2410.02324","repositories_listed":1,"syntology":null},{"url":"/paper/cross-camera-data-association-via-gnn-for","slug":"cross-camera-data-association-via-gnn-for","title":"Cross-Camera Data Association via GNN for Supervised Graph Clustering","date":"2024-10-01","arxiv_id":"2410.00643","repositories_listed":1,"syntology":null},{"url":"/paper/erasmo-leveraging-large-language-models-for","slug":"erasmo-leveraging-large-language-models-for","title":"ERASMO: Leveraging Large Language Models for Enhanced Clustering Segmentation","date":"2024-10-01","arxiv_id":"2410.03738","repositories_listed":1,"syntology":null},{"url":"/paper/text-clustering-as-classification-with-llms","slug":"text-clustering-as-classification-with-llms","title":"Text Clustering as Classification with LLMs","date":"2024-09-30","arxiv_id":"2410.00927","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/text-clustering-as-classification-with-llms#ran","syntology_url":"https://syntology.ai/paper/2410.00927","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.00927"}},"official":{"repos":["ecnu-text-computing/text-clustering-via-llm"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bach-a-tool-for-analyzing-blockchain","slug":"bach-a-tool-for-analyzing-blockchain","title":"BACH: A Tool for Analyzing Blockchain Transactions Using Address Clustering Heuristics","date":"2024-09-26","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/stylesinger-2-zero-shot-singing-voice","slug":"stylesinger-2-zero-shot-singing-voice","title":"TCSinger: Zero-Shot Singing Voice Synthesis with Style Transfer and Multi-Level Style Control","date":"2024-09-24","arxiv_id":"2409.15977","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-syllable-discovery-based-on","slug":"self-supervised-syllable-discovery-based-on","title":"Self-Supervised Syllable Discovery Based on Speaker-Disentangled HuBERT","date":"2024-09-16","arxiv_id":"2409.10103","repositories_listed":1,"syntology":null},{"url":"/paper/self-tuning-spectral-clustering-for-speaker","slug":"self-tuning-spectral-clustering-for-speaker","title":"Self-Tuning Spectral Clustering for Speaker Diarization","date":"2024-09-16","arxiv_id":"2410.00023","repositories_listed":1,"syntology":null},{"url":"/paper/tpfl-tsetlin-personalized-federated-learning","slug":"tpfl-tsetlin-personalized-federated-learning","title":"TPFL: Tsetlin-Personalized Federated Learning with Confidence-Based Clustering","date":"2024-09-16","arxiv_id":"2409.10392","repositories_listed":1,"syntology":null},{"url":"/paper/explaining-datasets-in-words-statistical","slug":"explaining-datasets-in-words-statistical","title":"Explaining Datasets in Words: Statistical Models with Natural Language Parameters","date":"2024-09-13","arxiv_id":"2409.08466","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-novel-class-discovery-for-single","slug":"hierarchical-novel-class-discovery-for-single","title":"Hierarchical novel class discovery for single-cell transcriptomic profiles","date":"2024-09-09","arxiv_id":"2409.05937","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-sparse-representation-clustering","slug":"hierarchical-sparse-representation-clustering","title":"Hierarchical Sparse Representation Clustering for High-Dimensional Data Streams","date":"2024-09-07","arxiv_id":"2409.04698","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-adaptive-normalization","slug":"unsupervised-adaptive-normalization","title":"Unsupervised Adaptive Normalization","date":"2024-09-07","arxiv_id":"2409.04757","repositories_listed":1,"syntology":null},{"url":"/paper/dual-level-cross-modal-contrastive-clustering","slug":"dual-level-cross-modal-contrastive-clustering","title":"Dual-Level Cross-Modal Contrastive Clustering","date":"2024-09-06","arxiv_id":"2409.04561","repositories_listed":1,"syntology":null},{"url":"/paper/diffusion-models-learn-low-dimensional","slug":"diffusion-models-learn-low-dimensional","title":"Diffusion Models Learn Low-Dimensional Distributions via Subspace Clustering","date":"2024-09-04","arxiv_id":"2409.02426","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/diffusion-models-learn-low-dimensional#ran","syntology_url":"https://syntology.ai/paper/2409.02426","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.02426"}},"official":{"repos":["huijieZH/Diffusion-Model-Generalizability"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/how-dreams-are-made-emulating-satellite","slug":"how-dreams-are-made-emulating-satellite","title":"How DREAMS are made: Emulating Satellite Galaxy and Subhalo Populations with Diffusion Models and Point Clouds","date":"2024-09-04","arxiv_id":"2409.02980","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/how-dreams-are-made-emulating-satellite#ran","syntology_url":"https://syntology.ai/paper/2409.02980","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.02980"}},"official":{"repos":["trivnguyen/nehod_torch"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/dual-advancement-of-representation-learning","slug":"dual-advancement-of-representation-learning","title":"Dual Advancement of Representation Learning and Clustering for Sparse and Noisy Images","date":"2024-09-03","arxiv_id":"2409.01781","repositories_listed":1,"syntology":null},{"url":"/paper/robust-clustering-on-high-dimensional-data","slug":"robust-clustering-on-high-dimensional-data","title":"Robust Clustering on High-Dimensional Data with Stochastic Quantization","date":"2024-09-03","arxiv_id":"2409.02066","repositories_listed":1,"syntology":null},{"url":"/paper/statistical-jump-model-for-mixed-type-data","slug":"statistical-jump-model-for-mixed-type-data","title":"Statistical Jump Model for Mixed-Type Data with Missing Data Imputation","date":"2024-09-02","arxiv_id":"2409.01208","repositories_listed":1,"syntology":null}],"record_sha256":"2b8cc33ad9791e07348b616aedd32cd72e27e239a55739637616fce925906df3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}