{"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/7","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":7,"pages_in_order":108,"rows_per_page":100,"rows":[601,700],"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/6","next":"/task/clustering/papers/8","papers":[{"url":"/paper/categorical-data-clustering-25-years-beyond-k","slug":"categorical-data-clustering-25-years-beyond-k","title":"Categorical data clustering: 25 years beyond K-modes","date":"2024-08-30","arxiv_id":"2408.17244","repositories_listed":1,"syntology":null},{"url":"/paper/face-clustering-via-early-stopping-and-edge","slug":"face-clustering-via-early-stopping-and-edge","title":"Face Clustering via Early Stopping and Edge Recall","date":"2024-08-24","arxiv_id":"2408.13431","repositories_listed":1,"syntology":null},{"url":"/paper/neurcam-interpretable-neural-clustering-via","slug":"neurcam-interpretable-neural-clustering-via","title":"NeurCAM: Interpretable Neural Clustering via Additive Models","date":"2024-08-23","arxiv_id":"2408.13361","repositories_listed":1,"syntology":null},{"url":"/paper/parallel-algorithms-for-median-consensus","slug":"parallel-algorithms-for-median-consensus","title":"Parallel Algorithms for Median Consensus Clustering in Complex Networks","date":"2024-08-21","arxiv_id":"2408.11331","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-by-mining-density-distributions","slug":"clustering-by-mining-density-distributions","title":"Clustering by Mining Density Distributions and Splitting Manifold Structure","date":"2024-08-20","arxiv_id":"2408.10493","repositories_listed":1,"syntology":null},{"url":"/paper/single-cell-curriculum-learning-based-deep","slug":"single-cell-curriculum-learning-based-deep","title":"Single-cell Curriculum Learning-based Deep Graph Embedding Clustering","date":"2024-08-20","arxiv_id":"2408.10511","repositories_listed":1,"syntology":null},{"url":"/paper/3c-confidence-guided-clustering-and","slug":"3c-confidence-guided-clustering-and","title":"3C: Confidence-Guided Clustering and Contrastive Learning for Unsupervised Person Re-Identification","date":"2024-08-18","arxiv_id":"2408.09464","repositories_listed":1,"syntology":null},{"url":"/paper/randomnet-clustering-time-series-using","slug":"randomnet-clustering-time-series-using","title":"RandomNet: Clustering Time Series Using Untrained Deep Neural Networks","date":"2024-08-15","arxiv_id":"2408.07956","repositories_listed":1,"syntology":null},{"url":"/paper/automato-a-parameter-free-persistence-based","slug":"automato-a-parameter-free-persistence-based","title":"AuToMATo: An Out-Of-The-Box Persistence-Based Clustering Algorithm","date":"2024-08-13","arxiv_id":"2408.06958","repositories_listed":1,"syntology":null},{"url":"/paper/a-versatile-framework-for-attributed-network","slug":"a-versatile-framework-for-attributed-network","title":"A Versatile Framework for Attributed Network Clustering via K-Nearest Neighbor Augmentation","date":"2024-08-10","arxiv_id":"2408.05459","repositories_listed":1,"syntology":null},{"url":"/paper/scasdc-attention-enhanced-structural-deep","slug":"scasdc-attention-enhanced-structural-deep","title":"scASDC: Attention Enhanced Structural Deep Clustering for Single-cell RNA-seq Data","date":"2024-08-09","arxiv_id":"2408.05258","repositories_listed":1,"syntology":null},{"url":"/paper/reliable-node-similarity-matrix-guided","slug":"reliable-node-similarity-matrix-guided","title":"Reliable Node Similarity Matrix Guided Contrastive Graph Clustering","date":"2024-08-07","arxiv_id":"2408.03765","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reliable-node-similarity-matrix-guided#ran","syntology_url":"https://syntology.ai/paper/2408.03765","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.03765"}},"official":{"repos":["Cloudy1225/NS4GC"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/2408-01920","slug":"2408-01920","title":"Image Clustering Algorithm Based on Self-Supervised Pretrained Models and Latent Feature Distribution Optimization","date":"2024-08-04","arxiv_id":"2408.01920","repositories_listed":1,"syntology":null},{"url":"/paper/2408-02043","slug":"2408-02043","title":"Deep Spectral Methods for Unsupervised Ultrasound Image Interpretation","date":"2024-08-04","arxiv_id":"2408.02043","repositories_listed":1,"syntology":null},{"url":"/paper/2408-01379","slug":"2408-01379","title":"Resampling and averaging coordinates on data","date":"2024-08-02","arxiv_id":"2408.01379","repositories_listed":1,"syntology":null},{"url":"/paper/guiding-sentiment-analysis-with-hierarchical","slug":"guiding-sentiment-analysis-with-hierarchical","title":"Guiding Sentiment Analysis with Hierarchical Text Clustering: Analyzing the German X/Twitter Discourse on Face Masks in the 2020 COVID-19 Pandemic","date":"2024-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/2408-00056","slug":"2408-00056","title":"Temporal Subspace Clustering for Molecular Dynamics Data","date":"2024-07-31","arxiv_id":"2408.00056","repositories_listed":1,"syntology":null},{"url":"/paper/language-driven-slice-discovery-and-error","slug":"language-driven-slice-discovery-and-error","title":"LADDER: Language Driven Slice Discovery and Error Rectification","date":"2024-07-31","arxiv_id":"2408.07832","repositories_listed":1,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":17,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/language-driven-slice-discovery-and-error#ran","syntology_url":"https://syntology.ai/paper/2408.07832","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.07832"}},"official":null}},{"url":"/paper/aircraft-trajectory-segmentation-based","slug":"aircraft-trajectory-segmentation-based","title":"Aircraft Trajectory Segmentation-based Contrastive Coding: A Framework for Self-supervised Trajectory Representation","date":"2024-07-29","arxiv_id":"2407.20028","repositories_listed":1,"syntology":null},{"url":"/paper/approximate-learning-of-parsimonious-bayesian","slug":"approximate-learning-of-parsimonious-bayesian","title":"Approximate learning of parsimonious Bayesian context trees","date":"2024-07-27","arxiv_id":"2407.19236","repositories_listed":1,"syntology":null},{"url":"/paper/pyamilyseq-a-python-tool-for-interpretable","slug":"pyamilyseq-a-python-tool-for-interpretable","title":"PyamilySeq: A Python Tool for Interpretable Gene (Re)Clustering and Pangenomic Inference Across Species and Genera","date":"2024-07-27","arxiv_id":"2407.19328","repositories_listed":1,"syntology":null},{"url":"/paper/dinov2-rocks-geological-image-analysis","slug":"dinov2-rocks-geological-image-analysis","title":"DINOv2 Rocks Geological Image Analysis: Classification, Segmentation, and Interpretability","date":"2024-07-25","arxiv_id":"2407.18100","repositories_listed":1,"syntology":null},{"url":"/paper/contextual-unsupervised-deep-clustering-in","slug":"contextual-unsupervised-deep-clustering-in","title":"Contextual unsupervised deep clustering in digital pathology","date":"2024-07-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/balanced-multi-relational-graph-clustering","slug":"balanced-multi-relational-graph-clustering","title":"Balanced Multi-Relational Graph Clustering","date":"2024-07-23","arxiv_id":"2407.16863","repositories_listed":1,"syntology":{"n":15,"n_ran":15,"n_constructed":0,"n_ran_checked":10,"n_instrument":5,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_pointer_only":15,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/balanced-multi-relational-graph-clustering#ran","syntology_url":"https://syntology.ai/paper/2407.16863","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.16863"}},"official":{"repos":["zxlearningdeep/bmgc"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/the-rlign-algorithm-for-enhanced","slug":"the-rlign-algorithm-for-enhanced","title":"The Rlign Algorithm for Enhanced Electrocardiogram Analysis through R-Peak Alignment for Explainable Classification and Clustering","date":"2024-07-22","arxiv_id":"2407.15555","repositories_listed":1,"syntology":null},{"url":"/paper/straightforward-layer-wise-pruning-for-more","slug":"straightforward-layer-wise-pruning-for-more","title":"Straightforward Layer-wise Pruning for More Efficient Visual Adaptation","date":"2024-07-19","arxiv_id":"2407.14330","repositories_listed":1,"syntology":null},{"url":"/paper/dual-level-adaptive-self-labeling-for-novel","slug":"dual-level-adaptive-self-labeling-for-novel","title":"Dual-level Adaptive Self-Labeling for Novel Class Discovery in Point Cloud Segmentation","date":"2024-07-17","arxiv_id":"2407.12489","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":3,"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/dual-level-adaptive-self-labeling-for-novel#ran","syntology_url":"https://syntology.ai/paper/2407.12489","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.12489"}},"official":{"repos":["RikkiXu/NCD_PC"],"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/tcformer-visual-recognition-via-token","slug":"tcformer-visual-recognition-via-token","title":"TCFormer: Visual Recognition via Token Clustering Transformer","date":"2024-07-16","arxiv_id":"2407.11321","repositories_listed":1,"syntology":null},{"url":"/paper/a3s-a-general-active-clustering-method-with","slug":"a3s-a-general-active-clustering-method-with","title":"A3S: A General Active Clustering Method with Pairwise Constraints","date":"2024-07-14","arxiv_id":"2407.10196","repositories_listed":1,"syntology":null},{"url":"/paper/part2object-hierarchical-unsupervised-3d","slug":"part2object-hierarchical-unsupervised-3d","title":"Part2Object: Hierarchical Unsupervised 3D Instance Segmentation","date":"2024-07-14","arxiv_id":"2407.10084","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/part2object-hierarchical-unsupervised-3d#ran","syntology_url":"https://syntology.ai/paper/2407.10084","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.10084"}},"official":{"repos":["chengshiest/part2object"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/advanced-graph-clustering-methods-a","slug":"advanced-graph-clustering-methods-a","title":"Advanced Graph Clustering Methods: A Comprehensive and In-Depth Analysis","date":"2024-07-12","arxiv_id":"2407.09055","repositories_listed":1,"syntology":null},{"url":"/paper/novel-clustered-federated-learning-based-on","slug":"novel-clustered-federated-learning-based-on","title":"Novel clustered federated learning based on local loss","date":"2024-07-12","arxiv_id":"2407.09360","repositories_listed":1,"syntology":null},{"url":"/paper/local-clustering-for-lung-cancer-image","slug":"local-clustering-for-lung-cancer-image","title":"Local Clustering for Lung Cancer Image Classification via Sparse Solution Technique","date":"2024-07-11","arxiv_id":"2407.08800","repositories_listed":1,"syntology":null},{"url":"/paper/adaptively-robust-and-sparse-k-means","slug":"adaptively-robust-and-sparse-k-means","title":"Adaptively Robust and Sparse K-means Clustering","date":"2024-07-09","arxiv_id":"2407.06945","repositories_listed":1,"syntology":null},{"url":"/paper/object-oriented-material-classification-and","slug":"object-oriented-material-classification-and","title":"Object-Oriented Material Classification and 3D Clustering for Improved Semantic Perception and Mapping in Mobile Robots","date":"2024-07-08","arxiv_id":"2407.06077","repositories_listed":1,"syntology":null},{"url":"/paper/structured-generations-using-hierarchical","slug":"structured-generations-using-hierarchical","title":"Structured Generations: Using Hierarchical Clusters to guide Diffusion Models","date":"2024-07-08","arxiv_id":"2407.06124","repositories_listed":1,"syntology":{"n":20,"n_ran":14,"n_constructed":10,"n_ran_checked":11,"n_instrument":3,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":20,"phrase":"14 ran (of which 10 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/structured-generations-using-hierarchical#ran","syntology_url":"https://syntology.ai/paper/2407.06124","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.06124"}},"official":{"repos":["JoGo175/diffuse-treevae"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":10,"n_ran_no_instrument_failure":11,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-probability-aggregation-clustering","slug":"deep-probability-aggregation-clustering","title":"Deep Online Probability Aggregation Clustering","date":"2024-07-07","arxiv_id":"2407.05246","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":10,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/deep-probability-aggregation-clustering#ran","syntology_url":"https://syntology.ai/paper/2407.05246","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.05246"}},"official":{"repos":["aomandechenai/deep-probability-aggregation-clustering"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/an-autoencoder-for-compressing-angle-resolved","slug":"an-autoencoder-for-compressing-angle-resolved","title":"An autoencoder for compressing angle-resolved photoemission spectroscopy data","date":"2024-07-05","arxiv_id":"2407.04631","repositories_listed":1,"syntology":null},{"url":"/paper/fair-federated-data-clustering-through","slug":"fair-federated-data-clustering-through","title":"Fair Federated Data Clustering through Personalization: Bridging the Gap between Diverse Data Distributions","date":"2024-07-05","arxiv_id":"2407.04302","repositories_listed":1,"syntology":null},{"url":"/paper/unveiling-global-interactive-patterns-across","slug":"unveiling-global-interactive-patterns-across","title":"Unveiling Global Interactive Patterns across Graphs: Towards Interpretable Graph Neural Networks","date":"2024-07-02","arxiv_id":"2407.01979","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/unveiling-global-interactive-patterns-across#ran","syntology_url":"https://syntology.ai/paper/2407.01979","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.01979"}},"official":{"repos":["Wangyuwen0627/GIP-Framework"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/cgrclust-chaos-game-representation-for-twin","slug":"cgrclust-chaos-game-representation-for-twin","title":"CGRclust: Chaos Game Representation for Twin Contrastive Clustering of Unlabelled DNA Sequences","date":"2024-07-01","arxiv_id":"2407.02538","repositories_listed":1,"syntology":null},{"url":"/paper/enabling-mixed-effects-neural-networks-for","slug":"enabling-mixed-effects-neural-networks-for","title":"Enabling Mixed Effects Neural Networks for Diverse, Clustered Data Using Monte Carlo Methods","date":"2024-07-01","arxiv_id":"2407.01115","repositories_listed":1,"syntology":null},{"url":"/paper/time-series-clustering-with-general-state","slug":"time-series-clustering-with-general-state","title":"Time Series Clustering with General State Space Models via Stochastic Variational Inference","date":"2024-06-29","arxiv_id":"2407.00429","repositories_listed":1,"syntology":null},{"url":"/paper/segment-anything-without-supervision","slug":"segment-anything-without-supervision","title":"Segment Anything without Supervision","date":"2024-06-28","arxiv_id":"2406.20081","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":3,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/segment-anything-without-supervision#ran","syntology_url":"https://syntology.ai/paper/2406.20081","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.20081"}},"official":{"repos":["frank-xwang/unsam"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sctree-discovering-cellular-hierarchies-in","slug":"sctree-discovering-cellular-hierarchies-in","title":"scTree: Discovering Cellular Hierarchies in the Presence of Batch Effects in scRNA-seq Data","date":"2024-06-27","arxiv_id":"2406.19300","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/sctree-discovering-cellular-hierarchies-in#ran","syntology_url":"https://syntology.ai/paper/2406.19300","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.19300"}},"official":{"repos":["mvandenhi/sctree-public"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/linscan-a-linearity-based-clustering","slug":"linscan-a-linearity-based-clustering","title":"LINSCAN -- A Linearity Based Clustering Algorithm","date":"2024-06-25","arxiv_id":"2406.17952","repositories_listed":1,"syntology":null},{"url":"/paper/adapting-job-recommendations-to-user","slug":"adapting-job-recommendations-to-user","title":"Adapting Job Recommendations to User Preference Drift with Behavioral-Semantic Fusion Learning","date":"2024-06-24","arxiv_id":"2407.00082","repositories_listed":1,"syntology":null},{"url":"/paper/testing-network-clustering-algorithms-with","slug":"testing-network-clustering-algorithms-with","title":"Testing network clustering algorithms with Natural Language Processing","date":"2024-06-24","arxiv_id":"2406.17135","repositories_listed":1,"syntology":null},{"url":"/paper/vicatmix-variational-bayesian-clustering-and","slug":"vicatmix-variational-bayesian-clustering-and","title":"VICatMix: variational Bayesian clustering and variable selection for discrete biomedical data","date":"2024-06-23","arxiv_id":"2406.16227","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-modularity-maximization-for-graph","slug":"revisiting-modularity-maximization-for-graph","title":"Revisiting Modularity Maximization for Graph Clustering: A Contrastive Learning Perspective","date":"2024-06-20","arxiv_id":"2406.14288","repositories_listed":1,"syntology":null},{"url":"/paper/faithful-density-peaks-clustering-via-matrix","slug":"faithful-density-peaks-clustering-via-matrix","title":"Faithful Density-Peaks Clustering via Matrix Computations on MPI Parallelization System","date":"2024-06-18","arxiv_id":"2406.12297","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-networks-and-machine-learning-for","slug":"bayesian-networks-and-machine-learning-for","title":"Bayesian Networks and Machine Learning for COVID-19 Severity Explanation and Demographic Symptom Classification","date":"2024-06-16","arxiv_id":"2406.10807","repositories_listed":1,"syntology":null},{"url":"/paper/tacco-task-guided-co-clustering-of-clinical","slug":"tacco-task-guided-co-clustering-of-clinical","title":"TACCO: Task-guided Co-clustering of Clinical Concepts and Patient Visits for Disease Subtyping based on EHR Data","date":"2024-06-14","arxiv_id":"2406.10061","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-correlation-clustering-in-sublinear","slug":"dynamic-correlation-clustering-in-sublinear","title":"Dynamic Correlation Clustering in Sublinear Update Time","date":"2024-06-13","arxiv_id":"2406.09137","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":3,"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/dynamic-correlation-clustering-in-sublinear#ran","syntology_url":"https://syntology.ai/paper/2406.09137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09137"}},"official":{"repos":["andreasr27/DCC"],"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/jackknife-inference-with-two-way-clustering","slug":"jackknife-inference-with-two-way-clustering","title":"Jackknife inference with two-way clustering","date":"2024-06-13","arxiv_id":"2406.08880","repositories_listed":1,"syntology":null},{"url":"/paper/learning-conditional-distributions-on","slug":"learning-conditional-distributions-on","title":"Learning conditional distributions on continuous spaces","date":"2024-06-13","arxiv_id":"2406.09375","repositories_listed":1,"syntology":null},{"url":"/paper/interpetable-target-feature-aggregation-for","slug":"interpetable-target-feature-aggregation-for","title":"Interpetable Target-Feature Aggregation for Multi-Task Learning based on Bias-Variance Analysis","date":"2024-06-12","arxiv_id":"2406.07991","repositories_listed":1,"syntology":null},{"url":"/paper/spoof-diarization-what-spoofed-when-in","slug":"spoof-diarization-what-spoofed-when-in","title":"Spoof Diarization: \"What Spoofed When\" in Partially Spoofed Audio","date":"2024-06-12","arxiv_id":"2406.07816","repositories_listed":1,"syntology":null},{"url":"/paper/elfs-enhancing-label-free-coreset-selection","slug":"elfs-enhancing-label-free-coreset-selection","title":"ELFS: Enhancing Label-Free Coreset Selection via Clustering-based Pseudo-Labeling","date":"2024-06-06","arxiv_id":"2406.04273","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/elfs-enhancing-label-free-coreset-selection#ran","syntology_url":"https://syntology.ai/paper/2406.04273","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.04273"}},"official":{"repos":["eltsai/elfs"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/subspace-clustering-in-wavelet-packets-domain","slug":"subspace-clustering-in-wavelet-packets-domain","title":"Subspace Clustering in Wavelet Packets Domain","date":"2024-06-06","arxiv_id":"2406.03819","repositories_listed":1,"syntology":null},{"url":"/paper/css-contrastive-semantic-similarity-for","slug":"css-contrastive-semantic-similarity-for","title":"CSS: Contrastive Semantic Similarity for Uncertainty Quantification of LLMs","date":"2024-06-05","arxiv_id":"2406.03158","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":11,"phrase":"9 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/css-contrastive-semantic-similarity-for#ran","syntology_url":"https://syntology.ai/paper/2406.03158","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03158"}},"official":{"repos":["aoshuang92/css_uq_llms"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamic-spectral-clustering-with-provable","slug":"dynamic-spectral-clustering-with-provable","title":"Dynamic Spectral Clustering with Provable Approximation Guarantee","date":"2024-06-05","arxiv_id":"2406.03152","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/dynamic-spectral-clustering-with-provable#ran","syntology_url":"https://syntology.ai/paper/2406.03152","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03152"}},"official":{"repos":["SteinarLaenen/Dynamic-Spectral-Clustering-With-Provable-Approximation-Guarantee"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/operational-latent-spaces","slug":"operational-latent-spaces","title":"Operational Latent Spaces","date":"2024-06-04","arxiv_id":"2406.02699","repositories_listed":1,"syntology":null},{"url":"/paper/presence-or-absence-are-unknown-word-usages","slug":"presence-or-absence-are-unknown-word-usages","title":"Presence or Absence: Are Unknown Word Usages in Dictionaries?","date":"2024-06-02","arxiv_id":"2406.00656","repositories_listed":1,"syntology":null},{"url":"/paper/comparing-information-content-of","slug":"comparing-information-content-of","title":"Comparing the information content of probabilistic representation spaces","date":"2024-05-31","arxiv_id":"2405.21042","repositories_listed":1,"syntology":null},{"url":"/paper/mc-gta-metric-constrained-model-based","slug":"mc-gta-metric-constrained-model-based","title":"MC-GTA: Metric-Constrained Model-Based Clustering using Goodness-of-fit Tests with Autocorrelations","date":"2024-05-28","arxiv_id":"2405.18395","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mc-gta-metric-constrained-model-based#ran","syntology_url":"https://syntology.ai/paper/2405.18395","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.18395"}},"official":{"repos":["Octopolugal/MC-GTA"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-asymmetric-factorization-for-large-scale","slug":"fast-asymmetric-factorization-for-large-scale","title":"Fast Asymmetric Factorization for Large Scale Multiple Kernel Clustering","date":"2024-05-26","arxiv_id":"2405.16447","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-data-curation-for-self-supervised","slug":"automatic-data-curation-for-self-supervised","title":"Automatic Data Curation for Self-Supervised Learning: A Clustering-Based Approach","date":"2024-05-24","arxiv_id":"2405.15613","repositories_listed":1,"syntology":{"n":19,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":19,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/automatic-data-curation-for-self-supervised#ran","syntology_url":"https://syntology.ai/paper/2405.15613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.15613"}},"official":{"repos":["facebookresearch/ssl-data-curation"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/clustering-survival-data-using-a-mixture-of","slug":"clustering-survival-data-using-a-mixture-of","title":"Clustering Survival Data using a Mixture of Non-parametric Experts","date":"2024-05-24","arxiv_id":"2405.15934","repositories_listed":1,"syntology":null},{"url":"/paper/dual-network-structure-of-the-av-node","slug":"dual-network-structure-of-the-av-node","title":"Dual network structure of the AV node","date":"2024-05-24","arxiv_id":"2405.15841","repositories_listed":1,"syntology":null},{"url":"/paper/u-tell-unsupervised-task-expert-lifelong","slug":"u-tell-unsupervised-task-expert-lifelong","title":"U-TELL: Unsupervised Task Expert Lifelong Learning","date":"2024-05-23","arxiv_id":"2405.14623","repositories_listed":1,"syntology":null},{"url":"/paper/using-k-medoids-for-distributed-approximate","slug":"using-k-medoids-for-distributed-approximate","title":"A Parametrizable Algorithm for Distributed Approximate Similarity Search with Arbitrary Distances","date":"2024-05-22","arxiv_id":"2405.13795","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-multimodal-clustering-for","slug":"unsupervised-multimodal-clustering-for","title":"Unsupervised Multimodal Clustering for Semantics Discovery in Multimodal Utterances","date":"2024-05-21","arxiv_id":"2405.12775","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":11,"phrase":"7 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; 6 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/unsupervised-multimodal-clustering-for#ran","syntology_url":"https://syntology.ai/paper/2405.12775","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.12775"}},"official":{"repos":["thuiar/umc"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/effective-clustering-on-large-attributed","slug":"effective-clustering-on-large-attributed","title":"Effective Clustering on Large Attributed Bipartite Graphs","date":"2024-05-20","arxiv_id":"2405.11922","repositories_listed":1,"syntology":null},{"url":"/paper/lsenet-lorentz-structural-entropy-neural","slug":"lsenet-lorentz-structural-entropy-neural","title":"LSEnet: Lorentz Structural Entropy Neural Network for Deep Graph Clustering","date":"2024-05-20","arxiv_id":"2405.11801","repositories_listed":1,"syntology":null},{"url":"/paper/multi-order-graph-clustering-with-adaptive","slug":"multi-order-graph-clustering-with-adaptive","title":"Multi-order Graph Clustering with Adaptive Node-level Weight Learning","date":"2024-05-20","arxiv_id":"2405.12183","repositories_listed":1,"syntology":null},{"url":"/paper/optimistic-query-routing-in-clustering-based","slug":"optimistic-query-routing-in-clustering-based","title":"Optimistic Query Routing in Clustering-based Approximate Maximum Inner Product Search","date":"2024-05-20","arxiv_id":"2405.12207","repositories_listed":1,"syntology":null},{"url":"/paper/autonomous-clustering-by-fast-find-of-mass","slug":"autonomous-clustering-by-fast-find-of-mass","title":"Autonomous clustering by fast find of mass and distance peaks","date":"2024-05-13","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/human-interpretable-clustering-of-short-text","slug":"human-interpretable-clustering-of-short-text","title":"Human-interpretable clustering of short-text using large language models","date":"2024-05-12","arxiv_id":"2405.07278","repositories_listed":1,"syntology":null},{"url":"/paper/sampling-the-swadesh-list-to-identify-similar","slug":"sampling-the-swadesh-list-to-identify-similar","title":"Sampling the Swadesh List to Identify Similar Languages with Tree Spaces","date":"2024-05-10","arxiv_id":"2405.06549","repositories_listed":1,"syntology":null},{"url":"/paper/rectified-gaussian-kernel-multi-view-k-means","slug":"rectified-gaussian-kernel-multi-view-k-means","title":"Rectified Gaussian kernel multi-view k-means clustering","date":"2024-05-09","arxiv_id":"2405.05619","repositories_listed":1,"syntology":null},{"url":"/paper/physics-based-deep-learning-reveals-rising","slug":"physics-based-deep-learning-reveals-rising","title":"Physics-based deep learning reveals rising heating demand heightens air pollution in Norwegian cities","date":"2024-05-07","arxiv_id":"2405.04716","repositories_listed":1,"syntology":null},{"url":"/paper/representation-learning-of-daily-movement","slug":"representation-learning-of-daily-movement","title":"Representation Learning of Daily Movement Data Using Text Encoders","date":"2024-05-07","arxiv_id":"2405.04494","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/representation-learning-of-daily-movement#ran","syntology_url":"https://syntology.ai/paper/2405.04494","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.04494"}},"official":{"repos":["alexcapstick/text-encoders-for-daily-movement-data"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-clustering-with-self-supervision-using","slug":"deep-clustering-with-self-supervision-using","title":"Deep Clustering with Self-Supervision using Pairwise Similarities","date":"2024-05-06","arxiv_id":"2405.03590","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-clustering-with-self-supervision-using#ran","syntology_url":"https://syntology.ai/paper/2405.03590","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.03590"}},"official":{"repos":["Armanfard-Lab/DCSS"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-one-stage-unsupervised-domain-adaptive","slug":"fast-one-stage-unsupervised-domain-adaptive","title":"Fast One-Stage Unsupervised Domain Adaptive Person Search","date":"2024-05-05","arxiv_id":"2405.02832","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"phrase":"6 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/fast-one-stage-unsupervised-domain-adaptive#ran","syntology_url":"https://syntology.ai/paper/2405.02832","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.02832"}},"official":{"repos":["whbdmu/fous"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-a-scalable-identification-of-novel","slug":"towards-a-scalable-identification-of-novel","title":"Identification of Novel Modes in Generative Models via Fourier-based Differential Clustering","date":"2024-05-04","arxiv_id":"2405.02700","repositories_listed":1,"syntology":null},{"url":"/paper/fastlloyd-federated-accurate-secure-and","slug":"fastlloyd-federated-accurate-secure-and","title":"FastLloyd: Federated, Accurate, Secure, and Tunable $k$-Means Clustering with Differential Privacy","date":"2024-05-03","arxiv_id":"2405.02437","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fastlloyd-federated-accurate-secure-and#ran","syntology_url":"https://syntology.ai/paper/2405.02437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.02437"}},"official":{"repos":["d-diaa/fastlloyd"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/cbmap-clustering-based-manifold-approximation","slug":"cbmap-clustering-based-manifold-approximation","title":"CBMAP: Clustering-based manifold approximation and projection for dimensionality reduction","date":"2024-04-27","arxiv_id":"2404.17940","repositories_listed":1,"syntology":null},{"url":"/paper/interpretable-clustering-with-the","slug":"interpretable-clustering-with-the","title":"Interpretable Clustering with the Distinguishability Criterion","date":"2024-04-24","arxiv_id":"2404.15967","repositories_listed":1,"syntology":null},{"url":"/paper/mode-clip-data-experts-via-clustering","slug":"mode-clip-data-experts-via-clustering","title":"MoDE: CLIP Data Experts via Clustering","date":"2024-04-24","arxiv_id":"2404.16030","repositories_listed":1,"syntology":null},{"url":"/paper/multi-modal-proxy-learning-towards","slug":"multi-modal-proxy-learning-towards","title":"Multi-Modal Proxy Learning Towards Personalized Visual Multiple Clustering","date":"2024-04-24","arxiv_id":"2404.15655","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":7,"phrase":"4 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; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/multi-modal-proxy-learning-towards#ran","syntology_url":"https://syntology.ai/paper/2404.15655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.15655"}},"official":{"repos":["alexander-yao/multi-map"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/variational-deep-survival-machines-survival","slug":"variational-deep-survival-machines-survival","title":"Variational Deep Survival Machines: Survival Regression with Censored Outcomes","date":"2024-04-24","arxiv_id":"2404.15595","repositories_listed":1,"syntology":null},{"url":"/paper/cross-temporal-spectrogram-autoencoder-ctsae","slug":"cross-temporal-spectrogram-autoencoder-ctsae","title":"Cross-Temporal Spectrogram Autoencoder (CTSAE): Unsupervised Dimensionality Reduction for Clustering Gravitational Wave Glitches","date":"2024-04-23","arxiv_id":"2404.15552","repositories_listed":1,"syntology":null},{"url":"/paper/blind-localization-and-clustering-of","slug":"blind-localization-and-clustering-of","title":"Blind Localization and Clustering of Anomalies in Textures","date":"2024-04-18","arxiv_id":"2404.12246","repositories_listed":1,"syntology":null},{"url":"/paper/a-learning-to-rank-formulation-of-clustering","slug":"a-learning-to-rank-formulation-of-clustering","title":"A Learning-to-Rank Formulation of Clustering-Based Approximate Nearest Neighbor Search","date":"2024-04-17","arxiv_id":"2404.11731","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":8,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-learning-to-rank-formulation-of-clustering#ran","syntology_url":"https://syntology.ai/paper/2404.11731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.11731"}},"official":{"repos":["tomvek/mips-learnt-ivf"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/gscan-graph-stability-clustering-for","slug":"gscan-graph-stability-clustering-for","title":"GSCAN: Graph Stability Clustering for Applications With Noise Using Edge-Aware Excess-of-Mass","date":"2024-04-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/camera-clustering-for-scalable-stream-based","slug":"camera-clustering-for-scalable-stream-based","title":"Camera clustering for scalable stream-based active distillation","date":"2024-04-16","arxiv_id":"2404.10411","repositories_listed":1,"syntology":null},{"url":"/paper/cluster-based-graph-collaborative-filtering","slug":"cluster-based-graph-collaborative-filtering","title":"Cluster-based Graph Collaborative Filtering","date":"2024-04-16","arxiv_id":"2404.10321","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cluster-based-graph-collaborative-filtering#ran","syntology_url":"https://syntology.ai/paper/2404.10321","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.10321"}},"official":{"repos":["zhao254014/clustergcf"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/beyond-known-clusters-probe-new-prototypes","slug":"beyond-known-clusters-probe-new-prototypes","title":"Beyond Known Clusters: Probe New Prototypes for Efficient Generalized Class Discovery","date":"2024-04-13","arxiv_id":"2404.08995","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/beyond-known-clusters-probe-new-prototypes#ran","syntology_url":"https://syntology.ai/paper/2404.08995","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.08995"}},"official":{"repos":["xjtuyw/pnp"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/unfolding-admm-for-enhanced-subspace","slug":"unfolding-admm-for-enhanced-subspace","title":"Unfolding ADMM for Enhanced Subspace Clustering of Hyperspectral Images","date":"2024-04-10","arxiv_id":"2404.07112","repositories_listed":1,"syntology":null}],"record_sha256":"2dbb5e8091a16a12d36f2b207cccb1335914f468f9fa71192154e849f34143ca","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}