{"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/10","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":10,"pages_in_order":108,"rows_per_page":100,"rows":[901,1000],"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/9","next":"/task/clustering/papers/11","papers":[{"url":"/paper/a-testing-based-approach-to-assess-the","slug":"a-testing-based-approach-to-assess-the","title":"Clusterability test for categorical data","date":"2023-07-14","arxiv_id":"2307.07346","repositories_listed":1,"syntology":null},{"url":"/paper/student-assessment-in-cybersecurity-training","slug":"student-assessment-in-cybersecurity-training","title":"Student Assessment in Cybersecurity Training Automated by Pattern Mining and Clustering","date":"2023-07-13","arxiv_id":"2307.10260","repositories_listed":1,"syntology":null},{"url":"/paper/diffusion-subspace-clustering-for","slug":"diffusion-subspace-clustering-for","title":"Diffusion Subspace Clustering for Hyperspectral Images","date":"2023-07-12","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/neuro-inspired-efficient-map-building-via","slug":"neuro-inspired-efficient-map-building-via","title":"Grid Cell-Inspired Fragmentation and Recall for Efficient Map Building","date":"2023-07-11","arxiv_id":"2307.05793","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/neuro-inspired-efficient-map-building-via#ran","syntology_url":"https://syntology.ai/paper/2307.05793","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.05793"}},"official":{"repos":["fietelab/farmap"],"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/novel-categories-discovery-from-probability","slug":"novel-categories-discovery-from-probability","title":"Novel Categories Discovery Via Constraints on Empirical Prediction Statistics","date":"2023-07-07","arxiv_id":"2307.03856","repositories_listed":1,"syntology":null},{"url":"/paper/unpaired-multi-view-graph-clustering-with","slug":"unpaired-multi-view-graph-clustering-with","title":"Unpaired Multi-View Graph Clustering with Cross-View Structure Matching","date":"2023-07-07","arxiv_id":"2307.03476","repositories_listed":1,"syntology":null},{"url":"/paper/dpm-clustering-sensitive-data-through","slug":"dpm-clustering-sensitive-data-through","title":"DPM: Clustering Sensitive Data through Separation","date":"2023-07-06","arxiv_id":"2307.02969","repositories_listed":1,"syntology":null},{"url":"/paper/towards-accurate-instance-segmentation-in","slug":"towards-accurate-instance-segmentation-in","title":"Towards accurate instance segmentation in large-scale LiDAR point clouds","date":"2023-07-06","arxiv_id":"2307.02877","repositories_listed":1,"syntology":null},{"url":"/paper/local-primordial-non-gaussianity-from-the","slug":"local-primordial-non-gaussianity-from-the","title":"Local primordial non-Gaussianity from the large-scale clustering of photometric DESI luminous red galaxies","date":"2023-07-04","arxiv_id":"2307.01753","repositories_listed":1,"syntology":null},{"url":"/paper/emogen-eliminating-subjective-bias-in","slug":"emogen-eliminating-subjective-bias-in","title":"EmoGen: Eliminating Subjective Bias in Emotional Music Generation","date":"2023-07-03","arxiv_id":"2307.01229","repositories_listed":1,"syntology":null},{"url":"/paper/large-language-models-enable-few-shot","slug":"large-language-models-enable-few-shot","title":"Large Language Models Enable Few-Shot Clustering","date":"2023-07-02","arxiv_id":"2307.00524","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/large-language-models-enable-few-shot#ran","syntology_url":"https://syntology.ai/paper/2307.00524","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.00524"}},"official":{"repos":["viswavi/few-shot-clustering"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-relationship-between-rnn-hidden-state","slug":"on-the-relationship-between-rnn-hidden-state","title":"On the Relationship Between RNN Hidden State Vectors and Semantic Ground Truth","date":"2023-06-29","arxiv_id":"2306.16854","repositories_listed":1,"syntology":null},{"url":"/paper/cuslink-single-linkage-agglomerative","slug":"cuslink-single-linkage-agglomerative","title":"cuSLINK: Single-linkage Agglomerative Clustering on the GPU","date":"2023-06-28","arxiv_id":"2306.16354","repositories_listed":1,"syntology":null},{"url":"/paper/non-parametric-online-market-regime-detection","slug":"non-parametric-online-market-regime-detection","title":"Non-parametric online market regime detection and regime clustering for multidimensional and path-dependent data structures","date":"2023-06-27","arxiv_id":"2306.15835","repositories_listed":1,"syntology":null},{"url":"/paper/a-clustering-and-graph-deep-learning-based","slug":"a-clustering-and-graph-deep-learning-based","title":"A clustering and graph deep learning-based framework for COVID-19 drug repurposing","date":"2023-06-24","arxiv_id":"2306.13995","repositories_listed":1,"syntology":null},{"url":"/paper/a-new-paradigm-for-generative-adversarial","slug":"a-new-paradigm-for-generative-adversarial","title":"A New Paradigm for Generative Adversarial Networks based on Randomized Decision Rules","date":"2023-06-23","arxiv_id":"2306.13641","repositories_listed":1,"syntology":null},{"url":"/paper/an-interactive-interface-for-novel-class","slug":"an-interactive-interface-for-novel-class","title":"An Interactive Interface for Novel Class Discovery in Tabular Data","date":"2023-06-22","arxiv_id":"2306.12919","repositories_listed":1,"syntology":null},{"url":"/paper/augdmc-data-augmentation-guided-deep-multiple","slug":"augdmc-data-augmentation-guided-deep-multiple","title":"AugDMC: Data Augmentation Guided Deep Multiple Clustering","date":"2023-06-22","arxiv_id":"2306.13023","repositories_listed":1,"syntology":null},{"url":"/paper/deep-double-self-expressive-subspace","slug":"deep-double-self-expressive-subspace","title":"Deep Double Self-Expressive Subspace Clustering","date":"2023-06-20","arxiv_id":"2306.11592","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-double-self-expressive-subspace#ran","syntology_url":"https://syntology.ai/paper/2306.11592","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.11592"}},"official":{"repos":["zhaoling0229/dsesc"],"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/nearly-optimal-hierarchical-clustering-for","slug":"nearly-optimal-hierarchical-clustering-for","title":"Nearly-Optimal Hierarchical Clustering for Well-Clustered Graphs","date":"2023-06-16","arxiv_id":"2306.09950","repositories_listed":1,"syntology":null},{"url":"/paper/pushing-the-limits-of-unsupervised-unit","slug":"pushing-the-limits-of-unsupervised-unit","title":"Pushing the Limits of Unsupervised Unit Discovery for SSL Speech Representation","date":"2023-06-15","arxiv_id":"2306.08920","repositories_listed":1,"syntology":null},{"url":"/paper/multi-class-graph-clustering-via-approximated","slug":"multi-class-graph-clustering-via-approximated","title":"Multi-class Graph Clustering via Approximated Effective $p$-Resistance","date":"2023-06-14","arxiv_id":"2306.08617","repositories_listed":1,"syntology":null},{"url":"/paper/provably-personalized-and-robust-federated","slug":"provably-personalized-and-robust-federated","title":"Provably Personalized and Robust Federated Learning","date":"2023-06-14","arxiv_id":"2306.08393","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-learning-made-simple-with-1","slug":"semi-supervised-learning-made-simple-with-1","title":"Semi-supervised learning made simple with self-supervised clustering","date":"2023-06-13","arxiv_id":"2306.07483","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"2 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/semi-supervised-learning-made-simple-with-1#ran","syntology_url":"https://syntology.ai/paper/2306.07483","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.07483"}},"official":{"repos":["pietroastolfi/suave-daino"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-computational-theory-and-semi-supervised","slug":"a-computational-theory-and-semi-supervised","title":"A Computational Theory and Semi-Supervised Algorithm for Clustering","date":"2023-06-12","arxiv_id":"2306.06974","repositories_listed":1,"syntology":null},{"url":"/paper/compositor-bottom-up-clustering-and-1","slug":"compositor-bottom-up-clustering-and-1","title":"Compositor: Bottom-up Clustering and Compositing for Robust Part and Object Segmentation","date":"2023-06-12","arxiv_id":"2306.07404","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/compositor-bottom-up-clustering-and-1#ran","syntology_url":"https://syntology.ai/paper/2306.07404","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.07404"}},"official":{"repos":["tacju/compositor"],"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/strokes2surface-recovering-curve-networks","slug":"strokes2surface-recovering-curve-networks","title":"Strokes2Surface: Recovering Curve Networks From 4D Architectural Design Sketches","date":"2023-06-12","arxiv_id":"2306.07220","repositories_listed":1,"syntology":null},{"url":"/paper/faster-approximation-algorithms-for","slug":"faster-approximation-algorithms-for","title":"Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling","date":"2023-06-08","arxiv_id":"2306.04884","repositories_listed":1,"syntology":null},{"url":"/paper/image-clustering-via-the-principle-of-rate","slug":"image-clustering-via-the-principle-of-rate","title":"Image Clustering via the Principle of Rate Reduction in the Age of Pretrained Models","date":"2023-06-08","arxiv_id":"2306.05272","repositories_listed":1,"syntology":null},{"url":"/paper/subject-clustering-by-if-pca-and-several","slug":"subject-clustering-by-if-pca-and-several","title":"Subject clustering by IF-PCA and several recent methods","date":"2023-06-08","arxiv_id":"2306.05363","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-bootstrapping-for-label","slug":"contrastive-bootstrapping-for-label","title":"Contrastive Bootstrapping for Label Refinement","date":"2023-06-07","arxiv_id":"2306.04544","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-lift-3d-object-instance","slug":"contrastive-lift-3d-object-instance","title":"Contrastive Lift: 3D Object Instance Segmentation by Slow-Fast Contrastive Fusion","date":"2023-06-07","arxiv_id":"2306.04633","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":0,"n_no_contract":1,"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, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/contrastive-lift-3d-object-instance#ran","syntology_url":"https://syntology.ai/paper/2306.04633","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.04633"}},"official":{"repos":["yashbhalgat/contrastive-lift"],"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/interpretable-deep-clustering","slug":"interpretable-deep-clustering","title":"Interpretable Deep Clustering for Tabular Data","date":"2023-06-07","arxiv_id":"2306.04785","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-differentiable-clustering-with","slug":"end-to-end-differentiable-clustering-with","title":"End-to-end Differentiable Clustering with Associative Memories","date":"2023-06-05","arxiv_id":"2306.03209","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/end-to-end-differentiable-clustering-with#ran","syntology_url":"https://syntology.ai/paper/2306.03209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.03209"}},"official":{"repos":["bsaha205/clam"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/affinity-clustering-framework-for-data","slug":"affinity-clustering-framework-for-data","title":"Affinity Clustering Framework for Data Debiasing Using Pairwise Distribution Discrepancy","date":"2023-06-02","arxiv_id":"2306.01699","repositories_listed":1,"syntology":null},{"url":"/paper/addressing-negative-transfer-in-diffusion-1","slug":"addressing-negative-transfer-in-diffusion-1","title":"Addressing Negative Transfer in Diffusion Models","date":"2023-06-01","arxiv_id":"2306.00354","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/addressing-negative-transfer-in-diffusion-1#ran","syntology_url":"https://syntology.ai/paper/2306.00354","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.00354"}},"official":{"repos":["gohyojun15/ANT_diffusion"],"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/byzantine-robust-clustered-federated-learning","slug":"byzantine-robust-clustered-federated-learning","title":"Byzantine-Robust Clustered Federated Learning","date":"2023-06-01","arxiv_id":"2306.00638","repositories_listed":1,"syntology":null},{"url":"/paper/learning-the-right-layers-a-data-driven-layer","slug":"learning-the-right-layers-a-data-driven-layer","title":"Learning the Right Layers: a Data-Driven Layer-Aggregation Strategy for Semi-Supervised Learning on Multilayer Graphs","date":"2023-05-31","arxiv_id":"2306.00152","repositories_listed":1,"syntology":null},{"url":"/paper/deep-clustering-with-incomplete-noisy","slug":"deep-clustering-with-incomplete-noisy","title":"Deep Clustering with Incomplete Noisy Pairwise Annotations: A Geometric Regularization Approach","date":"2023-05-30","arxiv_id":"2305.19391","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":0,"n_no_contract":1,"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, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-clustering-with-incomplete-noisy#ran","syntology_url":"https://syntology.ai/paper/2305.19391","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19391"}},"official":{"repos":["ductri/volmaxdcc"],"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/graph-based-time-series-clustering-for-end-to","slug":"graph-based-time-series-clustering-for-end-to","title":"Graph-based Time Series Clustering for End-to-End Hierarchical Forecasting","date":"2023-05-30","arxiv_id":"2305.19183","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/graph-based-time-series-clustering-for-end-to#ran","syntology_url":"https://syntology.ai/paper/2305.19183","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19183"}},"official":{"repos":["andreacini/higp"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/commonsense-knowledge-graph-completion-via","slug":"commonsense-knowledge-graph-completion-via","title":"Commonsense Knowledge Graph Completion Via Contrastive Pretraining and Node Clustering","date":"2023-05-26","arxiv_id":"2305.17019","repositories_listed":1,"syntology":null},{"url":"/paper/gc-flow-a-graph-based-flow-network-for","slug":"gc-flow-a-graph-based-flow-network-for","title":"GC-Flow: A Graph-Based Flow Network for Effective Clustering","date":"2023-05-26","arxiv_id":"2305.17284","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/gc-flow-a-graph-based-flow-network-for#ran","syntology_url":"https://syntology.ai/paper/2305.17284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.17284"}},"official":{"repos":["xztcwang/gcflow"],"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/pre-training-meets-clustering-a-hybrid","slug":"pre-training-meets-clustering-a-hybrid","title":"Pre-training Meets Clustering: A Hybrid Extractive Multi-document Summarization Model","date":"2023-05-25","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/clusterllm-large-language-models-as-a-guide","slug":"clusterllm-large-language-models-as-a-guide","title":"ClusterLLM: Large Language Models as a Guide for Text Clustering","date":"2023-05-24","arxiv_id":"2305.14871","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/clusterllm-large-language-models-as-a-guide#ran","syntology_url":"https://syntology.ai/paper/2305.14871","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14871"}},"official":{"repos":["zhang-yu-wei/clusterllm"],"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/fairness-in-streaming-submodular-maximization-1","slug":"fairness-in-streaming-submodular-maximization-1","title":"Fairness in Streaming Submodular Maximization over a Matroid Constraint","date":"2023-05-24","arxiv_id":"2305.15118","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-clustering-with-dot-products-1","slug":"hierarchical-clustering-with-dot-products-1","title":"Hierarchical clustering with dot products recovers hidden tree structure","date":"2023-05-24","arxiv_id":"2305.15022","repositories_listed":1,"syntology":null},{"url":"/paper/reverse-engineering-self-supervised-learning-1","slug":"reverse-engineering-self-supervised-learning-1","title":"Reverse Engineering Self-Supervised Learning","date":"2023-05-24","arxiv_id":"2305.15614","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-indices-based-automatic","slug":"clustering-indices-based-automatic","title":"Clustering Indices based Automatic Classification Model Selection","date":"2023-05-23","arxiv_id":"2305.13926","repositories_listed":1,"syntology":null},{"url":"/paper/diva-a-dirichlet-process-based-incremental","slug":"diva-a-dirichlet-process-based-incremental","title":"DIVA: A Dirichlet Process Mixtures Based Incremental Deep Clustering Algorithm via Variational Auto-Encoder","date":"2023-05-23","arxiv_id":"2305.14067","repositories_listed":1,"syntology":null},{"url":"/paper/goal-driven-explainable-clustering-via","slug":"goal-driven-explainable-clustering-via","title":"Goal-Driven Explainable Clustering via Language Descriptions","date":"2023-05-23","arxiv_id":"2305.13749","repositories_listed":1,"syntology":null},{"url":"/paper/robust-representation-learning-with-reliable","slug":"robust-representation-learning-with-reliable","title":"Robust Representation Learning with Reliable Pseudo-labels Generation via Self-Adaptive Optimal Transport for Short Text Clustering","date":"2023-05-23","arxiv_id":"2305.16335","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/robust-representation-learning-with-reliable#ran","syntology_url":"https://syntology.ai/paper/2305.16335","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.16335"}},"official":{"repos":["hmllmh/rstc"],"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/funloci-a-local-clustering-algorithm-for","slug":"funloci-a-local-clustering-algorithm-for","title":"funLOCI: a local clustering algorithm for functional data","date":"2023-05-22","arxiv_id":"2305.12991","repositories_listed":1,"syntology":null},{"url":"/paper/one-step-multiview-fuzzy-clustering-with","slug":"one-step-multiview-fuzzy-clustering-with","title":"One-Step Multiview Fuzzy Clustering With Collaborative Learning Between Common and Specific Hidden Space Information","date":"2023-05-22","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/semantic-invariant-multi-view-clustering-with","slug":"semantic-invariant-multi-view-clustering-with","title":"Semantic Invariant Multi-view Clustering with Fully Incomplete Information","date":"2023-05-22","arxiv_id":"2305.12743","repositories_listed":1,"syntology":null},{"url":"/paper/communication-efficient-federated-learning-19","slug":"communication-efficient-federated-learning-19","title":"Communication Efficient Federated Learning for Multilingual Neural Machine Translation with Adapter","date":"2023-05-21","arxiv_id":"2305.12449","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-fine-tuning-for-improved","slug":"self-supervised-fine-tuning-for-improved","title":"Self-supervised Fine-tuning for Improved Content Representations by Speaker-invariant Clustering","date":"2023-05-18","arxiv_id":"2305.11072","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"3 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/self-supervised-fine-tuning-for-improved#ran","syntology_url":"https://syntology.ai/paper/2305.11072","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.11072"}},"official":{"repos":["vectominist/spin"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/clustering-aware-negative-sampling-for","slug":"clustering-aware-negative-sampling-for","title":"Clustering-Aware Negative Sampling for Unsupervised Sentence Representation","date":"2023-05-17","arxiv_id":"2305.09892","repositories_listed":1,"syntology":null},{"url":"/paper/dinosr-self-distillation-and-online","slug":"dinosr-self-distillation-and-online","title":"DinoSR: Self-Distillation and Online Clustering for Self-supervised Speech Representation Learning","date":"2023-05-17","arxiv_id":"2305.10005","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-inductive-biases-in-contrastive","slug":"exploring-inductive-biases-in-contrastive","title":"How does Contrastive Learning Organize Images?","date":"2023-05-17","arxiv_id":"2305.10229","repositories_listed":1,"syntology":null},{"url":"/paper/time-series-clustering-with-random","slug":"time-series-clustering-with-random","title":"Time Series Clustering With Random Convolutional Kernels","date":"2023-05-17","arxiv_id":"2305.10457","repositories_listed":1,"syntology":null},{"url":"/paper/a-dimensionality-reduction-approach-to-model","slug":"a-dimensionality-reduction-approach-to-model","title":"Intrinsic statistical separation of subpopulations in heterogeneous collective motion via dimensionality reduction","date":"2023-05-16","arxiv_id":"2305.09189","repositories_listed":1,"syntology":null},{"url":"/paper/multi-view-mera-subspace-clustering","slug":"multi-view-mera-subspace-clustering","title":"Multi-view MERA Subspace Clustering","date":"2023-05-16","arxiv_id":"2305.09095","repositories_listed":1,"syntology":null},{"url":"/paper/spectral-clustering-via-orthogonalization","slug":"spectral-clustering-via-orthogonalization","title":"Spectral Clustering via Orthogonalization-Free Methods","date":"2023-05-16","arxiv_id":"2305.10356","repositories_listed":1,"syntology":null},{"url":"/paper/deep-multi-view-subspace-clustering-with","slug":"deep-multi-view-subspace-clustering-with","title":"Deep Multi-View Subspace Clustering with Anchor Graph","date":"2023-05-11","arxiv_id":"2305.06939","repositories_listed":1,"syntology":null},{"url":"/paper/gcfagg-global-and-cross-view-feature","slug":"gcfagg-global-and-cross-view-feature","title":"GCFAgg: Global and Cross-view Feature Aggregation for Multi-view Clustering","date":"2023-05-11","arxiv_id":"2305.06799","repositories_listed":1,"syntology":null},{"url":"/paper/cone-unsupervised-contrastive-opinion","slug":"cone-unsupervised-contrastive-opinion","title":"Cone: Unsupervised Contrastive Opinion Extraction","date":"2023-05-08","arxiv_id":"2305.04599","repositories_listed":1,"syntology":null},{"url":"/paper/persistent-homology-of-the-multiscale","slug":"persistent-homology-of-the-multiscale","title":"Analysing Multiscale Clusterings with Persistent Homology","date":"2023-05-07","arxiv_id":"2305.04281","repositories_listed":1,"syntology":null},{"url":"/paper/transformer-based-hierarchical-clustering-for","slug":"transformer-based-hierarchical-clustering-for","title":"Transformer-Based Hierarchical Clustering for Brain Network Analysis","date":"2023-05-06","arxiv_id":"2305.04142","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-graph-convolutional-subspace","slug":"adaptive-graph-convolutional-subspace","title":"Adaptive Graph Convolutional Subspace Clustering","date":"2023-05-05","arxiv_id":"2305.03414","repositories_listed":1,"syntology":null},{"url":"/paper/influence-of-various-text-embeddings-on","slug":"influence-of-various-text-embeddings-on","title":"Influence of various text embeddings on clustering performance in NLP","date":"2023-05-04","arxiv_id":"2305.03144","repositories_listed":1,"syntology":null},{"url":"/paper/quantifying-the-dissimilarity-of-texts","slug":"quantifying-the-dissimilarity-of-texts","title":"Quantifying the Dissimilarity of Texts","date":"2023-05-03","arxiv_id":"2305.02457","repositories_listed":1,"syntology":null},{"url":"/paper/a-parameter-free-adaptive-resonance-theory","slug":"a-parameter-free-adaptive-resonance-theory","title":"A Parameter-free Adaptive Resonance Theory-based Topological Clustering Algorithm Capable of Continual Learning","date":"2023-05-01","arxiv_id":"2305.01507","repositories_listed":1,"syntology":null},{"url":"/paper/low-rank-tensor-based-proximity-learning-for","slug":"low-rank-tensor-based-proximity-learning-for","title":"Low-Rank Tensor Based Proximity Learning for Multi-View Clustering","date":"2023-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/hypergraphs-with-edge-dependent-vertex-1","slug":"hypergraphs-with-edge-dependent-vertex-1","title":"Hypergraphs with Edge-Dependent Vertex Weights: Spectral Clustering based on the 1-Laplacian","date":"2023-04-30","arxiv_id":"2305.00462","repositories_listed":1,"syntology":null},{"url":"/paper/clusternet-a-perception-based-clustering","slug":"clusternet-a-perception-based-clustering","title":"HPSCAN: Human Perception-Based Scattered Data Clustering","date":"2023-04-27","arxiv_id":"2304.14185","repositories_listed":1,"syntology":null},{"url":"/paper/deep-spatiotemporal-clustering-a-temporal","slug":"deep-spatiotemporal-clustering-a-temporal","title":"Deep Spatiotemporal Clustering: A Temporal Clustering Approach for Multi-dimensional Climate Data","date":"2023-04-27","arxiv_id":"2304.14541","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-spatiotemporal-clustering-a-temporal#ran","syntology_url":"https://syntology.ai/paper/2304.14541","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.14541"}},"official":{"repos":["big-data-lab-umbc/multivariate-weather-data-clustering"],"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"]}}},{"url":"/paper/rotation-and-translation-invariant","slug":"rotation-and-translation-invariant","title":"Rotation and Translation Invariant Representation Learning with Implicit Neural Representations","date":"2023-04-27","arxiv_id":"2304.13995","repositories_listed":1,"syntology":null},{"url":"/paper/federated-learning-with-uncertainty-based","slug":"federated-learning-with-uncertainty-based","title":"Federated Learning with Uncertainty-Based Client Clustering for Fleet-Wide Fault Diagnosis","date":"2023-04-26","arxiv_id":"2304.13275","repositories_listed":1,"syntology":null},{"url":"/paper/pseudo-labels-refinement-with-intra-camera","slug":"pseudo-labels-refinement-with-intra-camera","title":"Pseudo Labels Refinement with Intra-camera Similarity for Unsupervised Person Re-identification","date":"2023-04-25","arxiv_id":"2304.12634","repositories_listed":1,"syntology":null},{"url":"/paper/deep-multiview-clustering-by-contrasting","slug":"deep-multiview-clustering-by-contrasting","title":"Deep Multiview Clustering by Contrasting Cluster Assignments","date":"2023-04-21","arxiv_id":"2304.10769","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/deep-multiview-clustering-by-contrasting#ran","syntology_url":"https://syntology.ai/paper/2304.10769","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.10769"}},"official":{"repos":["chenjie20/cvcl"],"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/contrastive-tuning-a-little-help-to-make","slug":"contrastive-tuning-a-little-help-to-make","title":"Contrastive Tuning: A Little Help to Make Masked Autoencoders Forget","date":"2023-04-20","arxiv_id":"2304.10520","repositories_listed":1,"syntology":null},{"url":"/paper/ckmeans-and-fckmeans-two-deterministic","slug":"ckmeans-and-fckmeans-two-deterministic","title":"CKmeans and FCKmeans : Two deterministic initialization procedures for Kmeans algorithm using a modified crowding distance","date":"2023-04-19","arxiv_id":"2304.09989","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-semantic-segmentation-of-3d","slug":"unsupervised-semantic-segmentation-of-3d","title":"PointDC:Unsupervised Semantic Segmentation of 3D Point Clouds via Cross-modal Distillation and Super-Voxel Clustering","date":"2023-04-18","arxiv_id":"2304.08965","repositories_listed":1,"syntology":null},{"url":"/paper/usnid-a-framework-for-unsupervised-and-semi","slug":"usnid-a-framework-for-unsupervised-and-semi","title":"A Clustering Framework for Unsupervised and Semi-supervised New Intent Discovery","date":"2023-04-16","arxiv_id":"2304.07699","repositories_listed":1,"syntology":null},{"url":"/paper/cipr-an-efficient-framework-with-cross","slug":"cipr-an-efficient-framework-with-cross","title":"CiPR: An Efficient Framework with Cross-instance Positive Relations for Generalized Category Discovery","date":"2023-04-14","arxiv_id":"2304.06928","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/cipr-an-efficient-framework-with-cross#ran","syntology_url":"https://syntology.ai/paper/2304.06928","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.06928"}},"official":{"repos":["haoosz/cipr"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/leveraging-triplet-loss-for-unsupervised","slug":"leveraging-triplet-loss-for-unsupervised","title":"Leveraging triplet loss for unsupervised action segmentation","date":"2023-04-13","arxiv_id":"2304.06403","repositories_listed":1,"syntology":null},{"url":"/paper/monte-carlo-linear-clustering-with-single","slug":"monte-carlo-linear-clustering-with-single","title":"Monte Carlo Linear Clustering with Single-Point Supervision is Enough for Infrared Small Target Detection","date":"2023-04-10","arxiv_id":"2304.04442","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/monte-carlo-linear-clustering-with-single#ran","syntology_url":"https://syntology.ai/paper/2304.04442","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.04442"}},"official":{"repos":["yeren123455/sirst-single-point-supervision"],"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/spectral-toolkit-of-algorithms-for-graphs","slug":"spectral-toolkit-of-algorithms-for-graphs","title":"Spectral Toolkit of Algorithms for Graphs: Technical Report (1)","date":"2023-04-05","arxiv_id":"2304.03170","repositories_listed":1,"syntology":null},{"url":"/paper/divclust-controlling-diversity-in-deep","slug":"divclust-controlling-diversity-in-deep","title":"DivClust: Controlling Diversity in Deep Clustering","date":"2023-04-03","arxiv_id":"2304.01042","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/divclust-controlling-diversity-in-deep#ran","syntology_url":"https://syntology.ai/paper/2304.01042","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.01042"}},"official":{"repos":["maniadisg/divclust"],"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/exploring-the-limits-of-deep-image-clustering","slug":"exploring-the-limits-of-deep-image-clustering","title":"Exploring the Limits of Deep Image Clustering using Pretrained Models","date":"2023-03-31","arxiv_id":"2303.17896","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exploring-the-limits-of-deep-image-clustering#ran","syntology_url":"https://syntology.ai/paper/2303.17896","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.17896"}},"official":{"repos":["HHU-MMBS/TEMI-official-BMVC2023"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/investigating-and-mitigating-the-side-effects","slug":"investigating-and-mitigating-the-side-effects","title":"Investigating and Mitigating the Side Effects of Noisy Views for Self-Supervised Clustering Algorithms in Practical Multi-View Scenarios","date":"2023-03-30","arxiv_id":"2303.17245","repositories_listed":1,"syntology":null},{"url":"/paper/hard-regularization-to-prevent-collapse-in","slug":"hard-regularization-to-prevent-collapse-in","title":"Hard Regularization to Prevent Deep Online Clustering Collapse without Data Augmentation","date":"2023-03-29","arxiv_id":"2303.16521","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-learning-is-spectral-clustering","slug":"contrastive-learning-is-spectral-clustering","title":"Contrastive Learning Is Spectral Clustering On Similarity Graph","date":"2023-03-27","arxiv_id":"2303.15103","repositories_listed":1,"syntology":null},{"url":"/paper/shapley-based-explainable-ai-for-clustering","slug":"shapley-based-explainable-ai-for-clustering","title":"Shapley-based Explainable AI for Clustering Applications in Fault Diagnosis and Prognosis","date":"2023-03-25","arxiv_id":"2303.14581","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-clustering-of-multivariate","slug":"self-supervised-clustering-of-multivariate","title":"Identifying TBI Physiological States by Clustering Multivariate Clinical Time-Series Data","date":"2023-03-23","arxiv_id":"2303.13024","repositories_listed":1,"syntology":null},{"url":"/paper/mv-mr-multi-views-and-multi-representations","slug":"mv-mr-multi-views-and-multi-representations","title":"MV-MR: multi-views and multi-representations for self-supervised learning and knowledge distillation","date":"2023-03-21","arxiv_id":"2303.12130","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-realistic-test-time-training-1","slug":"revisiting-realistic-test-time-training-1","title":"Revisiting Realistic Test-Time Training: Sequential Inference and Adaptation by Anchored Clustering Regularized Self-Training","date":"2023-03-20","arxiv_id":"2303.10856","repositories_listed":1,"syntology":null},{"url":"/paper/estimating-the-repertoire-size-in-birds-using","slug":"estimating-the-repertoire-size-in-birds-using","title":"Estimating the Repertoire Size in Birds using Unsupervised Clustering techniques","date":"2023-03-19","arxiv_id":"2303.10678","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-effects-of-self-supervision-and","slug":"on-the-effects-of-self-supervision-and","title":"On the Effects of Self-supervision and Contrastive Alignment in Deep Multi-view Clustering","date":"2023-03-17","arxiv_id":"2303.09877","repositories_listed":1,"syntology":{"n":12,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":11,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 1 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-the-effects-of-self-supervision-and#ran","syntology_url":"https://syntology.ai/paper/2303.09877","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.09877"}},"official":{"repos":["danieltrosten/deepmvc"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multiway-clustering-of-3-order-tensor-via","slug":"multiway-clustering-of-3-order-tensor-via","title":"Multiway clustering of 3-order tensor via affinity matrix","date":"2023-03-14","arxiv_id":"2303.07757","repositories_listed":1,"syntology":null}],"record_sha256":"0c09afd07d069406dfe7e5898a27570abaaa04dab49803fa1b75d627b4e4f22f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}