{"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/21","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":21,"pages_in_order":108,"rows_per_page":100,"rows":[2001,2100],"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/20","next":"/task/clustering/papers/22","papers":[{"url":"/paper/maximum-entropy-multi-task-inverse-rl","slug":"maximum-entropy-multi-task-inverse-rl","title":"Maximum Entropy Multi-Task Inverse RL","date":"2020-04-27","arxiv_id":"2004.12873","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-512-tokens-siamese-multi-depth","slug":"beyond-512-tokens-siamese-multi-depth","title":"Beyond 512 Tokens: Siamese Multi-depth Transformer-based Hierarchical Encoder for Long-Form Document Matching","date":"2020-04-26","arxiv_id":"2004.12297","repositories_listed":1,"syntology":null},{"url":"/paper/neural-topic-modeling-with-bidirectional","slug":"neural-topic-modeling-with-bidirectional","title":"Neural Topic Modeling with Bidirectional Adversarial Training","date":"2020-04-26","arxiv_id":"2004.12331","repositories_listed":1,"syntology":null},{"url":"/paper/order-preserving-hierarchical-agglomerative","slug":"order-preserving-hierarchical-agglomerative","title":"Order preserving hierarchical agglomerative clustering","date":"2020-04-26","arxiv_id":"2004.12488","repositories_listed":1,"syntology":null},{"url":"/paper/a-named-entity-based-approach-to-model","slug":"a-named-entity-based-approach-to-model","title":"A Named Entity Based Approach to Model Recipes","date":"2020-04-25","arxiv_id":"2004.12184","repositories_listed":1,"syntology":null},{"url":"/paper/cnn-based-road-user-detection-using-the-3d","slug":"cnn-based-road-user-detection-using-the-3d","title":"CNN based Road User Detection using the 3D Radar Cube","date":"2020-04-25","arxiv_id":"2004.12165","repositories_listed":1,"syntology":null},{"url":"/paper/graph-convolutional-subspace-clustering-a","slug":"graph-convolutional-subspace-clustering-a","title":"Graph Convolutional Subspace Clustering: A Robust Subspace Clustering Framework for Hyperspectral Image","date":"2020-04-22","arxiv_id":"2004.10476","repositories_listed":1,"syntology":null},{"url":"/paper/putative-cell-type-discovery-from-single-cell","slug":"putative-cell-type-discovery-from-single-cell","title":"Putative cell type discovery from single-cell gene expression data","date":"2020-04-21","arxiv_id":"2004.09847","repositories_listed":1,"syntology":null},{"url":"/paper/local-clustering-with-mean-teacher-for-semi","slug":"local-clustering-with-mean-teacher-for-semi","title":"Local Clustering with Mean Teacher for Semi-supervised Learning","date":"2020-04-20","arxiv_id":"2004.09665","repositories_listed":1,"syntology":null},{"url":"/paper/new-metrics-between-rational-spectra-and","slug":"new-metrics-between-rational-spectra-and","title":"New Metrics Between Rational Spectra and their Connection to Optimal Transport","date":"2020-04-20","arxiv_id":"2004.09152","repositories_listed":1,"syntology":null},{"url":"/paper/real-world-games-look-like-spinning-tops","slug":"real-world-games-look-like-spinning-tops","title":"Real World Games Look Like Spinning Tops","date":"2020-04-20","arxiv_id":"2004.09468","repositories_listed":1,"syntology":null},{"url":"/paper/generalized-shortest-path-based-superpixels","slug":"generalized-shortest-path-based-superpixels","title":"Generalized Shortest Path-based Superpixels for Accurate Segmentation of Spherical Images","date":"2020-04-15","arxiv_id":"2004.07394","repositories_listed":1,"syntology":null},{"url":"/paper/oversampling-for-imbalanced-time-series-data","slug":"oversampling-for-imbalanced-time-series-data","title":"Minority Oversampling for Imbalanced Time Series Classification","date":"2020-04-14","arxiv_id":"2004.06373","repositories_listed":1,"syntology":null},{"url":"/paper/the-r-package-stagedtrees-for-structural","slug":"the-r-package-stagedtrees-for-structural","title":"The R Package stagedtrees for Structural Learning of Stratified Staged Trees","date":"2020-04-14","arxiv_id":"2004.06459","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-interpretable-patterns-for-flow","slug":"exploiting-interpretable-patterns-for-flow","title":"Exploiting Interpretable Patterns for Flow Prediction in Dockless Bike Sharing Systems","date":"2020-04-13","arxiv_id":"2004.05774","repositories_listed":1,"syntology":null},{"url":"/paper/which-visual-questions-are-difficult-to","slug":"which-visual-questions-are-difficult-to","title":"An Entropy Clustering Approach for Assessing Visual Question Difficulty","date":"2020-04-12","arxiv_id":"2004.05595","repositories_listed":1,"syntology":null},{"url":"/paper/hyperspectral-image-clustering-with-spatially","slug":"hyperspectral-image-clustering-with-spatially","title":"Hyperspectral Image Clustering with Spatially-Regularized Ultrametrics","date":"2020-04-10","arxiv_id":"2004.05048","repositories_listed":1,"syntology":null},{"url":"/paper/inference-in-the-stochastic-block-model-with","slug":"inference-in-the-stochastic-block-model-with","title":"Reliable Time Prediction in the Markov Stochastic Block Model","date":"2020-04-09","arxiv_id":"2004.04402","repositories_listed":1,"syntology":null},{"url":"/paper/learnable-subspace-clustering","slug":"learnable-subspace-clustering","title":"Learnable Subspace Clustering","date":"2020-04-09","arxiv_id":"2004.04520","repositories_listed":1,"syntology":null},{"url":"/paper/a-machine-learning-methodology-for-real-time","slug":"a-machine-learning-methodology-for-real-time","title":"A machine learning methodology for real-time forecasting of the 2019-2020 COVID-19 outbreak using Internet searches, news alerts, and estimates from mechanistic models","date":"2020-04-08","arxiv_id":"2004.04019","repositories_listed":1,"syntology":null},{"url":"/paper/geomstats-a-python-package-for-riemannian-2","slug":"geomstats-a-python-package-for-riemannian-2","title":"Geomstats: A Python Package for Riemannian Geometry in Machine Learning","date":"2020-04-07","arxiv_id":"2004.04667","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-person-re-identification-via","slug":"unsupervised-person-re-identification-via","title":"Unsupervised Person Re-identification via Softened Similarity Learning","date":"2020-04-07","arxiv_id":"2004.03547","repositories_listed":1,"syntology":null},{"url":"/paper/class-anchor-clustering-a-distance-based-loss","slug":"class-anchor-clustering-a-distance-based-loss","title":"Class Anchor Clustering: a Loss for Distance-based Open Set Recognition","date":"2020-04-06","arxiv_id":"2004.02434","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-embeddings-for-speaker","slug":"probabilistic-embeddings-for-speaker","title":"Probabilistic embeddings for speaker diarization","date":"2020-04-06","arxiv_id":"2004.04096","repositories_listed":1,"syntology":{"n":21,"n_ran":19,"n_constructed":0,"n_ran_checked":19,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":19,"n_pointer_only":0,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 19 with no instrument failure: 0 honoured, 0 violated, 19 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/probabilistic-embeddings-for-speaker#ran","syntology_url":"https://syntology.ai/paper/2004.04096","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.04096"}},"official":{"repos":["bsxfan/probabilistic_embeddings"],"state":"official (archive's flag): 19 ran","n_ran":19,"n_constructed":0,"n_ran_no_instrument_failure":19,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/selfore-self-supervised-relational-feature","slug":"selfore-self-supervised-relational-feature","title":"SelfORE: Self-supervised Relational Feature Learning for Open Relation Extraction","date":"2020-04-06","arxiv_id":"2004.02438","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-and-supervised-learning-with-the","slug":"unsupervised-and-supervised-learning-with-the","title":"Unsupervised and Supervised Learning with the Random Forest Algorithm for Traffic Scenario Clustering and Classification","date":"2020-04-05","arxiv_id":"2004.02126","repositories_listed":1,"syntology":null},{"url":"/paper/towards-designer-modeling-through-design","slug":"towards-designer-modeling-through-design","title":"Designer Modeling through Design Style Clustering","date":"2020-04-03","arxiv_id":"2004.01697","repositories_listed":1,"syntology":null},{"url":"/paper/a-clustering-framework-for-lexical","slug":"a-clustering-framework-for-lexical","title":"A Clustering Framework for Lexical Normalization of Roman Urdu","date":"2020-03-31","arxiv_id":"2004.00088","repositories_listed":1,"syntology":null},{"url":"/paper/unification-based-reconstruction-of","slug":"unification-based-reconstruction-of","title":"Unification-based Reconstruction of Multi-hop Explanations for Science Questions","date":"2020-03-31","arxiv_id":"2004.00061","repositories_listed":1,"syntology":null},{"url":"/paper/gossip-and-attend-context-sensitive-graph","slug":"gossip-and-attend-context-sensitive-graph","title":"Gossip and Attend: Context-Sensitive Graph Representation Learning","date":"2020-03-30","arxiv_id":"2004.00413","repositories_listed":1,"syntology":null},{"url":"/paper/pruned-wasserstein-index-generation-model-and","slug":"pruned-wasserstein-index-generation-model-and","title":"Pruned Wasserstein Index Generation Model and wigpy Package","date":"2020-03-30","arxiv_id":"2004.00999","repositories_listed":1,"syntology":null},{"url":"/paper/elastic-coupled-co-clustering-for-single-cell","slug":"elastic-coupled-co-clustering-for-single-cell","title":"Elastic Coupled Co-clustering for Single-Cell Genomic Data","date":"2020-03-29","arxiv_id":"2003.12970","repositories_listed":1,"syntology":null},{"url":"/paper/semi-federated-learning","slug":"semi-federated-learning","title":"Semi-Federated Learning","date":"2020-03-28","arxiv_id":"2003.12795","repositories_listed":1,"syntology":null},{"url":"/paper/fastdtw-is-approximate-and-generally-slower","slug":"fastdtw-is-approximate-and-generally-slower","title":"FastDTW is approximate and Generally Slower than the Algorithm it Approximates","date":"2020-03-25","arxiv_id":"2003.11246","repositories_listed":1,"syntology":null},{"url":"/paper/incorporating-user-s-preference-into","slug":"incorporating-user-s-preference-into","title":"Incorporating User's Preference into Attributed Graph Clustering","date":"2020-03-24","arxiv_id":"2003.11079","repositories_listed":1,"syntology":null},{"url":"/paper/deep-markov-spatio-temporal-factorization","slug":"deep-markov-spatio-temporal-factorization","title":"Deep Markov Spatio-Temporal Factorization","date":"2020-03-22","arxiv_id":"2003.09779","repositories_listed":1,"syntology":null},{"url":"/paper/a-unified-framework-for-spectral-clustering","slug":"a-unified-framework-for-spectral-clustering","title":"A unified framework for spectral clustering in sparse graphs","date":"2020-03-20","arxiv_id":"2003.09198","repositories_listed":1,"syntology":null},{"url":"/paper/privacy-preserving-traffic-flow-prediction-a","slug":"privacy-preserving-traffic-flow-prediction-a","title":"Privacy-preserving Traffic Flow Prediction: A Federated Learning Approach","date":"2020-03-19","arxiv_id":"2003.08725","repositories_listed":1,"syntology":null},{"url":"/paper/a-dynamic-reduction-network-for-point-clouds","slug":"a-dynamic-reduction-network-for-point-clouds","title":"A Dynamic Reduction Network for Point Clouds","date":"2020-03-18","arxiv_id":"2003.08013","repositories_listed":1,"syntology":null},{"url":"/paper/a-semi-supervised-sparse-k-means-algorithm","slug":"a-semi-supervised-sparse-k-means-algorithm","title":"A semi-supervised sparse K-Means algorithm","date":"2020-03-16","arxiv_id":"2003.06973","repositories_listed":1,"syntology":null},{"url":"/paper/deep-representation-learning-of-electronic","slug":"deep-representation-learning-of-electronic","title":"Deep Representation Learning of Electronic Health Records to Unlock Patient Stratification at Scale","date":"2020-03-14","arxiv_id":"2003.06516","repositories_listed":1,"syntology":null},{"url":"/paper/perception-of-prosodic-variation-for-speech","slug":"perception-of-prosodic-variation-for-speech","title":"Perception of prosodic variation for speech synthesis using an unsupervised discrete representation of F0","date":"2020-03-14","arxiv_id":"2003.06686","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-graph-convolutional-network-with","slug":"adaptive-graph-convolutional-network-with","title":"Adaptive Graph Convolutional Network with Attention Graph Clustering for Co-saliency Detection","date":"2020-03-13","arxiv_id":"2003.06167","repositories_listed":1,"syntology":null},{"url":"/paper/building-and-interpreting-deep-similarity","slug":"building-and-interpreting-deep-similarity","title":"Building and Interpreting Deep Similarity Models","date":"2020-03-11","arxiv_id":"2003.05431","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/building-and-interpreting-deep-similarity#ran","syntology_url":"https://syntology.ai/paper/2003.05431","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05431"}},"official":null}},{"url":"/paper/deep-generative-models-in-datashield","slug":"deep-generative-models-in-datashield","title":"Deep generative models in DataSHIELD","date":"2020-03-11","arxiv_id":"2003.07775","repositories_listed":1,"syntology":null},{"url":"/paper/neural-networks-are-surprisingly-modular","slug":"neural-networks-are-surprisingly-modular","title":"Pruned Neural Networks are Surprisingly Modular","date":"2020-03-10","arxiv_id":"2003.04881","repositories_listed":1,"syntology":null},{"url":"/paper/sets-clustering","slug":"sets-clustering","title":"Sets Clustering","date":"2020-03-09","arxiv_id":"2003.04135","repositories_listed":1,"syntology":null},{"url":"/paper/basisvae-translation-invariant-feature-level","slug":"basisvae-translation-invariant-feature-level","title":"BasisVAE: Translation-invariant feature-level clustering with Variational Autoencoders","date":"2020-03-06","arxiv_id":"2003.03462","repositories_listed":1,"syntology":null},{"url":"/paper/auto-tuning-spectral-clustering-for-speaker","slug":"auto-tuning-spectral-clustering-for-speaker","title":"Auto-Tuning Spectral Clustering for Speaker Diarization Using Normalized Maximum Eigengap","date":"2020-03-05","arxiv_id":"2003.02405","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-distributed-approximation-of","slug":"scalable-distributed-approximation-of","title":"Scalable Distributed Approximation of Internal Measures for Clustering Evaluation","date":"2020-03-03","arxiv_id":"2003.01430","repositories_listed":1,"syntology":null},{"url":"/paper/spatiotemporal-learning-of-multivehicle","slug":"spatiotemporal-learning-of-multivehicle","title":"Spatiotemporal Learning of Multivehicle Interaction Patterns in Lane-Change Scenarios","date":"2020-03-02","arxiv_id":"2003.00759","repositories_listed":1,"syntology":null},{"url":"/paper/statistical-power-for-cluster-analysis","slug":"statistical-power-for-cluster-analysis","title":"Statistical power for cluster analysis","date":"2020-03-01","arxiv_id":"2003.00381","repositories_listed":1,"syntology":null},{"url":"/paper/gatcluster-self-supervised-gaussian-attention","slug":"gatcluster-self-supervised-gaussian-attention","title":"GATCluster: Self-Supervised Gaussian-Attention Network for Image Clustering","date":"2020-02-27","arxiv_id":"2002.11863","repositories_listed":1,"syntology":null},{"url":"/paper/supervised-enhanced-soft-subspace-clustering","slug":"supervised-enhanced-soft-subspace-clustering","title":"Supervised Enhanced Soft Subspace Clustering (SESSC) for TSK Fuzzy Classifiers","date":"2020-02-27","arxiv_id":"2002.12404","repositories_listed":1,"syntology":null},{"url":"/paper/but-system-for-the-second-dihard-speech","slug":"but-system-for-the-second-dihard-speech","title":"BUT System for the Second DIHARD Speech Diarization Challenge","date":"2020-02-26","arxiv_id":"2002.11356","repositories_listed":1,"syntology":null},{"url":"/paper/compact-representation-of-uncertainty-in-1","slug":"compact-representation-of-uncertainty-in-1","title":"Data Structures & Algorithms for Exact Inference in Hierarchical Clustering","date":"2020-02-26","arxiv_id":"2002.11661","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/compact-representation-of-uncertainty-in-1#ran","syntology_url":"https://syntology.ai/paper/2002.11661","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.11661"}},"official":null}},{"url":"/paper/exposing-backdoors-in-robust-machine-learning","slug":"exposing-backdoors-in-robust-machine-learning","title":"Towards Backdoor Attacks and Defense in Robust Machine Learning Models","date":"2020-02-25","arxiv_id":"2003.00865","repositories_listed":1,"syntology":null},{"url":"/paper/three-approaches-for-personalization-with","slug":"three-approaches-for-personalization-with","title":"Three Approaches for Personalization with Applications to Federated Learning","date":"2020-02-25","arxiv_id":"2002.10619","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/three-approaches-for-personalization-with#ran","syntology_url":"https://syntology.ai/paper/2002.10619","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.10619"}},"official":null}},{"url":"/paper/end-to-end-neural-diarization-reformulating","slug":"end-to-end-neural-diarization-reformulating","title":"End-to-End Neural Diarization: Reformulating Speaker Diarization as Simple Multi-label Classification","date":"2020-02-24","arxiv_id":"2003.02966","repositories_listed":1,"syntology":null},{"url":"/paper/variational-wasserstein-barycenters-for","slug":"variational-wasserstein-barycenters-for","title":"Variational Wasserstein Barycenters for Geometric Clustering","date":"2020-02-24","arxiv_id":"2002.10543","repositories_listed":1,"syntology":null},{"url":"/paper/localized-flow-based-clustering-in","slug":"localized-flow-based-clustering-in","title":"Minimizing Localized Ratio Cut Objectives in Hypergraphs","date":"2020-02-21","arxiv_id":"2002.09441","repositories_listed":1,"syntology":null},{"url":"/paper/parameterized-objectives-and-algorithms-for","slug":"parameterized-objectives-and-algorithms-for","title":"Parameterized Correlation Clustering in Hypergraphs and Bipartite Graphs","date":"2020-02-21","arxiv_id":"2002.09460","repositories_listed":1,"syntology":null},{"url":"/paper/a-scalable-framework-for-sparse-clustering","slug":"a-scalable-framework-for-sparse-clustering","title":"Simple and Scalable Sparse k-means Clustering via Feature Ranking","date":"2020-02-20","arxiv_id":"2002.08541","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-graph-auto-encoder-for-general-data","slug":"adaptive-graph-auto-encoder-for-general-data","title":"Adaptive Graph Auto-Encoder for General Data Clustering","date":"2020-02-20","arxiv_id":"2002.08648","repositories_listed":1,"syntology":null},{"url":"/paper/neural-bayes-a-generic-parameterization","slug":"neural-bayes-a-generic-parameterization","title":"Neural Bayes: A Generic Parameterization Method for Unsupervised Representation Learning","date":"2020-02-20","arxiv_id":"2002.09046","repositories_listed":1,"syntology":null},{"url":"/paper/set2graph-learning-graphs-from-sets","slug":"set2graph-learning-graphs-from-sets","title":"Set2Graph: Learning Graphs From Sets","date":"2020-02-20","arxiv_id":"2002.08772","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/set2graph-learning-graphs-from-sets#ran","syntology_url":"https://syntology.ai/paper/2002.08772","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08772"}},"official":{"repos":["hadarser/SetToGraphPaper"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/the-fluidity-of-concept-representations-in","slug":"the-fluidity-of-concept-representations-in","title":"The Fluidity of Concept Representations in Human Brain Signals","date":"2020-02-20","arxiv_id":"2002.08880","repositories_listed":1,"syntology":null},{"url":"/paper/a-unified-framework-for-gaussian-mixture","slug":"a-unified-framework-for-gaussian-mixture","title":"Gaussian Mixture Reduction with Composite Transportation Divergence","date":"2020-02-19","arxiv_id":"2002.08410","repositories_listed":1,"syntology":null},{"url":"/paper/universal-domain-adaptation-through-self","slug":"universal-domain-adaptation-through-self","title":"Universal Domain Adaptation through Self Supervision","date":"2020-02-19","arxiv_id":"2002.07953","repositories_listed":1,"syntology":null},{"url":"/paper/individual-fairness-for-k-clustering","slug":"individual-fairness-for-k-clustering","title":"Individual Fairness for $k$-Clustering","date":"2020-02-17","arxiv_id":"2002.06742","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-group-a-bottom-up-framework-for-1","slug":"learning-to-group-a-bottom-up-framework-for-1","title":"Learning to Group: A Bottom-Up Framework for 3D Part Discovery in Unseen Categories","date":"2020-02-16","arxiv_id":"2002.06478","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-to-group-a-bottom-up-framework-for-1#ran","syntology_url":"https://syntology.ai/paper/2002.06478","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06478"}},"official":{"repos":["tiangeluo/Learning-to-Group"],"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/single-cell-entropy-to-quantify-the-cellular","slug":"single-cell-entropy-to-quantify-the-cellular","title":"Single-cell entropy to quantify the cellular transcription from single-cell RNA-seq data","date":"2020-02-15","arxiv_id":"2002.06391","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-based-on-point-set-kernel","slug":"clustering-based-on-point-set-kernel","title":"Point-Set Kernel Clustering","date":"2020-02-14","arxiv_id":"2002.05815","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-dyadic-independence-models-with","slug":"scalable-dyadic-independence-models-with","title":"Block-Approximated Exponential Random Graphs","date":"2020-02-14","arxiv_id":"2002.07076","repositories_listed":1,"syntology":null},{"url":"/paper/automatically-discovering-and-learning-new-1","slug":"automatically-discovering-and-learning-new-1","title":"Automatically Discovering and Learning New Visual Categories with Ranking Statistics","date":"2020-02-13","arxiv_id":"2002.05714","repositories_listed":1,"syntology":null},{"url":"/paper/cbir-using-features-derived-by-deep-learning","slug":"cbir-using-features-derived-by-deep-learning","title":"CBIR using features derived by Deep Learning","date":"2020-02-13","arxiv_id":"2002.07877","repositories_listed":1,"syntology":null},{"url":"/paper/tree-sne-hierarchical-clustering-and","slug":"tree-sne-hierarchical-clustering-and","title":"Tree-SNE: Hierarchical Clustering and Visualization Using t-SNE","date":"2020-02-13","arxiv_id":"2002.05687","repositories_listed":1,"syntology":null},{"url":"/paper/co-optimal-transport","slug":"co-optimal-transport","title":"CO-Optimal Transport","date":"2020-02-10","arxiv_id":"2002.03731","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/co-optimal-transport#ran","syntology_url":"https://syntology.ai/paper/2002.03731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.03731"}},"official":{"repos":["PythonOT/COOT"],"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/graph-neural-distance-metric-learning-with","slug":"graph-neural-distance-metric-learning-with","title":"Graph Neural Distance Metric Learning with Graph-Bert","date":"2020-02-09","arxiv_id":"2002.03427","repositories_listed":1,"syntology":null},{"url":"/paper/fair-correlation-clustering","slug":"fair-correlation-clustering","title":"Fair Correlation Clustering","date":"2020-02-06","arxiv_id":"2002.02274","repositories_listed":1,"syntology":null},{"url":"/paper/opposite-structure-learning-for-semi","slug":"opposite-structure-learning-for-semi","title":"Contradictory Structure Learning for Semi-supervised Domain Adaptation","date":"2020-02-06","arxiv_id":"2002.02545","repositories_listed":1,"syntology":null},{"url":"/paper/simultaneous-prediction-and-community","slug":"simultaneous-prediction-and-community","title":"Simultaneous prediction and community detection for networks with application to neuroimaging","date":"2020-02-05","arxiv_id":"2002.01645","repositories_listed":1,"syntology":null},{"url":"/paper/supporting-dnn-safety-analysis-and-retraining","slug":"supporting-dnn-safety-analysis-and-retraining","title":"Supporting DNN Safety Analysis and Retraining through Heatmap-based Unsupervised Learning","date":"2020-02-03","arxiv_id":"2002.00863","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-multi-view-subspace-clustering-for","slug":"adaptive-multi-view-subspace-clustering-for","title":"Adaptive multi-view subspace clustering for high-dimensional data,","date":"2020-02-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/enhancement-of-short-text-clustering-by","slug":"enhancement-of-short-text-clustering-by","title":"Enhancement of Short Text Clustering by Iterative Classification","date":"2020-01-31","arxiv_id":"2001.11631","repositories_listed":1,"syntology":null},{"url":"/paper/mean-shift-cluster-recognition-method","slug":"mean-shift-cluster-recognition-method","title":"Mean shift cluster recognition method implementation in the nested sampling algorithm","date":"2020-01-31","arxiv_id":"2002.01431","repositories_listed":1,"syntology":null},{"url":"/paper/symmetrical-synthesis-for-deep-metric","slug":"symmetrical-synthesis-for-deep-metric","title":"Symmetrical Synthesis for Deep Metric Learning","date":"2020-01-31","arxiv_id":"2001.11658","repositories_listed":1,"syntology":null},{"url":"/paper/csnns-unsupervised-backpropagation-free","slug":"csnns-unsupervised-backpropagation-free","title":"CSNNs: Unsupervised, Backpropagation-free Convolutional Neural Networks for Representation Learning","date":"2020-01-28","arxiv_id":"2001.10388","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neighborhood-attentive-pooling-1","slug":"graph-neighborhood-attentive-pooling-1","title":"Graph Neighborhood Attentive Pooling","date":"2020-01-28","arxiv_id":"2001.10394","repositories_listed":1,"syntology":null},{"url":"/paper/comprehensive-analysis-of-time-series","slug":"comprehensive-analysis-of-time-series","title":"A clustering approach to time series forecasting using neural networks: A comparative study on distance-based vs. feature-based clustering methods","date":"2020-01-27","arxiv_id":"2001.09547","repositories_listed":1,"syntology":null},{"url":"/paper/discovery-of-self-assembling-conjugated","slug":"discovery-of-self-assembling-conjugated","title":"Discovery of Self-Assembling $π$-Conjugated Peptides by Active Learning-Directed Coarse-Grained Molecular Simulation","date":"2020-01-27","arxiv_id":"2002.01563","repositories_listed":1,"syntology":null},{"url":"/paper/an-explicit-local-and-global-representation","slug":"an-explicit-local-and-global-representation","title":"An Explicit Local and Global Representation Disentanglement Framework with Applications in Deep Clustering and Unsupervised Object Detection","date":"2020-01-24","arxiv_id":"2001.08957","repositories_listed":1,"syntology":{"n":18,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/an-explicit-local-and-global-representation#ran","syntology_url":"https://syntology.ai/paper/2001.08957","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.08957"}},"official":{"repos":["51616/split-vae"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/simple-and-effective-graph-autoencoders-with","slug":"simple-and-effective-graph-autoencoders-with","title":"Simple and Effective Graph Autoencoders with One-Hop Linear Models","date":"2020-01-21","arxiv_id":"2001.07614","repositories_listed":1,"syntology":null},{"url":"/paper/a-hybrid-algorithm-for-disparity-calculation","slug":"a-hybrid-algorithm-for-disparity-calculation","title":"A hybrid algorithm for disparity calculation from sparse disparity estimates based on stereo vision","date":"2020-01-20","arxiv_id":"2001.06967","repositories_listed":1,"syntology":null},{"url":"/paper/multi-level-representation-learning-for-deep","slug":"multi-level-representation-learning-for-deep","title":"Multi-Level Representation Learning for Deep Subspace Clustering","date":"2020-01-19","arxiv_id":"2001.08533","repositories_listed":1,"syntology":null},{"url":"/paper/two-cycle-learning-clustering-based","slug":"two-cycle-learning-clustering-based","title":"CycleCluster: Modernising Clustering Regularisation for Deep Semi-Supervised Classification","date":"2020-01-15","arxiv_id":"2001.05317","repositories_listed":1,"syntology":null},{"url":"/paper/conditional-variational-inference-with","slug":"conditional-variational-inference-with","title":"CATVI: Conditional and Adaptively Truncated Variational Inference for Hierarchical Bayesian Nonparametric Models","date":"2020-01-13","arxiv_id":"2001.04508","repositories_listed":1,"syntology":null},{"url":"/paper/representations-lexicales-pour-la-detection","slug":"representations-lexicales-pour-la-detection","title":"Représentations lexicales pour la détection non supervisée d'événements dans un flux de tweets : étude sur des corpus français et anglais","date":"2020-01-13","arxiv_id":"2001.04139","repositories_listed":1,"syntology":null},{"url":"/paper/entropy-regularized-power-k-means-clustering","slug":"entropy-regularized-power-k-means-clustering","title":"Entropy Regularized Power k-Means Clustering","date":"2020-01-10","arxiv_id":"2001.03452","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-approaches-for-global-minimum","slug":"clustering-approaches-for-global-minimum","title":"Clustering Approaches for Global Minimum Variance Portfolio","date":"2020-01-09","arxiv_id":"2001.02966","repositories_listed":1,"syntology":null}],"record_sha256":"e85d158d977833e078510b8d048f10fa1f89df62d9bb857eabf158fde9df63b4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}