{"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/14","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":14,"pages_in_order":108,"rows_per_page":100,"rows":[1301,1400],"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/13","next":"/task/clustering/papers/15","papers":[{"url":"/paper/unsupervised-salient-object-detection-with","slug":"unsupervised-salient-object-detection-with","title":"Unsupervised Salient Object Detection with Spectral Cluster Voting","date":"2022-03-23","arxiv_id":"2203.12614","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"5 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; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/unsupervised-salient-object-detection-with#ran","syntology_url":"https://syntology.ai/paper/2203.12614","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.12614"}},"official":{"repos":["noelshin/selfmask"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/clustering-units-in-neural-networks-upstream","slug":"clustering-units-in-neural-networks-upstream","title":"Clustering units in neural networks: upstream vs downstream information","date":"2022-03-22","arxiv_id":"2203.11815","repositories_listed":1,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/clustering-units-in-neural-networks-upstream#ran","syntology_url":"https://syntology.ai/paper/2203.11815","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.11815"}},"official":{"repos":["wrongu/modularity"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-multi-view-clustering-via-ensembles","slug":"fast-multi-view-clustering-via-ensembles","title":"Fast Multi-view Clustering via Ensembles: Towards Scalability, Superiority, and Simplicity","date":"2022-03-22","arxiv_id":"2203.11572","repositories_listed":1,"syntology":null},{"url":"/paper/learning-patch-to-cluster-attention-in-vision","slug":"learning-patch-to-cluster-attention-in-vision","title":"PaCa-ViT: Learning Patch-to-Cluster Attention in Vision Transformers","date":"2022-03-22","arxiv_id":"2203.11987","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/learning-patch-to-cluster-attention-in-vision#ran","syntology_url":"https://syntology.ai/paper/2203.11987","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.11987"}},"official":{"repos":["ivmcl/pacavit"],"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/facemap-towards-unsupervised-face-clustering","slug":"facemap-towards-unsupervised-face-clustering","title":"FaceMap: Towards Unsupervised Face Clustering via Map Equation","date":"2022-03-21","arxiv_id":"2203.10090","repositories_listed":1,"syntology":null},{"url":"/paper/inference-of-b-cell-clonal-families-using","slug":"inference-of-b-cell-clonal-families-using","title":"Inference of B cell clonal families using heavy/light chain pairing information","date":"2022-03-21","arxiv_id":"2203.11367","repositories_listed":1,"syntology":null},{"url":"/paper/cluster-tune-boost-cold-start-performance-in","slug":"cluster-tune-boost-cold-start-performance-in","title":"Cluster & Tune: Boost Cold Start Performance in Text Classification","date":"2022-03-20","arxiv_id":"2203.10581","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/cluster-tune-boost-cold-start-performance-in#ran","syntology_url":"https://syntology.ai/paper/2203.10581","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10581"}},"official":{"repos":["ibm/intermediate-training-using-clustering"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/class-wise-classifier-design-capable-of","slug":"class-wise-classifier-design-capable-of","title":"Class-wise Classifier Design Capable of Continual Learning using Adaptive Resonance Theory-based Topological Clustering","date":"2022-03-18","arxiv_id":"2203.09879","repositories_listed":1,"syntology":null},{"url":"/paper/diffusion-and-volume-maximization-based","slug":"diffusion-and-volume-maximization-based","title":"Unsupervised Diffusion and Volume Maximization-Based Clustering of Hyperspectral Images","date":"2022-03-18","arxiv_id":"2203.09992","repositories_listed":1,"syntology":null},{"url":"/paper/hypergraph-modeling-via-spectral-embedding","slug":"hypergraph-modeling-via-spectral-embedding","title":"Hypergraph Modeling via Spectral Embedding Connection: Hypergraph Cut, Weighted Kernel $k$-means, and Heat Kernel","date":"2022-03-18","arxiv_id":"2203.09888","repositories_listed":1,"syntology":null},{"url":"/paper/deeplss-breaking-parameter-degeneracies-in","slug":"deeplss-breaking-parameter-degeneracies-in","title":"DeepLSS: breaking parameter degeneracies in large scale structure with deep learning analysis of combined probes","date":"2022-03-17","arxiv_id":"2203.09616","repositories_listed":1,"syntology":null},{"url":"/paper/sticc-a-multivariate-spatial-clustering","slug":"sticc-a-multivariate-spatial-clustering","title":"STICC: A multivariate spatial clustering method for repeated geographic pattern discovery with consideration of spatial contiguity","date":"2022-03-17","arxiv_id":"2203.09611","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":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sticc-a-multivariate-spatial-clustering#ran","syntology_url":"https://syntology.ai/paper/2203.09611","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.09611"}},"official":{"repos":["geods/sticc"],"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/improving-event-representation-via","slug":"improving-event-representation-via","title":"Improving Event Representation via Simultaneous Weakly Supervised Contrastive Learning and Clustering","date":"2022-03-15","arxiv_id":"2203.07633","repositories_listed":1,"syntology":null},{"url":"/paper/seeking-commonness-and-inconsistencies-a","slug":"seeking-commonness-and-inconsistencies-a","title":"Seeking Commonness and Inconsistencies: A Jointly Smoothed Approach to Multi-view Subspace Clustering","date":"2022-03-15","arxiv_id":"2203.08060","repositories_listed":1,"syntology":null},{"url":"/paper/lidar-based-4d-panoptic-segmentation-via","slug":"lidar-based-4d-panoptic-segmentation-via","title":"LiDAR-based 4D Panoptic Segmentation via Dynamic Shifting Network","date":"2022-03-14","arxiv_id":"2203.07186","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":2,"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/lidar-based-4d-panoptic-segmentation-via#ran","syntology_url":"https://syntology.ai/paper/2203.07186","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.07186"}},"official":{"repos":["hongfz16/DS-Net"],"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/on-a-linear-fused-gromov-wasserstein-distance","slug":"on-a-linear-fused-gromov-wasserstein-distance","title":"On a linear fused Gromov-Wasserstein distance for graph structured data","date":"2022-03-09","arxiv_id":"2203.04711","repositories_listed":1,"syntology":null},{"url":"/paper/new-coresets-for-projective-clustering-and","slug":"new-coresets-for-projective-clustering-and","title":"New Coresets for Projective Clustering and Applications","date":"2022-03-08","arxiv_id":"2203.04370","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/new-coresets-for-projective-clustering-and#ran","syntology_url":"https://syntology.ai/paper/2203.04370","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.04370"}},"official":{"repos":["muradtuk/projectiveclusteringcoresets"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/no-more-than-6ft-apart-robust-k-means-via","slug":"no-more-than-6ft-apart-robust-k-means-via","title":"No More Than 6ft Apart: Robust K-Means via Radius Upper Bounds","date":"2022-03-04","arxiv_id":"2203.02502","repositories_listed":1,"syntology":null},{"url":"/paper/continuous-relaxation-for-the-multivariate","slug":"continuous-relaxation-for-the-multivariate","title":"Learning Group Importance using the Differentiable Hypergeometric Distribution","date":"2022-03-03","arxiv_id":"2203.01629","repositories_listed":1,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/continuous-relaxation-for-the-multivariate#ran","syntology_url":"https://syntology.ai/paper/2203.01629","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.01629"}},"official":{"repos":["thomassutter/mvhg"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/faster-one-sample-stochastic-conditional","slug":"faster-one-sample-stochastic-conditional","title":"Faster One-Sample Stochastic Conditional Gradient Method for Composite Convex Minimization","date":"2022-02-26","arxiv_id":"2202.13212","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-edges-in-directed-graphs","slug":"clustering-edges-in-directed-graphs","title":"Clustering Edges in Directed Graphs","date":"2022-02-23","arxiv_id":"2202.12265","repositories_listed":1,"syntology":null},{"url":"/paper/many-processors-little-time-mcmc-for","slug":"many-processors-little-time-mcmc-for","title":"Many processors, little time: MCMC for partitions via optimal transport couplings","date":"2022-02-23","arxiv_id":"2202.11258","repositories_listed":1,"syntology":{"n":20,"n_ran":16,"n_constructed":0,"n_ran_checked":16,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":0,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/many-processors-little-time-mcmc-for#ran","syntology_url":"https://syntology.ai/paper/2202.11258","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.11258"}},"official":{"repos":["tinnguyen96/partition-coupling"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/autoclassweb-a-simple-web-interface-for","slug":"autoclassweb-a-simple-web-interface-for","title":"AutoClassWeb: a simple web interface for Bayesian clustering","date":"2022-02-21","arxiv_id":"2202.10253","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-by-the-probability-distributions","slug":"clustering-by-the-probability-distributions","title":"Clustering by the Probability Distributions from Extreme Value Theory","date":"2022-02-20","arxiv_id":"2202.09784","repositories_listed":1,"syntology":null},{"url":"/paper/dissecting-graph-measure-performance-for-node","slug":"dissecting-graph-measure-performance-for-node","title":"Dissecting graph measure performance for node clustering in LFR parameter space","date":"2022-02-20","arxiv_id":"2202.09827","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-by-hill-climbing-consistency","slug":"clustering-by-hill-climbing-consistency","title":"Clustering by Hill-Climbing: Consistency Results","date":"2022-02-18","arxiv_id":"2202.09023","repositories_listed":1,"syntology":null},{"url":"/paper/topic-discovery-via-latent-space-clustering","slug":"topic-discovery-via-latent-space-clustering","title":"Topic Discovery via Latent Space Clustering of Pretrained Language Model Representations","date":"2022-02-09","arxiv_id":"2202.04582","repositories_listed":1,"syntology":null},{"url":"/paper/systematically-improving-existing-k-means","slug":"systematically-improving-existing-k-means","title":"Systematically and efficiently improving $k$-means initialization by pairwise-nearest-neighbor smoothing","date":"2022-02-08","arxiv_id":"2202.03949","repositories_listed":1,"syntology":null},{"url":"/paper/a-least-square-approach-to-semi-supervised","slug":"a-least-square-approach-to-semi-supervised","title":"A Compressed Sensing Based Least Squares Approach to Semi-supervised Local Cluster Extraction","date":"2022-02-07","arxiv_id":"2202.02904","repositories_listed":1,"syntology":null},{"url":"/paper/markovgnn-graph-neural-networks-on-markov","slug":"markovgnn-graph-neural-networks-on-markov","title":"MarkovGNN: Graph Neural Networks on Markov Diffusion","date":"2022-02-05","arxiv_id":"2202.02470","repositories_listed":1,"syntology":null},{"url":"/paper/fast-and-explainable-clustering-based-on","slug":"fast-and-explainable-clustering-based-on","title":"Fast and explainable clustering based on sorting","date":"2022-02-03","arxiv_id":"2202.01456","repositories_listed":1,"syntology":null},{"url":"/paper/graph-coloring-with-physics-inspired-graph","slug":"graph-coloring-with-physics-inspired-graph","title":"Graph Coloring with Physics-Inspired Graph Neural Networks","date":"2022-02-03","arxiv_id":"2202.01606","repositories_listed":1,"syntology":null},{"url":"/paper/dictionary-learning-for-clustering-on","slug":"dictionary-learning-for-clustering-on","title":"Dictionary learning for clustering on hyperspectral images","date":"2022-02-02","arxiv_id":"2202.00990","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-graph-convolution-for-joint-node","slug":"efficient-graph-convolution-for-joint-node","title":"Efficient graph convolution for joint node representation learning and clustering","date":"2022-02-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/subspace-co-clustering-with-two-way-graph","slug":"subspace-co-clustering-with-two-way-graph","title":"Subspace Co-clustering with Two-Way Graph Convolution","date":"2022-02-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fast-distributed-k-means-with-a-small-number","slug":"fast-distributed-k-means-with-a-small-number","title":"Fast Distributed k-Means with a Small Number of Rounds","date":"2022-01-31","arxiv_id":"2201.13217","repositories_listed":1,"syntology":null},{"url":"/paper/spectral-image-clustering-on-dual-energy-ct","slug":"spectral-image-clustering-on-dual-energy-ct","title":"Spectral image clustering on dual-energy CT scans using functional regression mixtures","date":"2022-01-31","arxiv_id":"2201.13398","repositories_listed":1,"syntology":null},{"url":"/paper/neural-manifold-clustering-and-embedding-1","slug":"neural-manifold-clustering-and-embedding-1","title":"Neural Manifold Clustering and Embedding","date":"2022-01-24","arxiv_id":"2201.10000","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/neural-manifold-clustering-and-embedding-1#ran","syntology_url":"https://syntology.ai/paper/2201.10000","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.10000"}},"official":{"repos":["zengyi-li/nmce-release"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/long-term-data-sharing-under-exclusivity","slug":"long-term-data-sharing-under-exclusivity","title":"Long-term Data Sharing under Exclusivity Attacks","date":"2022-01-22","arxiv_id":"2201.09137","repositories_listed":1,"syntology":null},{"url":"/paper/topological-data-analysis-and-clustering","slug":"topological-data-analysis-and-clustering","title":"Topological data analysis and clustering","date":"2022-01-22","arxiv_id":"2201.09054","repositories_listed":1,"syntology":null},{"url":"/paper/sketch-and-lift-scalable-subsampled","slug":"sketch-and-lift-scalable-subsampled","title":"Sketch-and-Lift: Scalable Subsampled Semidefinite Program for $K$-means Clustering","date":"2022-01-20","arxiv_id":"2201.08226","repositories_listed":1,"syntology":null},{"url":"/paper/proposition-level-clustering-for-multi","slug":"proposition-level-clustering-for-multi","title":"Proposition-Level Clustering for Multi-Document Summarization","date":"2022-01-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/offline-online-associated-camera-aware","slug":"offline-online-associated-camera-aware","title":"Offline-Online Associated Camera-Aware Proxies for Unsupervised Person Re-identification","date":"2022-01-15","arxiv_id":"2201.05820","repositories_listed":1,"syntology":null},{"url":"/paper/quantifying-yeast-colony-morphologies-with","slug":"quantifying-yeast-colony-morphologies-with","title":"Quantifying yeast colony morphologies with feature engineering from time-lapse photography","date":"2022-01-14","arxiv_id":"2201.05259","repositories_listed":1,"syntology":null},{"url":"/paper/black-box-safety-analysis-and-retraining-of","slug":"black-box-safety-analysis-and-retraining-of","title":"Black-box Safety Analysis and Retraining of DNNs based on Feature Extraction and Clustering","date":"2022-01-13","arxiv_id":"2201.05077","repositories_listed":1,"syntology":null},{"url":"/paper/spatiotemporal-clustering-with-neyman-scott","slug":"spatiotemporal-clustering-with-neyman-scott","title":"Spatiotemporal Clustering with Neyman-Scott Processes via Connections to Bayesian Nonparametric Mixture Models","date":"2022-01-13","arxiv_id":"2201.05044","repositories_listed":1,"syntology":null},{"url":"/paper/design-and-development-of-pcn-miner-a-tool","slug":"design-and-development-of-pcn-miner-a-tool","title":"Design and Development of PCN-Miner: A tool for the Analysis of Protein Contact Networks","date":"2022-01-12","arxiv_id":"2201.05434","repositories_listed":1,"syntology":null},{"url":"/paper/fine-grained-graph-learning-for-multi-view","slug":"fine-grained-graph-learning-for-multi-view","title":"Fine-grained Graph Learning for Multi-view Subspace Clustering","date":"2022-01-12","arxiv_id":"2201.04604","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-text-using-attention","slug":"clustering-text-using-attention","title":"Clustering Text Using Attention","date":"2022-01-08","arxiv_id":"2201.02816","repositories_listed":1,"syntology":null},{"url":"/paper/k-center-clustering-with-outliers-in-sliding","slug":"k-center-clustering-with-outliers-in-sliding","title":"k-Center Clustering with Outliers in Sliding Windows","date":"2022-01-07","arxiv_id":"2201.02448","repositories_listed":1,"syntology":null},{"url":"/paper/a-cluster-based-trip-prediction-graph-neural","slug":"a-cluster-based-trip-prediction-graph-neural","title":"A Cluster-Based Trip Prediction Graph Neural Network Model for Bike Sharing Systems","date":"2022-01-03","arxiv_id":"2201.00720","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-deep-embedded-subspace-clustering","slug":"efficient-deep-embedded-subspace-clustering","title":"Efficient Deep Embedded Subspace Clustering","date":"2022-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/highly-efficient-incomplete-large-scale-multi","slug":"highly-efficient-incomplete-large-scale-multi","title":"Highly-Efficient Incomplete Large-Scale Multi-View Clustering With Consensus Bipartite Graph","date":"2022-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/node-aligned-graph-convolutional-network-for","slug":"node-aligned-graph-convolutional-network-for","title":"Node-Aligned Graph Convolutional Network for Whole-Slide Image Representation and Classification","date":"2022-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-few-shot-learning-via-multi","slug":"semi-supervised-few-shot-learning-via-multi","title":"Semi-Supervised Few-Shot Learning via Multi-Factor Clustering","date":"2022-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/clustering-vietnamese-conversations-from","slug":"clustering-vietnamese-conversations-from","title":"Clustering Vietnamese Conversations From Facebook Page To Build Training Dataset For Chatbot","date":"2021-12-31","arxiv_id":"2112.15338","repositories_listed":1,"syntology":null},{"url":"/paper/representation-learning-via-consistent","slug":"representation-learning-via-consistent","title":"Representation Learning via Consistent Assignment of Views to Clusters","date":"2021-12-31","arxiv_id":"2112.15421","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-fine-grained-class-clustering-via-1","slug":"contrastive-fine-grained-class-clustering-via-1","title":"Contrastive Fine-grained Class Clustering via Generative Adversarial Networks","date":"2021-12-30","arxiv_id":"2112.14971","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"0 ran · 3 unverified","sample_list":"/paper/contrastive-fine-grained-class-clustering-via-1#ran","syntology_url":"https://syntology.ai/paper/2112.14971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.14971"}},"official":{"repos":["naver-ai/c3-gan"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/a-sampling-based-approach-for-efficient","slug":"a-sampling-based-approach-for-efficient","title":"A sampling-based approach for efficient clustering in large datasets","date":"2021-12-29","arxiv_id":"2112.14793","repositories_listed":1,"syntology":null},{"url":"/paper/shallow-decision-trees-for-explainable-k","slug":"shallow-decision-trees-for-explainable-k","title":"Shallow decision trees for explainable $k$-means clustering","date":"2021-12-29","arxiv_id":"2112.14718","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/shallow-decision-trees-for-explainable-k#ran","syntology_url":"https://syntology.ai/paper/2112.14718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.14718"}},"official":{"repos":["lmurtinho/shallowtree"],"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":["found_in_text","official"]}}},{"url":"/paper/delving-into-probabilistic-uncertainty-for","slug":"delving-into-probabilistic-uncertainty-for","title":"Delving into Probabilistic Uncertainty for Unsupervised Domain Adaptive Person Re-Identification","date":"2021-12-28","arxiv_id":"2112.14025","repositories_listed":1,"syntology":null},{"url":"/paper/gpu-accelerated-faster-mean-shift-with","slug":"gpu-accelerated-faster-mean-shift-with","title":"GPU-accelerated Faster Mean Shift with euclidean distance metrics","date":"2021-12-27","arxiv_id":"2112.13891","repositories_listed":1,"syntology":null},{"url":"/paper/ensemble-method-for-cluster-number","slug":"ensemble-method-for-cluster-number","title":"Ensemble Method for Cluster Number Determination and Algorithm Selection in Unsupervised Learning","date":"2021-12-23","arxiv_id":"2112.13680","repositories_listed":1,"syntology":null},{"url":"/paper/tfw2v-an-enhanced-document-similarity-method","slug":"tfw2v-an-enhanced-document-similarity-method","title":"TFW2V: An Enhanced Document Similarity Method for the Morphologically Rich Finnish Language","date":"2021-12-23","arxiv_id":"2112.12489","repositories_listed":1,"syntology":null},{"url":"/paper/repbin-constraint-based-graph-representation","slug":"repbin-constraint-based-graph-representation","title":"RepBin: Constraint-based Graph Representation Learning for Metagenomic Binning","date":"2021-12-22","arxiv_id":"2112.11696","repositories_listed":1,"syntology":null},{"url":"/paper/an-iterative-clustering-algorithm-for-the","slug":"an-iterative-clustering-algorithm-for-the","title":"An iterative clustering algorithm for the Contextual Stochastic Block Model with optimality guarantees","date":"2021-12-20","arxiv_id":"2112.10467","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-iterative-clustering-algorithm-for-the#ran","syntology_url":"https://syntology.ai/paper/2112.10467","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.10467"}},"official":{"repos":["glmbraun/csbm"],"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/model-based-clustering-with-missing-not-at","slug":"model-based-clustering-with-missing-not-at","title":"Model-based Clustering with Missing Not At Random Data","date":"2021-12-20","arxiv_id":"2112.10425","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-clustering-via-information","slug":"semi-supervised-clustering-via-information","title":"Semi-Supervised Clustering via Information-Theoretic Markov Chain Aggregation","date":"2021-12-17","arxiv_id":"2112.09397","repositories_listed":1,"syntology":null},{"url":"/paper/knac-an-approach-for-enhancing-cluster","slug":"knac-an-approach-for-enhancing-cluster","title":"KnAC: an approach for enhancing cluster analysis with background knowledge and explanations","date":"2021-12-16","arxiv_id":"2112.08759","repositories_listed":1,"syntology":null},{"url":"/paper/machine-learning-calabi-yau-hypersurfaces","slug":"machine-learning-calabi-yau-hypersurfaces","title":"Machine Learning Calabi-Yau Hypersurfaces","date":"2021-12-12","arxiv_id":"2112.06350","repositories_listed":1,"syntology":null},{"url":"/paper/top-down-deep-clustering-with-multi-generator","slug":"top-down-deep-clustering-with-multi-generator","title":"Top-Down Deep Clustering with Multi-generator GANs","date":"2021-12-06","arxiv_id":"2112.03398","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-data-fusion-with-deeper","slug":"unsupervised-data-fusion-with-deeper","title":"Unsupervised Data Fusion With Deeper Perspective: A Novel Multisensor Deep Clustering Algorithm","date":"2021-12-06","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/stationary-diffusion-state-neural-estimation","slug":"stationary-diffusion-state-neural-estimation","title":"Stationary Diffusion State Neural Estimation for Multiview Clustering","date":"2021-12-02","arxiv_id":"2112.01334","repositories_listed":1,"syntology":null},{"url":"/paper/trajectory-clustering-performance-evaluation","slug":"trajectory-clustering-performance-evaluation","title":"Trajectory Clustering Performance Evaluation: If we know the answer, it's not clustering","date":"2021-12-02","arxiv_id":"2112.01570","repositories_listed":1,"syntology":null},{"url":"/paper/an-exact-algorithm-for-semi-supervised","slug":"an-exact-algorithm-for-semi-supervised","title":"An Exact Algorithm for Semi-supervised Minimum Sum-of-Squares Clustering","date":"2021-11-30","arxiv_id":"2111.15571","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-clustering-visualization-feature","slug":"hierarchical-clustering-visualization-feature","title":"Hierarchical clustering: visualization, feature importance and model selection","date":"2021-11-30","arxiv_id":"2112.01372","repositories_listed":1,"syntology":null},{"url":"/paper/towards-full-fledged-argument-search-a","slug":"towards-full-fledged-argument-search-a","title":"Towards Full-Fledged Argument Search: A Framework for Extracting and Clustering Arguments from Unstructured Text","date":"2021-11-30","arxiv_id":"2112.00160","repositories_listed":1,"syntology":null},{"url":"/paper/conceptually-diverse-base-model-selection-for","slug":"conceptually-diverse-base-model-selection-for","title":"Conceptually Diverse Base Model Selection for Meta-Learners in Concept Drifting Data Streams","date":"2021-11-29","arxiv_id":"2111.14520","repositories_listed":1,"syntology":null},{"url":"/paper/multi-instance-point-cloud-registration-by","slug":"multi-instance-point-cloud-registration-by","title":"Multi-instance Point Cloud Registration by Efficient Correspondence Clustering","date":"2021-11-29","arxiv_id":"2111.14582","repositories_listed":1,"syntology":null},{"url":"/paper/a-methodology-based-on-trace-based-clustering","slug":"a-methodology-based-on-trace-based-clustering","title":"A methodology based on Trace-based clustering for patient phenotyping","date":"2021-11-28","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/rps-portfolio-asset-selection-using-graph","slug":"rps-portfolio-asset-selection-using-graph","title":"RPS: Portfolio Asset Selection using Graph based Representation Learning","date":"2021-11-28","arxiv_id":"2111.15634","repositories_listed":1,"syntology":null},{"url":"/paper/graph-auto-encoders-for-financial-clustering","slug":"graph-auto-encoders-for-financial-clustering","title":"Graph Auto-Encoders for Financial Clustering","date":"2021-11-26","arxiv_id":"2111.13519","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-effect-of-linearized-adversarial","slug":"clustering-effect-of-linearized-adversarial","title":"Clustering Effect of (Linearized) Adversarial Robust Models","date":"2021-11-25","arxiv_id":"2111.12922","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/clustering-effect-of-linearized-adversarial#ran","syntology_url":"https://syntology.ai/paper/2111.12922","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.12922"}},"official":{"repos":["bymavis/adv_weight_neurips2021"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/exploring-non-contrastive-representation-1","slug":"exploring-non-contrastive-representation-1","title":"Learning Representation for Clustering via Prototype Scattering and Positive Sampling","date":"2021-11-23","arxiv_id":"2111.11821","repositories_listed":1,"syntology":null},{"url":"/paper/faster-deterministic-approximation-algorithms","slug":"faster-deterministic-approximation-algorithms","title":"Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds","date":"2021-11-20","arxiv_id":"2111.10699","repositories_listed":1,"syntology":null},{"url":"/paper/ccsl-a-causal-structure-learning-method-from","slug":"ccsl-a-causal-structure-learning-method-from","title":"CCSL: A Causal Structure Learning Method from Multiple Unknown Environments","date":"2021-11-18","arxiv_id":"2111.09666","repositories_listed":1,"syntology":null},{"url":"/paper/meeting-summarization-with-pre-training-and","slug":"meeting-summarization-with-pre-training-and","title":"Meeting Summarization with Pre-training and Clustering Methods","date":"2021-11-16","arxiv_id":"2111.08210","repositories_listed":1,"syntology":null},{"url":"/paper/fully-linear-graph-convolutional-networks-for","slug":"fully-linear-graph-convolutional-networks-for","title":"Fully Linear Graph Convolutional Networks for Semi-Supervised Learning and Clustering","date":"2021-11-15","arxiv_id":"2111.07942","repositories_listed":1,"syntology":null},{"url":"/paper/large-scale-hyperspectral-image-clustering","slug":"large-scale-hyperspectral-image-clustering","title":"Large-Scale Hyperspectral Image Clustering Using Contrastive Learning","date":"2021-11-15","arxiv_id":"2111.07945","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-clustering-by-aggregating","slug":"hierarchical-clustering-by-aggregating","title":"Hierarchical clustering by aggregating representatives in sub-minimum-spanning-trees","date":"2021-11-11","arxiv_id":"2111.06968","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-of-longitudinal-data-a-tutorial-on","slug":"clustering-of-longitudinal-data-a-tutorial-on","title":"Clustering of longitudinal data: A tutorial on a variety of approaches","date":"2021-11-10","arxiv_id":"2111.05469","repositories_listed":1,"syntology":null},{"url":"/paper/deep-attention-guided-graph-clustering-with","slug":"deep-attention-guided-graph-clustering-with","title":"Deep Attention-guided Graph Clustering with Dual Self-supervision","date":"2021-11-10","arxiv_id":"2111.05548","repositories_listed":1,"syntology":null},{"url":"/paper/wasserstein-adversarially-regularized-graph","slug":"wasserstein-adversarially-regularized-graph","title":"Wasserstein Adversarially Regularized Graph Autoencoder","date":"2021-11-09","arxiv_id":"2111.04981","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/wasserstein-adversarially-regularized-graph#ran","syntology_url":"https://syntology.ai/paper/2111.04981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.04981"}},"official":{"repos":["LeonResearch/WARGA"],"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/clustering-and-structural-robustness-in","slug":"clustering-and-structural-robustness-in","title":"Clustering and Structural Robustness in Causal Diagrams","date":"2021-11-08","arxiv_id":"2111.04513","repositories_listed":1,"syntology":null},{"url":"/paper/event-based-motion-segmentation-by-cascaded","slug":"event-based-motion-segmentation-by-cascaded","title":"Event-based Motion Segmentation by Cascaded Two-Level Multi-Model Fitting","date":"2021-11-05","arxiv_id":"2111.03483","repositories_listed":1,"syntology":null},{"url":"/paper/fanatic-fast-noise-aware-topic-clustering","slug":"fanatic-fast-noise-aware-topic-clustering","title":"FANATIC: FAst Noise-Aware TopIc Clustering","date":"2021-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/gtfs2vec-learning-gtfs-embeddings-for","slug":"gtfs2vec-learning-gtfs-embeddings-for","title":"gtfs2vec -- Learning GTFS Embeddings for comparing Public Transport Offer in Microregions","date":"2021-11-01","arxiv_id":"2111.00960","repositories_listed":1,"syntology":null},{"url":"/paper/task-oriented-clustering-for-dialogues","slug":"task-oriented-clustering-for-dialogues","title":"Task-Oriented Clustering for Dialogues","date":"2021-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/udis-unsupervised-discovery-of-bias-in-deep","slug":"udis-unsupervised-discovery-of-bias-in-deep","title":"UDIS: Unsupervised Discovery of Bias in Deep Visual Recognition Models","date":"2021-10-29","arxiv_id":"2110.15499","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":4,"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/udis-unsupervised-discovery-of-bias-in-deep#ran","syntology_url":"https://syntology.ai/paper/2110.15499","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.15499"}},"official":{"repos":["akrishna77/bias-discovery"],"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/predictive-geological-mapping-with","slug":"predictive-geological-mapping-with","title":"Predictive Geological Mapping with Convolution Neural Network Using Statistical Data Augmentation on a 3D Model","date":"2021-10-27","arxiv_id":"2110.14440","repositories_listed":1,"syntology":null}],"record_sha256":"885761d7280340c8d1f310b3fb3a42979b86bd3aee518bbbb02c25738a15461d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}