{"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/9","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":9,"pages_in_order":108,"rows_per_page":100,"rows":[801,900],"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/8","next":"/task/clustering/papers/10","papers":[{"url":"/paper/sar-images-clustering-based-on-modified","slug":"sar-images-clustering-based-on-modified","title":"SAR Images Clustering Based on Modified Nonlinear Orthogonal Nonnegative Matrix Factorization (NMF)","date":"2023-12-11","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/visiontraj-a-noise-robust-trajectory-recovery","slug":"visiontraj-a-noise-robust-trajectory-recovery","title":"VisionTraj: A Noise-Robust Trajectory Recovery Framework based on Large-scale Camera Network","date":"2023-12-11","arxiv_id":"2312.06428","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/visiontraj-a-noise-robust-trajectory-recovery#ran","syntology_url":"https://syntology.ai/paper/2312.06428","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.06428"}},"official":{"repos":["bonaldli/visiontraj"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/tabiic-taxonomy-building-through-iterative","slug":"tabiic-taxonomy-building-through-iterative","title":"TaBIIC: Taxonomy Building through Iterative and Interactive Clustering","date":"2023-12-10","arxiv_id":"2312.05866","repositories_listed":1,"syntology":null},{"url":"/paper/human-in-the-loop-estimation-of-cluster-count","slug":"human-in-the-loop-estimation-of-cluster-count","title":"Human-in-the-Loop Visual Re-ID for Population Size Estimation","date":"2023-12-08","arxiv_id":"2312.05287","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-social-event-detection-via","slug":"unsupervised-social-event-detection-via","title":"Unsupervised Social Event Detection via Hybrid Graph Contrastive Learning and Reinforced Incremental Clustering","date":"2023-12-08","arxiv_id":"2312.08374","repositories_listed":1,"syntology":null},{"url":"/paper/a-structural-clustering-based-active-learning","slug":"a-structural-clustering-based-active-learning","title":"A Structural-Clustering Based Active Learning for Graph Neural Networks","date":"2023-12-07","arxiv_id":"2312.04307","repositories_listed":1,"syntology":null},{"url":"/paper/codex-a-cluster-based-method-for-explainable","slug":"codex-a-cluster-based-method-for-explainable","title":"CODEX: A Cluster-Based Method for Explainable Reinforcement Learning","date":"2023-12-07","arxiv_id":"2312.04216","repositories_listed":1,"syntology":null},{"url":"/paper/improving-gradient-guided-nested-sampling-for","slug":"improving-gradient-guided-nested-sampling-for","title":"Improving Gradient-guided Nested Sampling for Posterior Inference","date":"2023-12-06","arxiv_id":"2312.03911","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/improving-gradient-guided-nested-sampling-for#ran","syntology_url":"https://syntology.ai/paper/2312.03911","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.03911"}},"official":{"repos":["pablo-lemos/ggns"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/clustering-pseudo-language-family-in","slug":"clustering-pseudo-language-family-in","title":"Clustering Pseudo Language Family in Multilingual Translation Models with Fisher Information Matrix","date":"2023-12-05","arxiv_id":"2312.02820","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/clustering-pseudo-language-family-in#ran","syntology_url":"https://syntology.ai/paper/2312.02820","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02820"}},"official":{"repos":["ecoli-hit/pseudofamily"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/cancer-subtype-identification-through","slug":"cancer-subtype-identification-through","title":"Cancer Subtype Identification through Integrating Inter and Intra Dataset Relationships in Multi-Omics Data","date":"2023-12-02","arxiv_id":"2312.02195","repositories_listed":1,"syntology":null},{"url":"/paper/betrayed-by-attention-a-simple-yet-effective","slug":"betrayed-by-attention-a-simple-yet-effective","title":"Betrayed by Attention: A Simple yet Effective Approach for Self-supervised Video Object Segmentation","date":"2023-11-29","arxiv_id":"2311.17893","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":12,"phrase":"10 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; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/betrayed-by-attention-a-simple-yet-effective#ran","syntology_url":"https://syntology.ai/paper/2311.17893","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.17893"}},"official":{"repos":["shvdiwnkozbw/ssl-uvos"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/most-discriminative-stimuli-for-functional","slug":"most-discriminative-stimuli-for-functional","title":"Most discriminative stimuli for functional cell type clustering","date":"2023-11-29","arxiv_id":"2401.05342","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/most-discriminative-stimuli-for-functional#ran","syntology_url":"https://syntology.ai/paper/2401.05342","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.05342"}},"official":{"repos":["ecker-lab/most-discriminative-stimuli"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/single-cell-multi-view-clustering-via","slug":"single-cell-multi-view-clustering-via","title":"Single-cell Multi-view Clustering via Community Detection with Unknown Number of Clusters","date":"2023-11-28","arxiv_id":"2311.17103","repositories_listed":1,"syntology":null},{"url":"/paper/constraintmatch-for-semi-constrained","slug":"constraintmatch-for-semi-constrained","title":"ConstraintMatch for Semi-constrained Clustering","date":"2023-11-26","arxiv_id":"2311.15395","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/constraintmatch-for-semi-constrained#ran","syntology_url":"https://syntology.ai/paper/2311.15395","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.15395"}},"official":{"repos":["slds-lmu/constraintmatch"],"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/stable-cluster-discrimination-for-deep-1","slug":"stable-cluster-discrimination-for-deep-1","title":"Stable Cluster Discrimination for Deep Clustering","date":"2023-11-24","arxiv_id":"2311.14310","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/stable-cluster-discrimination-for-deep-1#ran","syntology_url":"https://syntology.ai/paper/2311.14310","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.14310"}},"official":{"repos":["idstcv/secu"],"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/low-latency-instance-segmentation-by","slug":"low-latency-instance-segmentation-by","title":"Low Latency Instance Segmentation by Continuous Clustering for LiDAR Sensors","date":"2023-11-23","arxiv_id":"2311.13976","repositories_listed":1,"syntology":null},{"url":"/paper/backbonelearn-a-library-for-scaling-mixed","slug":"backbonelearn-a-library-for-scaling-mixed","title":"BackboneLearn: A Library for Scaling Mixed-Integer Optimization-Based Machine Learning","date":"2023-11-22","arxiv_id":"2311.13695","repositories_listed":1,"syntology":null},{"url":"/paper/orchard-building-large-cancer-phylogenies","slug":"orchard-building-large-cancer-phylogenies","title":"Orchard: building large cancer phylogenies using stochastic combinatorial search","date":"2023-11-21","arxiv_id":"2311.12917","repositories_listed":1,"syntology":null},{"url":"/paper/establishing-central-sensitization-inventory","slug":"establishing-central-sensitization-inventory","title":"Establishing Central Sensitization Inventory Cut-off Values in patients with Chronic Low Back Pain by Unsupervised Machine Learning","date":"2023-11-20","arxiv_id":"2311.11862","repositories_listed":1,"syntology":null},{"url":"/paper/ibgr-influence-based-group-recommendation","slug":"ibgr-influence-based-group-recommendation","title":"IBGR: Influence-Based Group Recommendation system","date":"2023-11-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/spoken-word2vec-a-perspective-and-some","slug":"spoken-word2vec-a-perspective-and-some","title":"Spoken Word2Vec: Learning Skipgram Embeddings from Speech","date":"2023-11-15","arxiv_id":"2311.09319","repositories_listed":1,"syntology":null},{"url":"/paper/toward-efficient-and-incremental-spectral","slug":"toward-efficient-and-incremental-spectral","title":"Toward Efficient and Incremental Spectral Clustering via Parametric Spectral Clustering","date":"2023-11-14","arxiv_id":"2311.07833","repositories_listed":1,"syntology":null},{"url":"/paper/finite-mixtures-of-multivariate-poisson-log","slug":"finite-mixtures-of-multivariate-poisson-log","title":"Finite Mixtures of Multivariate Poisson-Log Normal Factor Analyzers for Clustering Count Data","date":"2023-11-13","arxiv_id":"2311.07762","repositories_listed":1,"syntology":null},{"url":"/paper/the-brain-uses-renewal-points-to-model-random","slug":"the-brain-uses-renewal-points-to-model-random","title":"The brain uses renewal points to model random sequences of stimuli","date":"2023-11-13","arxiv_id":"2311.07793","repositories_listed":1,"syntology":null},{"url":"/paper/robust-text-classification-analyzing","slug":"robust-text-classification-analyzing","title":"Robust Text Classification: Analyzing Prototype-Based Networks","date":"2023-11-11","arxiv_id":"2311.06647","repositories_listed":1,"syntology":null},{"url":"/paper/object-centric-learning-with-slot-mixture","slug":"object-centric-learning-with-slot-mixture","title":"Object-Centric Learning with Slot Mixture Module","date":"2023-11-08","arxiv_id":"2311.04640","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":5,"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/object-centric-learning-with-slot-mixture#ran","syntology_url":"https://syntology.ai/paper/2311.04640","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.04640"}},"official":{"repos":["airi-institute/smm"],"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/strategies-for-parallelizing-the-big-means","slug":"strategies-for-parallelizing-the-big-means","title":"High-Performance Hybrid Algorithm for Minimum Sum-of-Squares Clustering of Infinitely Tall Data","date":"2023-11-08","arxiv_id":"2311.04517","repositories_listed":1,"syntology":null},{"url":"/paper/a-graph-theoretic-framework-for-understanding-1","slug":"a-graph-theoretic-framework-for-understanding-1","title":"A Graph-Theoretic Framework for Understanding Open-World Semi-Supervised Learning","date":"2023-11-06","arxiv_id":"2311.03524","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"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 1 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/a-graph-theoretic-framework-for-understanding-1#ran","syntology_url":"https://syntology.ai/paper/2311.03524","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.03524"}},"official":{"repos":["deeplearning-wisc/sorl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dp-dcan-differentially-private-deep","slug":"dp-dcan-differentially-private-deep","title":"DP-DCAN: Differentially Private Deep Contrastive Autoencoder Network for Single-cell Clustering","date":"2023-11-06","arxiv_id":"2311.03410","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-spectral-clustering-on-incomplete","slug":"boosting-spectral-clustering-on-incomplete","title":"Boosting Spectral Clustering on Incomplete Data via Kernel Correction and Affinity Learning","date":"2023-11-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/spectral-clustering-of-attributed-multi","slug":"spectral-clustering-of-attributed-multi","title":"Spectral Clustering of Attributed Multi-relational Graphs","date":"2023-11-03","arxiv_id":"2311.01840","repositories_listed":1,"syntology":null},{"url":"/paper/sanitized-clustering-against-confounding-bias","slug":"sanitized-clustering-against-confounding-bias","title":"Sanitized Clustering against Confounding Bias","date":"2023-11-02","arxiv_id":"2311.01252","repositories_listed":1,"syntology":null},{"url":"/paper/robust-graph-clustering-via-meta-weighting","slug":"robust-graph-clustering-via-meta-weighting","title":"Robust Graph Clustering via Meta Weighting for Noisy Graphs","date":"2023-11-01","arxiv_id":"2311.00322","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/robust-graph-clustering-via-meta-weighting#ran","syntology_url":"https://syntology.ai/paper/2311.00322","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.00322"}},"official":{"repos":["hyeonsoojo/metagc"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/an-interpretable-clustering-approach-to","slug":"an-interpretable-clustering-approach-to","title":"An interpretable clustering approach to safety climate analysis: examining driver group distinction in safety climate perceptions","date":"2023-10-30","arxiv_id":"2310.19841","repositories_listed":1,"syntology":null},{"url":"/paper/mmm-and-mmmsynth-clustering-of-heterogeneous","slug":"mmm-and-mmmsynth-clustering-of-heterogeneous","title":"MMM and MMMSynth: Clustering of heterogeneous tabular data, and synthetic data generation","date":"2023-10-30","arxiv_id":"2310.19454","repositories_listed":1,"syntology":null},{"url":"/paper/image-clustering-conditioned-on-text-criteria","slug":"image-clustering-conditioned-on-text-criteria","title":"Image Clustering Conditioned on Text Criteria","date":"2023-10-27","arxiv_id":"2310.18297","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":1,"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/image-clustering-conditioned-on-text-criteria#ran","syntology_url":"https://syntology.ai/paper/2310.18297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18297"}},"official":{"repos":["sehyunkwon/ictc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/decwa-density-based-clustering-using","slug":"decwa-density-based-clustering-using","title":"DECWA : Density-Based Clustering using Wasserstein Distance","date":"2023-10-25","arxiv_id":"2310.16552","repositories_listed":1,"syntology":null},{"url":"/paper/crash-clustering-removing-and-sharing-enhance","slug":"crash-clustering-removing-and-sharing-enhance","title":"CRaSh: Clustering, Removing, and Sharing Enhance Fine-tuning without Full Large Language Model","date":"2023-10-24","arxiv_id":"2310.15477","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/crash-clustering-removing-and-sharing-enhance#ran","syntology_url":"https://syntology.ai/paper/2310.15477","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15477"}},"official":{"repos":["tsinghuac3i/crash"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/transfer-learning-for-day-ahead-load","slug":"transfer-learning-for-day-ahead-load","title":"Transfer learning for day-ahead load forecasting: a case study on European national electricity demand time series","date":"2023-10-24","arxiv_id":"2310.15555","repositories_listed":1,"syntology":null},{"url":"/paper/dynamically-weighted-federated-k-means","slug":"dynamically-weighted-federated-k-means","title":"Dynamically Weighted Federated k-Means","date":"2023-10-23","arxiv_id":"2310.14858","repositories_listed":1,"syntology":null},{"url":"/paper/accelerated-sparse-kernel-spectral-clustering","slug":"accelerated-sparse-kernel-spectral-clustering","title":"Accelerated sparse Kernel Spectral Clustering for large scale data clustering problems","date":"2023-10-20","arxiv_id":"2310.13381","repositories_listed":1,"syntology":null},{"url":"/paper/dcsi-an-improved-measure-of-cluster","slug":"dcsi-an-improved-measure-of-cluster","title":"DCSI -- An improved measure of cluster separability based on separation and connectedness","date":"2023-10-19","arxiv_id":"2310.12806","repositories_listed":1,"syntology":null},{"url":"/paper/discretize-relaxed-solution-of-spectral","slug":"discretize-relaxed-solution-of-spectral","title":"Discretize Relaxed Solution of Spectral Clustering via a Non-Heuristic Algorithm","date":"2023-10-19","arxiv_id":"2310.12752","repositories_listed":1,"syntology":null},{"url":"/paper/fusc-fetal-ultrasound-semantic-clustering-of","slug":"fusc-fetal-ultrasound-semantic-clustering-of","title":"FUSC: Fetal Ultrasound Semantic Clustering of Second Trimester Scans Using Deep Self-supervised Learning","date":"2023-10-19","arxiv_id":"2310.12600","repositories_listed":1,"syntology":null},{"url":"/paper/image-clustering-with-external-guidance","slug":"image-clustering-with-external-guidance","title":"Image Clustering with External Guidance","date":"2023-10-18","arxiv_id":"2310.11989","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":9,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/image-clustering-with-external-guidance#ran","syntology_url":"https://syntology.ai/paper/2310.11989","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.11989"}},"official":{"repos":["xlearning-scu/2024-icml-tac"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-representation-learning-for-1","slug":"improving-representation-learning-for-1","title":"Improving Representation Learning for Histopathologic Images with Cluster Constraints","date":"2023-10-18","arxiv_id":"2310.12334","repositories_listed":1,"syntology":null},{"url":"/paper/a-4-approximation-algorithm-for-min-max","slug":"a-4-approximation-algorithm-for-min-max","title":"A 4-approximation algorithm for min max correlation clustering","date":"2023-10-13","arxiv_id":"2310.09196","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-4-approximation-algorithm-for-min-max#ran","syntology_url":"https://syntology.ai/paper/2310.09196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.09196"}},"official":{"repos":["jannikirmai/min-max-correlation-clustering"],"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/bibrank-automatic-keyphrase-extraction","slug":"bibrank-automatic-keyphrase-extraction","title":"BibRank: Automatic Keyphrase Extraction Platform Using~Metadata","date":"2023-10-13","arxiv_id":"2310.09151","repositories_listed":1,"syntology":null},{"url":"/paper/multi-sensor-multi-scan-radar-sensing-of","slug":"multi-sensor-multi-scan-radar-sensing-of","title":"Multi-Sensor Multi-Scan Radar Sensing of Multiple Extended Targets","date":"2023-10-13","arxiv_id":"2310.09011","repositories_listed":1,"syntology":null},{"url":"/paper/anchor-based-multi-view-subspace-clustering","slug":"anchor-based-multi-view-subspace-clustering","title":"Anchor-based Multi-view Subspace Clustering with Hierarchical Feature Descent","date":"2023-10-11","arxiv_id":"2310.07166","repositories_listed":1,"syntology":null},{"url":"/paper/joint-projection-learning-and-tensor","slug":"joint-projection-learning-and-tensor","title":"Joint Projection Learning and Tensor Decomposition Based Incomplete Multi-view Clustering","date":"2023-10-06","arxiv_id":"2310.04038","repositories_listed":1,"syntology":null},{"url":"/paper/bridging-the-domain-gap-by-clustering-based","slug":"bridging-the-domain-gap-by-clustering-based","title":"Clustering-based Image-Text Graph Matching for Domain Generalization","date":"2023-10-04","arxiv_id":"2310.02692","repositories_listed":1,"syntology":null},{"url":"/paper/the-map-equation-goes-neural","slug":"the-map-equation-goes-neural","title":"The Map Equation Goes Neural: Mapping Network Flows with Graph Neural Networks","date":"2023-10-02","arxiv_id":"2310.01144","repositories_listed":1,"syntology":null},{"url":"/paper/multi-swap-k-means","slug":"multi-swap-k-means","title":"Multi-Swap $k$-Means++","date":"2023-09-28","arxiv_id":"2309.16384","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":8,"phrase":"5 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; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/multi-swap-k-means#ran","syntology_url":"https://syntology.ai/paper/2309.16384","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.16384"}},"official":{"repos":["lorenzo2beretta/multi-swap-k-means-pp"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/shapedba-generating-effective-time-series","slug":"shapedba-generating-effective-time-series","title":"ShapeDBA: Generating Effective Time Series Prototypes using ShapeDTW Barycenter Averaging","date":"2023-09-28","arxiv_id":"2309.16353","repositories_listed":1,"syntology":null},{"url":"/paper/hypertrack-neural-combinatorics-for-high","slug":"hypertrack-neural-combinatorics-for-high","title":"HyperTrack: Neural Combinatorics for High Energy Physics","date":"2023-09-25","arxiv_id":"2309.14113","repositories_listed":1,"syntology":null},{"url":"/paper/denmune-density-peak-based-clustering-using-1","slug":"denmune-density-peak-based-clustering-using-1","title":"DenMune: Density peak based clustering using mutual nearest neighbors","date":"2023-09-23","arxiv_id":"2309.13420","repositories_listed":1,"syntology":null},{"url":"/paper/an-intelligent-approach-to-detecting-novel","slug":"an-intelligent-approach-to-detecting-novel","title":"An Intelligent Approach to Detecting Novel Fault Classes for Centrifugal Pumps Based on Deep CNNs and Unsupervised Methods","date":"2023-09-22","arxiv_id":"2309.12765","repositories_listed":1,"syntology":null},{"url":"/paper/clusterformer-clustering-as-a-universal","slug":"clusterformer-clustering-as-a-universal","title":"ClusterFormer: Clustering As A Universal Visual Learner","date":"2023-09-22","arxiv_id":"2309.13196","repositories_listed":1,"syntology":null},{"url":"/paper/incremental-constrained-clustering-by-minimal","slug":"incremental-constrained-clustering-by-minimal","title":"Incremental Constrained Clustering by Minimal Weighted Modification","date":"2023-09-22","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/cluster-based-pruning-techniques-for-audio","slug":"cluster-based-pruning-techniques-for-audio","title":"Cluster-based pruning techniques for audio data","date":"2023-09-21","arxiv_id":"2309.11922","repositories_listed":1,"syntology":null},{"url":"/paper/early-diagnosis-of-autism-spectrum-disorder","slug":"early-diagnosis-of-autism-spectrum-disorder","title":"An Evaluation of Machine Learning Approaches for Early Diagnosis of Autism Spectrum Disorder","date":"2023-09-20","arxiv_id":"2309.11646","repositories_listed":1,"syntology":null},{"url":"/paper/the-kernel-density-integral-transformation","slug":"the-kernel-density-integral-transformation","title":"The Kernel Density Integral Transformation","date":"2023-09-18","arxiv_id":"2309.10194","repositories_listed":1,"syntology":null},{"url":"/paper/topological-and-geometric-analysis-of-cell","slug":"topological-and-geometric-analysis-of-cell","title":"Topological and geometric analysis of cell states in single-cell transcriptomic data","date":"2023-09-14","arxiv_id":"2309.07950","repositories_listed":1,"syntology":null},{"url":"/paper/fingerprint-attack-client-de-anonymization-in","slug":"fingerprint-attack-client-de-anonymization-in","title":"Fingerprint Attack: Client De-Anonymization in Federated Learning","date":"2023-09-12","arxiv_id":"2310.05960","repositories_listed":1,"syntology":null},{"url":"/paper/redundancy-free-self-supervised-relational","slug":"redundancy-free-self-supervised-relational","title":"Redundancy-Free Self-Supervised Relational Learning for Graph Clustering","date":"2023-09-09","arxiv_id":"2309.04694","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/redundancy-free-self-supervised-relational#ran","syntology_url":"https://syntology.ai/paper/2309.04694","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.04694"}},"official":{"repos":["yisiyu95/r2fgc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tcgan-convolutional-generative-adversarial","slug":"tcgan-convolutional-generative-adversarial","title":"TCGAN: Convolutional Generative Adversarial Network for Time Series Classification and Clustering","date":"2023-09-09","arxiv_id":"2309.04732","repositories_listed":1,"syntology":null},{"url":"/paper/privacy-preserving-continual-federated","slug":"privacy-preserving-continual-federated","title":"Privacy-preserving Continual Federated Clustering via Adaptive Resonance Theory","date":"2023-09-07","arxiv_id":"2309.03487","repositories_listed":1,"syntology":null},{"url":"/paper/data-aggregation-for-hierarchical-clustering","slug":"data-aggregation-for-hierarchical-clustering","title":"Data Aggregation for Hierarchical Clustering","date":"2023-09-05","arxiv_id":"2309.02552","repositories_listed":1,"syntology":null},{"url":"/paper/superclustering-by-finding-statistically","slug":"superclustering-by-finding-statistically","title":"Superclustering by finding statistically significant separable groups of optimal gaussian clusters","date":"2023-09-05","arxiv_id":"2309.02623","repositories_listed":1,"syntology":null},{"url":"/paper/interpretable-sequence-clustering","slug":"interpretable-sequence-clustering","title":"Interpretable Sequence Clustering","date":"2023-09-03","arxiv_id":"2309.01140","repositories_listed":1,"syntology":null},{"url":"/paper/pstarc-pseudo-source-guided-target-clustering","slug":"pstarc-pseudo-source-guided-target-clustering","title":"pSTarC: Pseudo Source Guided Target Clustering for Fully Test-Time Adaptation","date":"2023-09-02","arxiv_id":"2309.00846","repositories_listed":1,"syntology":null},{"url":"/paper/tutorial-a-priori-estimation-of-sample-size","slug":"tutorial-a-priori-estimation-of-sample-size","title":"Tutorial: a priori estimation of sample size, effect size, and statistical power for cluster analysis, latent class analysis, and multivariate mixture models","date":"2023-09-02","arxiv_id":"2309.00866","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-multi-view-graph-clustering-with","slug":"efficient-multi-view-graph-clustering-with","title":"Efficient Multi-View Graph Clustering with Local and Global Structure Preservation","date":"2023-08-31","arxiv_id":"2309.00024","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-incomplete-multi-view-clustering","slug":"scalable-incomplete-multi-view-clustering","title":"Scalable Incomplete Multi-View Clustering with Structure Alignment","date":"2023-08-31","arxiv_id":"2308.16541","repositories_listed":1,"syntology":null},{"url":"/paper/federated-two-stage-decoupling-with-adaptive","slug":"federated-two-stage-decoupling-with-adaptive","title":"Federated Two Stage Decoupling With Adaptive Personalization Layers","date":"2023-08-30","arxiv_id":"2308.15821","repositories_listed":1,"syntology":null},{"url":"/paper/smoclust-synthetic-minority-oversampling","slug":"smoclust-synthetic-minority-oversampling","title":"SMOClust: Synthetic Minority Oversampling based on Stream Clustering for Evolving Data Streams","date":"2023-08-28","arxiv_id":"2308.14845","repositories_listed":1,"syntology":null},{"url":"/paper/zero-shot-edge-detection-with-scesame","slug":"zero-shot-edge-detection-with-scesame","title":"Zero-Shot Edge Detection with SCESAME: Spectral Clustering-based Ensemble for Segment Anything Model Estimation","date":"2023-08-26","arxiv_id":"2308.13779","repositories_listed":1,"syntology":null},{"url":"/paper/edge-aware-hard-clustering-graph-pooling-for","slug":"edge-aware-hard-clustering-graph-pooling-for","title":"Edge-aware Hard Clustering Graph Pooling for Brain Imaging","date":"2023-08-23","arxiv_id":"2308.11909","repositories_listed":1,"syntology":null},{"url":"/paper/state-transition-dynamics-of-resting-state","slug":"state-transition-dynamics-of-resting-state","title":"State-transition dynamics of resting-state functional magnetic resonance imaging data: Model comparison and test-to-retest analysis","date":"2023-08-23","arxiv_id":"2308.11910","repositories_listed":1,"syntology":null},{"url":"/paper/decoupled-contrastive-multi-view-clustering","slug":"decoupled-contrastive-multi-view-clustering","title":"Decoupled Contrastive Multi-View Clustering with High-Order Random Walks","date":"2023-08-22","arxiv_id":"2308.11164","repositories_listed":1,"syntology":null},{"url":"/paper/a-clustering-algorithm-to-organize-satellite","slug":"a-clustering-algorithm-to-organize-satellite","title":"A Clustering Algorithm to Organize Satellite Hotspot Data for the Purpose of Tracking Bushfires Remotely","date":"2023-08-21","arxiv_id":"2308.10505","repositories_listed":1,"syntology":null},{"url":"/paper/scaled-up-discovery-of-latent-concepts-in","slug":"scaled-up-discovery-of-latent-concepts-in","title":"Scaling up Discovery of Latent Concepts in Deep NLP Models","date":"2023-08-20","arxiv_id":"2308.10263","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scaled-up-discovery-of-latent-concepts-in#ran","syntology_url":"https://syntology.ai/paper/2308.10263","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.10263"}},"official":{"repos":["qcri/latent_concept_analysis"],"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/datasetequity-are-all-samples-created-equal","slug":"datasetequity-are-all-samples-created-equal","title":"DatasetEquity: Are All Samples Created Equal? In The Quest For Equity Within Datasets","date":"2023-08-19","arxiv_id":"2308.09878","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-image-forgery-detection-via","slug":"rethinking-image-forgery-detection-via","title":"Rethinking Image Forgery Detection via Soft Contrastive Learning and Unsupervised Clustering","date":"2023-08-18","arxiv_id":"2308.09307","repositories_listed":1,"syntology":null},{"url":"/paper/dealmvc-dual-contrastive-calibration-for","slug":"dealmvc-dual-contrastive-calibration-for","title":"DealMVC: Dual Contrastive Calibration for Multi-view Clustering","date":"2023-08-17","arxiv_id":"2308.09000","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/dealmvc-dual-contrastive-calibration-for#ran","syntology_url":"https://syntology.ai/paper/2308.09000","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09000"}},"official":{"repos":["xihongyang1999/dealmvc"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/characteristics-of-networks-generated-by","slug":"characteristics-of-networks-generated-by","title":"Characteristics of networks generated by kernel growing neural gas","date":"2023-08-16","arxiv_id":"2308.08163","repositories_listed":1,"syntology":null},{"url":"/paper/homophily-enhanced-structure-learning-for","slug":"homophily-enhanced-structure-learning-for","title":"Homophily-enhanced Structure Learning for Graph Clustering","date":"2023-08-10","arxiv_id":"2308.05309","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/homophily-enhanced-structure-learning-for#ran","syntology_url":"https://syntology.ai/paper/2308.05309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.05309"}},"official":{"repos":["galogm/hole"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/selectnadapt-support-set-selection-for-few","slug":"selectnadapt-support-set-selection-for-few","title":"SelectNAdapt: Support Set Selection for Few-Shot Domain Adaptation","date":"2023-08-09","arxiv_id":"2308.04946","repositories_listed":1,"syntology":null},{"url":"/paper/minimizing-return-gaps-with-discrete","slug":"minimizing-return-gaps-with-discrete","title":"RGMComm: Return Gap Minimization via Discrete Communications in Multi-Agent Reinforcement Learning","date":"2023-08-07","arxiv_id":"2308.03358","repositories_listed":1,"syntology":null},{"url":"/paper/disentangling-multi-view-representations","slug":"disentangling-multi-view-representations","title":"Disentangling Multi-view Representations Beyond Inductive Bias","date":"2023-08-03","arxiv_id":"2308.01634","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-semi-supervised-federated-learning","slug":"efficient-semi-supervised-federated-learning","title":"SemiSFL: Split Federated Learning on Unlabeled and Non-IID Data","date":"2023-07-29","arxiv_id":"2307.15870","repositories_listed":1,"syntology":null},{"url":"/paper/graphdac-a-graph-analytic-approach-to-dynamic","slug":"graphdac-a-graph-analytic-approach-to-dynamic","title":"GraphDAC: A Graph-Analytic Approach to Dynamic Airspace Configuration","date":"2023-07-29","arxiv_id":"2307.15876","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-based-point-cloud-representation","slug":"clustering-based-point-cloud-representation","title":"Clustering based Point Cloud Representation Learning for 3D Analysis","date":"2023-07-27","arxiv_id":"2307.14605","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":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/clustering-based-point-cloud-representation#ran","syntology_url":"https://syntology.ai/paper/2307.14605","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.14605"}},"official":{"repos":["fengzicai/cluster3dseg"],"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/cluster-aware-semi-supervised-learning","slug":"cluster-aware-semi-supervised-learning","title":"Cluster-aware Semi-supervised Learning: Relational Knowledge Distillation Provably Learns Clustering","date":"2023-07-20","arxiv_id":"2307.11030","repositories_listed":1,"syntology":{"n":18,"n_ran":15,"n_constructed":3,"n_ran_checked":14,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":5,"phrase":"15 ran (of which 3 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/cluster-aware-semi-supervised-learning#ran","syntology_url":"https://syntology.ai/paper/2307.11030","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.11030"}},"official":null}},{"url":"/paper/learning-discriminative-visual-text","slug":"learning-discriminative-visual-text","title":"Learning Discriminative Visual-Text Representation for Polyp Re-Identification","date":"2023-07-20","arxiv_id":"2307.10625","repositories_listed":1,"syntology":null},{"url":"/paper/boundary-refined-prototype-generation-a","slug":"boundary-refined-prototype-generation-a","title":"Boundary-Refined Prototype Generation: A General End-to-End Paradigm for Semi-Supervised Semantic Segmentation","date":"2023-07-19","arxiv_id":"2307.10097","repositories_listed":1,"syntology":null},{"url":"/paper/entropy-regularization-in-probabilistic","slug":"entropy-regularization-in-probabilistic","title":"Entropy regularization in probabilistic clustering","date":"2023-07-19","arxiv_id":"2307.10065","repositories_listed":1,"syntology":null},{"url":"/paper/outlier-robust-tensor-low-rank-representation","slug":"outlier-robust-tensor-low-rank-representation","title":"Robust Data Clustering with Outliers via Transformed Tensor Low-Rank Representation","date":"2023-07-18","arxiv_id":"2307.09055","repositories_listed":1,"syntology":null},{"url":"/paper/privacy-preserving-patient-clustering-for","slug":"privacy-preserving-patient-clustering-for","title":"Privacy-preserving patient clustering for personalized federated learning","date":"2023-07-17","arxiv_id":"2307.08847","repositories_listed":1,"syntology":null}],"record_sha256":"8cb9107202a7a5c02117d225a0b2b2308769cc0655c3fe1f129a1d6771792260","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}