{"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/20","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":20,"pages_in_order":108,"rows_per_page":100,"rows":[1901,2000],"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/19","next":"/task/clustering/papers/21","papers":[{"url":"/paper/unsupervised-machine-learning-via-transfer","slug":"unsupervised-machine-learning-via-transfer","title":"Unsupervised machine learning via transfer learning and k-means clustering to classify materials image data","date":"2020-07-16","arxiv_id":"2007.08361","repositories_listed":1,"syntology":null},{"url":"/paper/mixture-complexity-and-its-application-to","slug":"mixture-complexity-and-its-application-to","title":"Mixture Complexity and Its Application to Gradual Clustering Change Detection","date":"2020-07-15","arxiv_id":"2007.07467","repositories_listed":1,"syntology":null},{"url":"/paper/deep-heterogeneous-autoencoder-for-subspace","slug":"deep-heterogeneous-autoencoder-for-subspace","title":"Unsupervised Spatio-temporal Latent Feature Clustering for Multiple-object Tracking and Segmentation","date":"2020-07-14","arxiv_id":"2007.07175","repositories_listed":1,"syntology":null},{"url":"/paper/autoembedder-a-semi-supervised-dnn-embedding-1","slug":"autoembedder-a-semi-supervised-dnn-embedding-1","title":"AutoEmbedder: A semi-supervised DNN embedding system for clustering","date":"2020-07-11","arxiv_id":"2007.05830","repositories_listed":1,"syntology":null},{"url":"/paper/improving-adversarial-robustness-by-enforcing","slug":"improving-adversarial-robustness-by-enforcing","title":"Improving Adversarial Robustness by Enforcing Local and Global Compactness","date":"2020-07-10","arxiv_id":"2007.05123","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/improving-adversarial-robustness-by-enforcing#ran","syntology_url":"https://syntology.ai/paper/2007.05123","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.05123"}},"official":{"repos":["tuananhbui89/Adversarial-Divergence-Reduction"],"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/numerical-simulation-clustering-and","slug":"numerical-simulation-clustering-and","title":"Numerical simulation, clustering and prediction of multi-component polymer precipitation","date":"2020-07-10","arxiv_id":"2007.07276","repositories_listed":1,"syntology":null},{"url":"/paper/a-study-of-gradient-variance-in-deep-learning","slug":"a-study-of-gradient-variance-in-deep-learning","title":"A Study of Gradient Variance in Deep Learning","date":"2020-07-09","arxiv_id":"2007.04532","repositories_listed":1,"syntology":null},{"url":"/paper/let-the-data-choose-its-features","slug":"let-the-data-choose-its-features","title":"Differentiable Unsupervised Feature Selection based on a Gated Laplacian","date":"2020-07-09","arxiv_id":"2007.04728","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/let-the-data-choose-its-features#ran","syntology_url":"https://syntology.ai/paper/2007.04728","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04728"}},"official":{"repos":["Ofirlin/DUFS"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/model-based-clustering-using-automatic","slug":"model-based-clustering-using-automatic","title":"Model-based Clustering using Automatic Differentiation: Confronting Misspecification and High-Dimensional Data","date":"2020-07-08","arxiv_id":"2007.12786","repositories_listed":1,"syntology":null},{"url":"/paper/divide-and-rule-self-supervised-learning-for","slug":"divide-and-rule-self-supervised-learning-for","title":"Divide-and-Rule: Self-Supervised Learning for Survival Analysis in Colorectal Cancer","date":"2020-07-07","arxiv_id":"2007.03292","repositories_listed":1,"syntology":null},{"url":"/paper/self-organizing-democratized-learning-towards","slug":"self-organizing-democratized-learning-towards","title":"Self-organizing Democratized Learning: Towards Large-scale Distributed Learning Systems","date":"2020-07-07","arxiv_id":"2007.03278","repositories_listed":1,"syntology":null},{"url":"/paper/trajectories-bifurcations-and-pseudotime-in","slug":"trajectories-bifurcations-and-pseudotime-in","title":"Trajectories, bifurcations and pseudotime in large clinical datasets: applications to myocardial infarction and diabetes data","date":"2020-07-07","arxiv_id":"2007.03788","repositories_listed":1,"syntology":null},{"url":"/paper/progressive-cluster-purification-for-1","slug":"progressive-cluster-purification-for-1","title":"Progressive Cluster Purification for Unsupervised Feature Learning","date":"2020-07-06","arxiv_id":"2007.02577","repositories_listed":1,"syntology":null},{"url":"/paper/on-identifying-unobserved-heterogeneity-in","slug":"on-identifying-unobserved-heterogeneity-in","title":"On spectral algorithms for community detection in stochastic blockmodel graphs with vertex covariates","date":"2020-07-04","arxiv_id":"2007.02156","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-graph-encoder-for-attributed-graph","slug":"adaptive-graph-encoder-for-attributed-graph","title":"Adaptive Graph Encoder for Attributed Graph Embedding","date":"2020-07-03","arxiv_id":"2007.01594","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adaptive-graph-encoder-for-attributed-graph#ran","syntology_url":"https://syntology.ai/paper/2007.01594","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.01594"}},"official":{"repos":["thunlp/AGE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/autoencoding-keyword-correlation-graph-for","slug":"autoencoding-keyword-correlation-graph-for","title":"Autoencoding Keyword Correlation Graph for Document Clustering","date":"2020-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/magic-multi-scale-heterogeneity-analysis-and","slug":"magic-multi-scale-heterogeneity-analysis-and","title":"MAGIC: Multi-scale Heterogeneity Analysis and Clustering for Brain Diseases","date":"2020-07-01","arxiv_id":"2007.00812","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-qualitative-clustering","slug":"hierarchical-qualitative-clustering","title":"Hierarchical Qualitative Clustering: clustering mixed datasets with critical qualitative information","date":"2020-06-30","arxiv_id":"2006.16701","repositories_listed":1,"syntology":null},{"url":"/paper/real-elliptically-skewed-distributions-and","slug":"real-elliptically-skewed-distributions-and","title":"Real Elliptically Skewed Distributions and Their Application to Robust Cluster Analysis","date":"2020-06-30","arxiv_id":"2006.16671","repositories_listed":1,"syntology":null},{"url":"/paper/decorrelated-clustering-with-data-selection","slug":"decorrelated-clustering-with-data-selection","title":"Decorrelated Clustering with Data Selection Bias","date":"2020-06-29","arxiv_id":"2006.15874","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-learning-of-video-1","slug":"unsupervised-learning-of-video-1","title":"Unsupervised Learning of Video Representations via Dense Trajectory Clustering","date":"2020-06-28","arxiv_id":"2006.15731","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":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) · 0 unverified","sample_list":"/paper/unsupervised-learning-of-video-1#ran","syntology_url":"https://syntology.ai/paper/2006.15731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15731"}},"official":{"repos":["pvtokmakov/video_cluster"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-interpretability-of-cnn-models","slug":"improving-interpretability-of-cnn-models","title":"Invertible Concept-based Explanations for CNN Models with Non-negative Concept Activation Vectors","date":"2020-06-27","arxiv_id":"2006.15417","repositories_listed":1,"syntology":null},{"url":"/paper/tangles-from-weak-to-strong-clustering","slug":"tangles-from-weak-to-strong-clustering","title":"Clustering with Tangles: Algorithmic Framework and Theoretical Guarantees","date":"2020-06-25","arxiv_id":"2006.14444","repositories_listed":1,"syntology":null},{"url":"/paper/labelling-unlabelled-videos-from-scratch-with","slug":"labelling-unlabelled-videos-from-scratch-with","title":"Labelling unlabelled videos from scratch with multi-modal self-supervision","date":"2020-06-24","arxiv_id":"2006.13662","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":5,"n_ran_checked":7,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":10,"phrase":"9 ran (of which 5 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/labelling-unlabelled-videos-from-scratch-with#ran","syntology_url":"https://syntology.ai/paper/2006.13662","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.13662"}},"official":{"repos":["facebookresearch/selavi"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":5,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/off-the-grid-fast-and-effective","slug":"off-the-grid-fast-and-effective","title":"Off-the-grid: Fast and Effective Hyperparameter Search for Kernel Clustering","date":"2020-06-24","arxiv_id":"2006.13567","repositories_listed":1,"syntology":null},{"url":"/paper/betula-numerically-stable-cf-trees-for-birch","slug":"betula-numerically-stable-cf-trees-for-birch","title":"BETULA: Numerically Stable CF-Trees for BIRCH Clustering","date":"2020-06-23","arxiv_id":"2006.12881","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-unsupervised-domain-adaptation-for","slug":"inductive-unsupervised-domain-adaptation-for","title":"Inductive Unsupervised Domain Adaptation for Few-Shot Classification via Clustering","date":"2020-06-23","arxiv_id":"2006.12816","repositories_listed":1,"syntology":null},{"url":"/paper/distributional-individual-fairness-in","slug":"distributional-individual-fairness-in","title":"Distributional Individual Fairness in Clustering","date":"2020-06-22","arxiv_id":"2006.12589","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/distributional-individual-fairness-in#ran","syntology_url":"https://syntology.ai/paper/2006.12589","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12589"}},"official":{"repos":["nihesh/distributional_individual_fairness_in_clustering"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/subspace-clustering-for-action-recognition","slug":"subspace-clustering-for-action-recognition","title":"Subspace Clustering for Action Recognition with Covariance Representations and Temporal Pruning","date":"2020-06-21","arxiv_id":"2006.11812","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-image-classification-for-deep","slug":"unsupervised-image-classification-for-deep","title":"Unsupervised Image Classification for Deep Representation Learning","date":"2020-06-20","arxiv_id":"2006.11480","repositories_listed":1,"syntology":null},{"url":"/paper/deep-transformation-invariant-clustering","slug":"deep-transformation-invariant-clustering","title":"Deep Transformation-Invariant Clustering","date":"2020-06-19","arxiv_id":"2006.11132","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/deep-transformation-invariant-clustering#ran","syntology_url":"https://syntology.ai/paper/2006.11132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11132"}},"official":{"repos":["monniert/dti-clustering"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-low-rank-subspace-clustering","slug":"deep-low-rank-subspace-clustering","title":"Deep Low-Rank Subspace Clustering","date":"2020-06-18","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/online-deep-clustering-for-unsupervised-1","slug":"online-deep-clustering-for-unsupervised-1","title":"Online Deep Clustering for Unsupervised Representation Learning","date":"2020-06-18","arxiv_id":"2006.10645","repositories_listed":1,"syntology":null},{"url":"/paper/deep-categorization-with-semi-supervised-self","slug":"deep-categorization-with-semi-supervised-self","title":"Deep Categorization with Semi-Supervised Self-Organizing Maps","date":"2020-06-17","arxiv_id":"2006.13682","repositories_listed":1,"syntology":null},{"url":"/paper/freetree-a-tree-based-approach-for-high","slug":"freetree-a-tree-based-approach-for-high","title":"FREEtree: A Tree-based Approach for High Dimensional Longitudinal Data With Correlated Features","date":"2020-06-17","arxiv_id":"2006.09693","repositories_listed":1,"syntology":null},{"url":"/paper/lsd-c-linearly-separable-deep-clusters","slug":"lsd-c-linearly-separable-deep-clusters","title":"LSD-C: Linearly Separable Deep Clusters","date":"2020-06-17","arxiv_id":"2006.10039","repositories_listed":1,"syntology":null},{"url":"/paper/hypergraph-clustering-based-on-pagerank","slug":"hypergraph-clustering-based-on-pagerank","title":"Hypergraph Clustering Based on PageRank","date":"2020-06-15","arxiv_id":"2006.08302","repositories_listed":1,"syntology":null},{"url":"/paper/selecting-the-number-of-clusters-k-with-a","slug":"selecting-the-number-of-clusters-k-with-a","title":"Selecting the Number of Clusters $K$ with a Stability Trade-off: an Internal Validation Criterion","date":"2020-06-15","arxiv_id":"2006.08530","repositories_listed":1,"syntology":null},{"url":"/paper/strongly-local-p-norm-cut-algorithms-for-semi","slug":"strongly-local-p-norm-cut-algorithms-for-semi","title":"Strongly local p-norm-cut algorithms for semi-supervised learning and local graph clustering","date":"2020-06-15","arxiv_id":"2006.08569","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-phenotyping-using-deep-predictive","slug":"temporal-phenotyping-using-deep-predictive","title":"Temporal Phenotyping using Deep Predictive Clustering of Disease Progression","date":"2020-06-15","arxiv_id":"2006.08600","repositories_listed":1,"syntology":null},{"url":"/paper/uncovering-the-topology-of-time-varying-fmri","slug":"uncovering-the-topology-of-time-varying-fmri","title":"Uncovering the Topology of Time-Varying fMRI Data using Cubical Persistence","date":"2020-06-14","arxiv_id":"2006.07882","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/uncovering-the-topology-of-time-varying-fmri#ran","syntology_url":"https://syntology.ai/paper/2006.07882","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07882"}},"official":{"repos":["BorgwardtLab/fMRI_Cubical_Persistence"],"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/clusttr-clustering-training-for-robustness","slug":"clusttr-clustering-training-for-robustness","title":"Rethinking Clustering for Robustness","date":"2020-06-13","arxiv_id":"2006.07682","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/clusttr-clustering-training-for-robustness#ran","syntology_url":"https://syntology.ai/paper/2006.07682","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07682"}},"official":{"repos":["clustr-official-account/ClusTR-Clustering-Training-For-Robustness"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/faster-mcmc-for-gaussian-latent-position","slug":"faster-mcmc-for-gaussian-latent-position","title":"Faster MCMC for Gaussian Latent Position Network Models","date":"2020-06-13","arxiv_id":"2006.07687","repositories_listed":1,"syntology":null},{"url":"/paper/sdcor-scalable-density-based-clustering-for","slug":"sdcor-scalable-density-based-clustering-for","title":"SDCOR: Scalable Density-based Clustering for Local Outlier Detection in Massive-Scale Datasets","date":"2020-06-13","arxiv_id":"2006.07616","repositories_listed":1,"syntology":null},{"url":"/paper/iterate-cluster-iterative-semi-supervised","slug":"iterate-cluster-iterative-semi-supervised","title":"Iterate & Cluster: Iterative Semi-Supervised Action Recognition","date":"2020-06-12","arxiv_id":"2006.06911","repositories_listed":1,"syntology":null},{"url":"/paper/markov-random-geometric-graph-mrgg-a-growth","slug":"markov-random-geometric-graph-mrgg-a-growth","title":"Markov Random Geometric Graph (MRGG): A Growth Model for Temporal Dynamic Networks","date":"2020-06-12","arxiv_id":"2006.07001","repositories_listed":1,"syntology":null},{"url":"/paper/unmasking-the-inductive-biases-of","slug":"unmasking-the-inductive-biases-of","title":"Benchmarking Unsupervised Object Representations for Video Sequences","date":"2020-06-12","arxiv_id":"2006.07034","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unmasking-the-inductive-biases-of#ran","syntology_url":"https://syntology.ai/paper/2006.07034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07034"}},"official":{"repos":["ecker-lab/object-centric-representation-benchmark"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/an-unsupervised-machine-learning-approach-to","slug":"an-unsupervised-machine-learning-approach-to","title":"An Unsupervised Machine Learning Approach to Assess the ZIP Code Level Impact of COVID-19 in NYC","date":"2020-06-11","arxiv_id":"2006.08361","repositories_listed":1,"syntology":null},{"url":"/paper/attentive-waveblock-complementarity-enhanced","slug":"attentive-waveblock-complementarity-enhanced","title":"Attentive WaveBlock: Complementarity-enhanced Mutual Networks for Unsupervised Domain Adaptation in Person Re-identification and Beyond","date":"2020-06-11","arxiv_id":"2006.06525","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"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) · 2 unverified","sample_list":"/paper/attentive-waveblock-complementarity-enhanced#ran","syntology_url":"https://syntology.ai/paper/2006.06525","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.06525"}},"official":{"repos":["WangWenhao0716/Attentive-WaveBlock"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/automating-cluster-analysis-to-generate","slug":"automating-cluster-analysis-to-generate","title":"Clustering Residential Electricity Consumption Data to Create Archetypes that Capture Household Behaviour in South Africa","date":"2020-06-11","arxiv_id":"2006.07197","repositories_listed":1,"syntology":null},{"url":"/paper/interpretable-visualizations-with","slug":"interpretable-visualizations-with","title":"Interpretable Visualizations with Differentiating Embedding Networks","date":"2020-06-11","arxiv_id":"2006.06640","repositories_listed":1,"syntology":null},{"url":"/paper/fair-clustering-for-diverse-and-experienced","slug":"fair-clustering-for-diverse-and-experienced","title":"Hypergraph Clustering for Finding Diverse and Experienced Groups","date":"2020-06-10","arxiv_id":"2006.05645","repositories_listed":1,"syntology":null},{"url":"/paper/node-embeddings-and-exact-low-rank","slug":"node-embeddings-and-exact-low-rank","title":"Node Embeddings and Exact Low-Rank Representations of Complex Networks","date":"2020-06-10","arxiv_id":"2006.05592","repositories_listed":1,"syntology":null},{"url":"/paper/cast-a-correlation-based-adaptive-spectral","slug":"cast-a-correlation-based-adaptive-spectral","title":"CAST: A Correlation-based Adaptive Spectral Clustering Algorithm on Multi-scale Data","date":"2020-06-08","arxiv_id":"2006.04435","repositories_listed":1,"syntology":null},{"url":"/paper/generalized-spectral-clustering-via-gromov","slug":"generalized-spectral-clustering-via-gromov","title":"Generalized Spectral Clustering via Gromov-Wasserstein Learning","date":"2020-06-07","arxiv_id":"2006.04163","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-differentiable-multi-aspect","slug":"unsupervised-differentiable-multi-aspect","title":"Unsupervised Differentiable Multi-aspect Network Embedding","date":"2020-06-07","arxiv_id":"2006.04239","repositories_listed":1,"syntology":null},{"url":"/paper/improving-k-means-clustering-performance-with","slug":"improving-k-means-clustering-performance-with","title":"Improving k-Means Clustering Performance with Disentangled Internal Representations","date":"2020-06-05","arxiv_id":"2006.04535","repositories_listed":1,"syntology":null},{"url":"/paper/fuzzy-c-means-clustering-for-persistence","slug":"fuzzy-c-means-clustering-for-persistence","title":"Fuzzy c-Means Clustering for Persistence Diagrams","date":"2020-06-04","arxiv_id":"2006.02796","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":2,"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; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fuzzy-c-means-clustering-for-persistence#ran","syntology_url":"https://syntology.ai/paper/2006.02796","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.02796"}},"official":{"repos":["tomogwen/fpdcluster"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-fair-clustering-for-visual-learning","slug":"deep-fair-clustering-for-visual-learning","title":"Deep Fair Clustering for Visual Learning","date":"2020-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/deep-semantic-clustering-by-partition","slug":"deep-semantic-clustering-by-partition","title":"Deep Semantic Clustering by Partition Confidence Maximisation","date":"2020-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/defending-and-harnessing-the-bit-flip-based","slug":"defending-and-harnessing-the-bit-flip-based","title":"Defending and Harnessing the Bit-Flip Based Adversarial Weight Attack","date":"2020-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-temporal-co-attention-models-for","slug":"learning-temporal-co-attention-models-for","title":"Learning Temporal Co-Attention Models for Unsupervised Video Action Localization","date":"2020-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-hierarchical-drug-embedding","slug":"semi-supervised-hierarchical-drug-embedding","title":"Semi-Supervised Hierarchical Drug Embedding in Hyperbolic Space","date":"2020-06-01","arxiv_id":"2006.00986","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-identification-of-slow-timescale","slug":"sparse-identification-of-slow-timescale","title":"Sparse Identification of Slow Timescale Dynamics","date":"2020-06-01","arxiv_id":"2006.00940","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-the-message-passing-in-graph","slug":"understanding-the-message-passing-in-graph","title":"Understanding the Message Passing in Graph Neural Networks via Power Iteration Clustering","date":"2020-05-30","arxiv_id":"2006.00144","repositories_listed":1,"syntology":null},{"url":"/paper/clarity-comparing-heterogeneous-data-using","slug":"clarity-comparing-heterogeneous-data-using","title":"CLARITY -- Comparing heterogeneous data using dissimiLARITY","date":"2020-05-29","arxiv_id":"2006.00077","repositories_listed":1,"syntology":null},{"url":"/paper/multi-layer-trajectory-clustering-a-network","slug":"multi-layer-trajectory-clustering-a-network","title":"Multi-layer Trajectory Clustering: A Network Algorithm for Disease Subtyping","date":"2020-05-29","arxiv_id":"2005.14472","repositories_listed":1,"syntology":null},{"url":"/paper/network-bending-manipulating-the-inner","slug":"network-bending-manipulating-the-inner","title":"Network Bending: Expressive Manipulation of Deep Generative Models","date":"2020-05-25","arxiv_id":"2005.12420","repositories_listed":1,"syntology":null},{"url":"/paper/supervised-convex-clustering","slug":"supervised-convex-clustering","title":"Supervised Convex Clustering","date":"2020-05-25","arxiv_id":"2005.12198","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-discovery-of-interpretable-planning","slug":"automatic-discovery-of-interpretable-planning","title":"Automatic Discovery of Interpretable Planning Strategies","date":"2020-05-24","arxiv_id":"2005.11730","repositories_listed":1,"syntology":null},{"url":"/paper/intent-mining-from-past-conversations-for","slug":"intent-mining-from-past-conversations-for","title":"Intent Mining from past conversations for conversational agent","date":"2020-05-22","arxiv_id":"2005.11014","repositories_listed":1,"syntology":null},{"url":"/paper/esam-discriminative-domain-adaptation-with","slug":"esam-discriminative-domain-adaptation-with","title":"ESAM: Discriminative Domain Adaptation with Non-Displayed Items to Improve Long-Tail Performance","date":"2020-05-21","arxiv_id":"2005.10545","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/esam-discriminative-domain-adaptation-with#ran","syntology_url":"https://syntology.ai/paper/2005.10545","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.10545"}},"official":{"repos":["A-bone1/ESAM"],"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/a-large-scale-multi-document-summarization","slug":"a-large-scale-multi-document-summarization","title":"A Large-Scale Multi-Document Summarization Dataset from the Wikipedia Current Events Portal","date":"2020-05-20","arxiv_id":"2005.10070","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-canonical-correlation-analysis","slug":"adversarial-canonical-correlation-analysis","title":"Adversarial Canonical Correlation Analysis","date":"2020-05-20","arxiv_id":"2005.10349","repositories_listed":1,"syntology":null},{"url":"/paper/embeddings-based-clustering-for-target","slug":"embeddings-based-clustering-for-target","title":"Embeddings-Based Clustering for Target Specific Stances: The Case of a Polarized Turkey","date":"2020-05-19","arxiv_id":"2005.09649","repositories_listed":1,"syntology":null},{"url":"/paper/k-sums-another-side-of-k-means","slug":"k-sums-another-side-of-k-means","title":"k-sums: another side of k-means","date":"2020-05-19","arxiv_id":"2005.09485","repositories_listed":1,"syntology":null},{"url":"/paper/robust-training-of-vector-quantized","slug":"robust-training-of-vector-quantized","title":"Robust Training of Vector Quantized Bottleneck Models","date":"2020-05-18","arxiv_id":"2005.08520","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/robust-training-of-vector-quantized#ran","syntology_url":"https://syntology.ai/paper/2005.08520","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.08520"}},"official":{"repos":["distsup/DistSup"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/stable-and-consistent-density-based","slug":"stable-and-consistent-density-based","title":"Stable and consistent density-based clustering via multiparameter persistence","date":"2020-05-18","arxiv_id":"2005.09048","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/stable-and-consistent-density-based#ran","syntology_url":"https://syntology.ai/paper/2005.09048","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09048"}},"official":{"repos":["LuisScoccola/persistable"],"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/deep-learning-for-community-detection","slug":"deep-learning-for-community-detection","title":"Deep Learning for Community Detection: Progress, Challenges and Opportunities","date":"2020-05-17","arxiv_id":"2005.08225","repositories_listed":1,"syntology":null},{"url":"/paper/an-auto-encoder-for-audio-dolphin","slug":"an-auto-encoder-for-audio-dolphin","title":"An Auto Encoder For Audio Dolphin Communication","date":"2020-05-15","arxiv_id":"2005.07623","repositories_listed":1,"syntology":null},{"url":"/paper/laplacian-eigenmaps-and-spectral-techniques","slug":"laplacian-eigenmaps-and-spectral-techniques","title":"Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering","date":"2020-05-13","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/exploring-tts-without-t-using-biologically","slug":"exploring-tts-without-t-using-biologically","title":"Exploring TTS without T Using Biologically/Psychologically Motivated Neural Network Modules (ZeroSpeech 2020)","date":"2020-05-11","arxiv_id":"2005.05487","repositories_listed":1,"syntology":null},{"url":"/paper/simplemkkm-simple-multiple-kernel-k-means","slug":"simplemkkm-simple-multiple-kernel-k-means","title":"SimpleMKKM: Simple Multiple Kernel K-means","date":"2020-05-11","arxiv_id":"2005.04975","repositories_listed":1,"syntology":null},{"url":"/paper/comparison-and-benchmark-of-graph-clustering","slug":"comparison-and-benchmark-of-graph-clustering","title":"Comparison and Benchmark of Graph Clustering Algorithms","date":"2020-05-10","arxiv_id":"2005.04806","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-graph-embeddings-for-fair","slug":"adversarial-graph-embeddings-for-fair","title":"Adversarial Graph Embeddings for Fair Influence Maximization over Social Networks","date":"2020-05-08","arxiv_id":"2005.04074","repositories_listed":1,"syntology":null},{"url":"/paper/project-and-forget-solving-large-scale-metric-1","slug":"project-and-forget-solving-large-scale-metric-1","title":"Project and Forget: Solving Large-Scale Metric Constrained Problems","date":"2020-05-08","arxiv_id":"2005.03853","repositories_listed":1,"syntology":null},{"url":"/paper/effect-of-the-latent-structure-on-clustering","slug":"effect-of-the-latent-structure-on-clustering","title":"Effect of The Latent Structure on Clustering with GANs","date":"2020-05-05","arxiv_id":"2005.02435","repositories_listed":1,"syntology":null},{"url":"/paper/morphocluster-efficient-annotation-of","slug":"morphocluster-efficient-annotation-of","title":"MorphoCluster: Efficient Annotation of Plankton images by Clustering","date":"2020-05-04","arxiv_id":"2005.01595","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/morphocluster-efficient-annotation-of#ran","syntology_url":"https://syntology.ai/paper/2005.01595","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.01595"}},"official":null}},{"url":"/paper/the-paradigm-discovery-problem","slug":"the-paradigm-discovery-problem","title":"The Paradigm Discovery Problem","date":"2020-05-04","arxiv_id":"2005.01630","repositories_listed":1,"syntology":null},{"url":"/paper/extracting-entities-and-topics-from-news-and","slug":"extracting-entities-and-topics-from-news-and","title":"Extracting Entities and Topics from News and Connecting Criminal Records","date":"2020-05-03","arxiv_id":"2005.00950","repositories_listed":1,"syntology":null},{"url":"/paper/accelerated-high-quality-mutual-information","slug":"accelerated-high-quality-mutual-information","title":"Accelerated High-Quality Mutual-Information Based Word Clustering","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-deep-embedded-clustering-with","slug":"semi-supervised-deep-embedded-clustering-with","title":"Semi-supervised Deep Embedded Clustering with Anomaly Detection for Semantic Frame Induction","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/structpool-structured-graph-pooling-via","slug":"structpool-structured-graph-pooling-via","title":"StructPool: Structured Graph Pooling via Conditional Random Fields","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/bridging-linguistic-typology-and-multilingual","slug":"bridging-linguistic-typology-and-multilingual","title":"Bridging Linguistic Typology and Multilingual Machine Translation with Multi-View Language Representations","date":"2020-04-30","arxiv_id":"2004.14923","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/bridging-linguistic-typology-and-multilingual#ran","syntology_url":"https://syntology.ai/paper/2004.14923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14923"}},"official":{"repos":["aoncevay/multiview-langrep"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/coreset-clustering-on-small-quantum-computers","slug":"coreset-clustering-on-small-quantum-computers","title":"Coreset Clustering on Small Quantum Computers","date":"2020-04-30","arxiv_id":"2004.14970","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-memory-efficient-incremental","slug":"revisiting-memory-efficient-incremental","title":"Incremental Neural Coreference Resolution in Constant Memory","date":"2020-04-30","arxiv_id":"2005.00128","repositories_listed":1,"syntology":null},{"url":"/paper/tired-of-topic-models-clusters-of-pretrained","slug":"tired-of-topic-models-clusters-of-pretrained","title":"Tired of Topic Models? Clusters of Pretrained Word Embeddings Make for Fast and Good Topics too!","date":"2020-04-30","arxiv_id":"2004.14914","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/tired-of-topic-models-clusters-of-pretrained#ran","syntology_url":"https://syntology.ai/paper/2004.14914","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14914"}},"official":{"repos":["adalmia96/Cluster-Analysis"],"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/active-learning-for-coreference-resolution-3","slug":"active-learning-for-coreference-resolution-3","title":"Active Learning for Coreference Resolution using Discrete Annotation","date":"2020-04-28","arxiv_id":"2004.13671","repositories_listed":1,"syntology":null},{"url":"/paper/gimp-ml-python-plugins-for-using-computer","slug":"gimp-ml-python-plugins-for-using-computer","title":"GIMP-ML: Python Plugins for using Computer Vision Models in GIMP","date":"2020-04-27","arxiv_id":"2004.13060","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-clustering-of-bipartite-data","slug":"hierarchical-clustering-of-bipartite-data","title":"Hierarchical clustering of bipartite data sets based on the statistical significance of coincidences","date":"2020-04-27","arxiv_id":"2004.14764","repositories_listed":1,"syntology":null}],"record_sha256":"407701a471d5ee8dcc8ab801c6b281a3a9e477830f904f731f1cf49752b87ca6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}