{"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/22","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":22,"pages_in_order":108,"rows_per_page":100,"rows":[2101,2200],"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/21","next":"/task/clustering/papers/23","papers":[{"url":"/paper/supervised-discriminative-sparse-pca-with","slug":"supervised-discriminative-sparse-pca-with","title":"Supervised Discriminative Sparse PCA with Adaptive Neighbors for Dimensionality Reduction","date":"2020-01-09","arxiv_id":"2001.03103","repositories_listed":1,"syntology":null},{"url":"/paper/can-x2vec-save-lives-integrating-graph-and","slug":"can-x2vec-save-lives-integrating-graph-and","title":"Can x2vec Save Lives? Integrating Graph and Language Embeddings for Automatic Mental Health Classification","date":"2020-01-04","arxiv_id":"2001.01126","repositories_listed":1,"syntology":null},{"url":"/paper/louvainne-hierarchical-louvain-method-for","slug":"louvainne-hierarchical-louvain-method-for","title":"LouvainNE: Hierarchical Louvain Method for High Quality and Scalable Network Embedding.","date":"2020-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/p-norm-flow-diffusion-for-local-graph-1","slug":"p-norm-flow-diffusion-for-local-graph-1","title":"p-Norm Flow Diffusion for Local Graph Clustering","date":"2020-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/the-gh-exin-neural-network-for-hierarchical","slug":"the-gh-exin-neural-network-for-hierarchical","title":"The GH-EXIN neural network for hierarchical clustering","date":"2020-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/scalable-hierarchical-clustering-with-tree","slug":"scalable-hierarchical-clustering-with-tree","title":"Scalable Hierarchical Clustering with Tree Grafting","date":"2019-12-31","arxiv_id":"2001.00076","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-discrete-smoothing-for-high","slug":"adaptive-discrete-smoothing-for-high","title":"Adaptive Discrete Smoothing for High-Dimensional and Nonlinear Panel Data","date":"2019-12-30","arxiv_id":"1912.12867","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-learning-with-or-without-labels","slug":"end-to-end-learning-with-or-without-labels","title":"Discriminative Clustering with Representation Learning with any Ratio of Labeled to Unlabeled Data","date":"2019-12-30","arxiv_id":"1912.12979","repositories_listed":1,"syntology":null},{"url":"/paper/deft-funnel-an-open-source-global","slug":"deft-funnel-an-open-source-global","title":"DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems","date":"2019-12-29","arxiv_id":"1912.12637","repositories_listed":1,"syntology":null},{"url":"/paper/interpreting-lstm-prediction-on-solar-flare","slug":"interpreting-lstm-prediction-on-solar-flare","title":"Interpreting LSTM Prediction on Solar Flare Eruption with Time-series Clustering","date":"2019-12-27","arxiv_id":"1912.12360","repositories_listed":1,"syntology":null},{"url":"/paper/graph-embedded-pose-clustering-for-anomaly","slug":"graph-embedded-pose-clustering-for-anomaly","title":"Graph Embedded Pose Clustering for Anomaly Detection","date":"2019-12-26","arxiv_id":"1912.11850","repositories_listed":1,"syntology":null},{"url":"/paper/n-gram-statistical-stemmer-for-bangla-corpus","slug":"n-gram-statistical-stemmer-for-bangla-corpus","title":"N-gram Statistical Stemmer for Bangla Corpus","date":"2019-12-25","arxiv_id":"1912.11612","repositories_listed":1,"syntology":null},{"url":"/paper/a-non-negative-symmetric-encoder-decoder","slug":"a-non-negative-symmetric-encoder-decoder","title":"A Non-negative Symmetric Encoder-Decoder Approach for Community Detection","date":"2019-12-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/deep-manifold-embedding-for-hyperspectral","slug":"deep-manifold-embedding-for-hyperspectral","title":"Deep Manifold Embedding for Hyperspectral Image Classification","date":"2019-12-24","arxiv_id":"1912.11264","repositories_listed":1,"syntology":null},{"url":"/paper/graph-based-parallel-large-scale-structure","slug":"graph-based-parallel-large-scale-structure","title":"Graph-Based Parallel Large Scale Structure from Motion","date":"2019-12-23","arxiv_id":"1912.10659","repositories_listed":1,"syntology":null},{"url":"/paper/quantifying-the-effects-of-the-2008-recession","slug":"quantifying-the-effects-of-the-2008-recession","title":"Quantifying the Effects of the 2008 Recession using the Zillow Dataset","date":"2019-12-23","arxiv_id":"1912.11341","repositories_listed":1,"syntology":null},{"url":"/paper/hybrid-machine-learning-models-of-classifying","slug":"hybrid-machine-learning-models-of-classifying","title":"Hybrid Machine Learning Models of Classifying Residential Requests for Smart Dispatching","date":"2019-12-22","arxiv_id":"1912.10546","repositories_listed":1,"syntology":null},{"url":"/paper/interpretable-embeddings-from-molecular","slug":"interpretable-embeddings-from-molecular","title":"Interpretable Embeddings From Molecular Simulations Using Gaussian Mixture Variational Autoencoders","date":"2019-12-22","arxiv_id":"1912.12175","repositories_listed":1,"syntology":null},{"url":"/paper/measuring-dataset-granularity","slug":"measuring-dataset-granularity","title":"Measuring Dataset Granularity","date":"2019-12-21","arxiv_id":"1912.10154","repositories_listed":1,"syntology":null},{"url":"/paper/what-do-asian-religions-have-in-common-an","slug":"what-do-asian-religions-have-in-common-an","title":"What do Asian Religions Have in Common? An Unsupervised Text Analytics Exploration","date":"2019-12-20","arxiv_id":"1912.10847","repositories_listed":1,"syntology":null},{"url":"/paper/s-drn-stabilized-developmental-resonance","slug":"s-drn-stabilized-developmental-resonance","title":"s-DRN: Stabilized Developmental Resonance Network","date":"2019-12-18","arxiv_id":"1912.08541","repositories_listed":1,"syntology":null},{"url":"/paper/balancing-the-tradeoff-between-clustering","slug":"balancing-the-tradeoff-between-clustering","title":"Balancing the Tradeoff Between Clustering Value and Interpretability","date":"2019-12-17","arxiv_id":"1912.07820","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/balancing-the-tradeoff-between-clustering#ran","syntology_url":"https://syntology.ai/paper/1912.07820","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.07820"}},"official":{"repos":["sandysa/Interpretable_Clustering"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/theoretically-efficient-and-practical","slug":"theoretically-efficient-and-practical","title":"Theoretically-Efficient and Practical Parallel DBSCAN","date":"2019-12-12","arxiv_id":"1912.06255","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-feature-selection-based-on","slug":"unsupervised-feature-selection-based-on","title":"Unsupervised Feature Selection based on Adaptive Similarity Learning and Subspace Clustering","date":"2019-12-10","arxiv_id":"1912.05458","repositories_listed":1,"syntology":null},{"url":"/paper/a-time-resolved-clustering-method-revealing","slug":"a-time-resolved-clustering-method-revealing","title":"A time resolved clustering method revealing longterm structures and their short-term internal dynamics","date":"2019-12-09","arxiv_id":"1912.04261","repositories_listed":1,"syntology":null},{"url":"/paper/multilingual-aspect-clustering-for-sentiment","slug":"multilingual-aspect-clustering-for-sentiment","title":"Multilingual aspect clustering for sentiment analysis","date":"2019-12-09","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/clusterfit-improving-generalization-of-visual","slug":"clusterfit-improving-generalization-of-visual","title":"ClusterFit: Improving Generalization of Visual Representations","date":"2019-12-06","arxiv_id":"1912.03330","repositories_listed":1,"syntology":null},{"url":"/paper/a-sparse-negative-binomial-mixture-model-for","slug":"a-sparse-negative-binomial-mixture-model-for","title":"A sparse negative binomial mixture model for clustering RNA-seq count data","date":"2019-12-05","arxiv_id":"1912.02399","repositories_listed":1,"syntology":null},{"url":"/paper/multi-modal-deep-clustering-unsupervised","slug":"multi-modal-deep-clustering-unsupervised","title":"Multi-Modal Deep Clustering: Unsupervised Partitioning of Images","date":"2019-12-05","arxiv_id":"1912.02678","repositories_listed":1,"syntology":null},{"url":"/paper/extractive-multi-document-summarization-using-2","slug":"extractive-multi-document-summarization-using-2","title":"Extractive Multi-document Summarization using K-means, Centroid-based Method, MMR, and Sentence Position","date":"2019-12-04","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/asymmetric-co-teaching-for-unsupervised-cross","slug":"asymmetric-co-teaching-for-unsupervised-cross","title":"Asymmetric Co-Teaching for Unsupervised Cross Domain Person Re-Identification","date":"2019-12-03","arxiv_id":"1912.01349","repositories_listed":1,"syntology":null},{"url":"/paper/scikit-hubness-hubness-reduction-and","slug":"scikit-hubness-hubness-reduction-and","title":"scikit-hubness: Hubness Reduction and Approximate Neighbor Search","date":"2019-12-02","arxiv_id":"1912.00706","repositories_listed":1,"syntology":null},{"url":"/paper/using-dimensionality-reduction-to-optimize-t","slug":"using-dimensionality-reduction-to-optimize-t","title":"Using Dimensionality Reduction to Optimize t-SNE","date":"2019-12-02","arxiv_id":"1912.01098","repositories_listed":1,"syntology":null},{"url":"/paper/combinatorial-inference-against-label-noise","slug":"combinatorial-inference-against-label-noise","title":"Combinatorial Inference against Label Noise","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/dm2c-deep-mixed-modal-clustering","slug":"dm2c-deep-mixed-modal-clustering","title":"DM2C: Deep Mixed-Modal Clustering","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fully-dynamic-consistent-facility-location","slug":"fully-dynamic-consistent-facility-location","title":"Fully Dynamic Consistent Facility Location","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/greedy-sampling-for-approximate-clustering-in","slug":"greedy-sampling-for-approximate-clustering-in","title":"Greedy Sampling for Approximate Clustering in the Presence of Outliers","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/guided-similarity-separation-for-image","slug":"guided-similarity-separation-for-image","title":"Guided Similarity Separation for Image Retrieval","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/optimal-sampling-and-clustering-in-the","slug":"optimal-sampling-and-clustering-in-the","title":"Optimal Sampling and Clustering in the Stochastic Block Model","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/selective-sampling-based-scalable-sparse","slug":"selective-sampling-based-scalable-sparse","title":"Selective Sampling-based Scalable Sparse Subspace Clustering","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/self-routing-capsule-networks","slug":"self-routing-capsule-networks","title":"Self-Routing Capsule Networks","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/specific-and-shared-causal-relation-modeling","slug":"specific-and-shared-causal-relation-modeling","title":"Specific and Shared Causal Relation Modeling and Mechanism-Based Clustering","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/spectral-modification-of-graphs-for-improved","slug":"spectral-modification-of-graphs-for-improved","title":"Spectral Modification of Graphs for Improved Spectral Clustering","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-co-learning-on-g-manifolds","slug":"unsupervised-co-learning-on-g-manifolds","title":"Unsupervised Co-Learning on G-Manifolds Across Irreducible Representations","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/predominant-musical-instrument-classification","slug":"predominant-musical-instrument-classification","title":"Predominant Musical Instrument Classification based on Spectral Features","date":"2019-11-30","arxiv_id":"1912.02606","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-learning-by-cross-modal-audio","slug":"self-supervised-learning-by-cross-modal-audio","title":"Self-Supervised Learning by Cross-Modal Audio-Video Clustering","date":"2019-11-28","arxiv_id":"1911.12667","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/self-supervised-learning-by-cross-modal-audio#ran","syntology_url":"https://syntology.ai/paper/1911.12667","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.12667"}},"official":{"repos":["HumamAlwassel/XDC"],"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/my-approach-your-apparatus-entropy-based","slug":"my-approach-your-apparatus-entropy-based","title":"My Approach = Your Apparatus? Entropy-Based Topic Modeling on Multiple Domain-Specific Text Collections","date":"2019-11-25","arxiv_id":"1911.11240","repositories_listed":1,"syntology":null},{"url":"/paper/regularized-and-smooth-double-core-tensor","slug":"regularized-and-smooth-double-core-tensor","title":"Regularized and Smooth Double Core Tensor Factorization for Heterogeneous Data","date":"2019-11-24","arxiv_id":"1911.10454","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-hierarchical-recurrent-graph","slug":"semi-supervised-hierarchical-recurrent-graph","title":"Semi-Supervised Hierarchical Recurrent Graph Neural Network for City-Wide Parking Availability Prediction","date":"2019-11-24","arxiv_id":"1911.10516","repositories_listed":1,"syntology":null},{"url":"/paper/a-domain-adaptive-density-clustering","slug":"a-domain-adaptive-density-clustering","title":"A Domain Adaptive Density Clustering Algorithm for Data with Varying Density Distribution","date":"2019-11-23","arxiv_id":"1911.10293","repositories_listed":1,"syntology":null},{"url":"/paper/memory-efficient-episodic-control","slug":"memory-efficient-episodic-control","title":"Memory-Efficient Episodic Control Reinforcement Learning with Dynamic Online k-means","date":"2019-11-21","arxiv_id":"1911.09560","repositories_listed":1,"syntology":null},{"url":"/paper/s-raster-contraction-clustering-for-evolving","slug":"s-raster-contraction-clustering-for-evolving","title":"S-RASTER: Contraction Clustering for Evolving Data Streams","date":"2019-11-21","arxiv_id":"1911.09447","repositories_listed":1,"syntology":null},{"url":"/paper/cnak-cluster-number-assisted-k-means","slug":"cnak-cluster-number-assisted-k-means","title":"CNAK : Cluster Number Assisted K-means","date":"2019-11-20","arxiv_id":"1911.08871","repositories_listed":1,"syntology":null},{"url":"/paper/discovering-new-intents-via-constrained-deep","slug":"discovering-new-intents-via-constrained-deep","title":"Discovering New Intents via Constrained Deep Adaptive Clustering with Cluster Refinement","date":"2019-11-20","arxiv_id":"1911.08891","repositories_listed":1,"syntology":null},{"url":"/paper/cup-cluster-pruning-for-compressing-deep","slug":"cup-cluster-pruning-for-compressing-deep","title":"CUP: Cluster Pruning for Compressing Deep Neural Networks","date":"2019-11-19","arxiv_id":"1911.08630","repositories_listed":1,"syntology":null},{"url":"/paper/gromov-wasserstein-factorization-models-for","slug":"gromov-wasserstein-factorization-models-for","title":"Gromov-Wasserstein Factorization Models for Graph Clustering","date":"2019-11-19","arxiv_id":"1911.08530","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-deep-graph-infomax","slug":"heterogeneous-deep-graph-infomax","title":"Heterogeneous Deep Graph Infomax","date":"2019-11-19","arxiv_id":"1911.08538","repositories_listed":1,"syntology":null},{"url":"/paper/constructing-multiple-tasks-for-augmentation","slug":"constructing-multiple-tasks-for-augmentation","title":"Constructing Multiple Tasks for Augmentation: Improving Neural Image Classification With K-means Features","date":"2019-11-18","arxiv_id":"1911.07518","repositories_listed":1,"syntology":null},{"url":"/paper/improving-document-classification-with-multi","slug":"improving-document-classification-with-multi","title":"Improving Document Classification with Multi-Sense Embeddings","date":"2019-11-18","arxiv_id":"1911.07918","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-domain-adaptation-via-structured","slug":"unsupervised-domain-adaptation-via-structured","title":"Unsupervised Domain Adaptation via Structured Prediction Based Selective Pseudo-Labeling","date":"2019-11-18","arxiv_id":"1911.07982","repositories_listed":1,"syntology":null},{"url":"/paper/a-coupled-autoencoder-approach-for-multi-1","slug":"a-coupled-autoencoder-approach-for-multi-1","title":"A coupled autoencoder approach for multi-modal analysis of cell types","date":"2019-11-06","arxiv_id":"1911.05663","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/a-coupled-autoencoder-approach-for-multi-1#ran","syntology_url":"https://syntology.ai/paper/1911.05663","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.05663"}},"official":{"repos":["AllenInstitute/coupledAE"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/hierarchical-mixtures-of-generators-for","slug":"hierarchical-mixtures-of-generators-for","title":"Hierarchical Mixtures of Generators for Adversarial Learning","date":"2019-11-05","arxiv_id":"1911.02069","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/hierarchical-mixtures-of-generators-for#ran","syntology_url":"https://syntology.ai/paper/1911.02069","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02069"}},"official":{"repos":["alper111/hmog"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/spherical-text-embedding","slug":"spherical-text-embedding","title":"Spherical Text Embedding","date":"2019-11-04","arxiv_id":"1911.01196","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/spherical-text-embedding#ran","syntology_url":"https://syntology.ai/paper/1911.01196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.01196"}},"official":{"repos":["yumeng5/Spherical-Text-Embedding"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/supervised-online-diarization-with-sample","slug":"supervised-online-diarization-with-sample","title":"Supervised online diarization with sample mean loss for multi-domain data","date":"2019-11-04","arxiv_id":"1911.01266","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-in-partially-labeled-stochastic","slug":"clustering-in-partially-labeled-stochastic","title":"Clustering in Partially Labeled Stochastic Block Models via Total Variation Minimization","date":"2019-11-03","arxiv_id":"1911.00958","repositories_listed":1,"syntology":null},{"url":"/paper/bert-is-not-an-interlingua-and-the-bias-of","slug":"bert-is-not-an-interlingua-and-the-bias-of","title":"BERT is Not an Interlingua and the Bias of Tokenization","date":"2019-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/centroid-based-scene-classification-cbsc","slug":"centroid-based-scene-classification-cbsc","title":"Centroid Based Concept Learning for RGB-D Indoor Scene Classification","date":"2019-11-01","arxiv_id":"1911.00155","repositories_listed":1,"syntology":null},{"url":"/paper/solving-nmf-with-smoothness-and-sparsity","slug":"solving-nmf-with-smoothness-and-sparsity","title":"Solving NMF with smoothness and sparsity constraints using PALM","date":"2019-10-31","arxiv_id":"1910.14576","repositories_listed":1,"syntology":null},{"url":"/paper/a-prototypical-triplet-loss-for-cover","slug":"a-prototypical-triplet-loss-for-cover","title":"A Prototypical Triplet Loss for Cover Detection","date":"2019-10-22","arxiv_id":"1910.09862","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/a-prototypical-triplet-loss-for-cover#ran","syntology_url":"https://syntology.ai/paper/1910.09862","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.09862"}},"official":{"repos":["gdoras/PrototypicalTripletLoss"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/discriminative-neural-clustering-for-speaker","slug":"discriminative-neural-clustering-for-speaker","title":"Discriminative Neural Clustering for Speaker Diarisation","date":"2019-10-22","arxiv_id":"1910.09703","repositories_listed":1,"syntology":null},{"url":"/paper/hypergraph-clustering-with-categorical-edge","slug":"hypergraph-clustering-with-categorical-edge","title":"Clustering in graphs and hypergraphs with categorical edge labels","date":"2019-10-22","arxiv_id":"1910.09943","repositories_listed":1,"syntology":null},{"url":"/paper/icentia11k-an-unsupervised-representation","slug":"icentia11k-an-unsupervised-representation","title":"Icentia11K: An Unsupervised Representation Learning Dataset for Arrhythmia Subtype Discovery","date":"2019-10-21","arxiv_id":"1910.09570","repositories_listed":1,"syntology":null},{"url":"/paper/but-system-description-for-dihard-speech","slug":"but-system-description-for-dihard-speech","title":"BUT System Description for DIHARD Speech Diarization Challenge 2019","date":"2019-10-19","arxiv_id":"1910.08847","repositories_listed":1,"syntology":null},{"url":"/paper/mixture-of-experts-variational-autoencoder","slug":"mixture-of-experts-variational-autoencoder","title":"Mixture-of-Experts Variational Autoencoder for Clustering and Generating from Similarity-Based Representations on Single Cell Data","date":"2019-10-17","arxiv_id":"1910.07763","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/mixture-of-experts-variational-autoencoder#ran","syntology_url":"https://syntology.ai/paper/1910.07763","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.07763"}},"official":{"repos":["andkopf/MoESimVAE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/fishdbc-flexible-incremental-scalable","slug":"fishdbc-flexible-incremental-scalable","title":"FISHDBC: Flexible, Incremental, Scalable, Hierarchical Density-Based Clustering for Arbitrary Data and Distance","date":"2019-10-16","arxiv_id":"1910.07283","repositories_listed":1,"syntology":null},{"url":"/paper/segsort-segmentation-by-discriminative","slug":"segsort-segmentation-by-discriminative","title":"SegSort: Segmentation by Discriminative Sorting of Segments","date":"2019-10-15","arxiv_id":"1910.06962","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":0,"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/segsort-segmentation-by-discriminative#ran","syntology_url":"https://syntology.ai/paper/1910.06962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.06962"}},"official":null}},{"url":"/paper/the-local-elasticity-of-neural-networks","slug":"the-local-elasticity-of-neural-networks","title":"The Local Elasticity of Neural Networks","date":"2019-10-15","arxiv_id":"1910.06943","repositories_listed":1,"syntology":null},{"url":"/paper/discern-diversity-based-selection-of","slug":"discern-diversity-based-selection-of","title":"DISCERN: Diversity-based Selection of Centroids for k-Estimation and Rapid Non-stochastic Clustering","date":"2019-10-14","arxiv_id":"1910.05933","repositories_listed":1,"syntology":null},{"url":"/paper/combining-geometric-and-topological","slug":"combining-geometric-and-topological","title":"Combining Geometric and Topological Information for Boundary Estimation","date":"2019-10-10","arxiv_id":"1910.04778","repositories_listed":1,"syntology":null},{"url":"/paper/detecting-organized-ecommerce-fraud-using","slug":"detecting-organized-ecommerce-fraud-using","title":"Detecting organized eCommerce fraud using scalable categorical clustering","date":"2019-10-10","arxiv_id":"1910.04514","repositories_listed":1,"syntology":null},{"url":"/paper/active-ordinal-tuplewise-querying-for","slug":"active-ordinal-tuplewise-querying-for","title":"Active Ordinal Querying for Tuplewise Similarity Learning","date":"2019-10-09","arxiv_id":"1910.04115","repositories_listed":1,"syntology":null},{"url":"/paper/next-integrated-result-modelling-for-stopping","slug":"next-integrated-result-modelling-for-stopping","title":"Next integrated result modelling for stopping the text field recognition process in a video using a result model with per-character alternatives","date":"2019-10-09","arxiv_id":"1910.04107","repositories_listed":1,"syntology":null},{"url":"/paper/mim-mutual-information-machine","slug":"mim-mutual-information-machine","title":"MIM: Mutual Information Machine","date":"2019-10-08","arxiv_id":"1910.03175","repositories_listed":1,"syntology":null},{"url":"/paper/sky-pixel-detection-in-outdoor-imagery-using","slug":"sky-pixel-detection-in-outdoor-imagery-using","title":"Sky pixel detection in outdoor imagery using an adaptive algorithm and machine learning","date":"2019-10-08","arxiv_id":"1910.03182","repositories_listed":1,"syntology":null},{"url":"/paper/deep-neural-network-compression-for-image","slug":"deep-neural-network-compression-for-image","title":"Deep Neural Network Compression for Image Classification and Object Detection","date":"2019-10-07","arxiv_id":"1910.02747","repositories_listed":1,"syntology":null},{"url":"/paper/targeted-sampling-from-massive-blockmodel","slug":"targeted-sampling-from-massive-blockmodel","title":"Targeted sampling from massive block model graphs with personalized PageRank","date":"2019-10-04","arxiv_id":"1910.12937","repositories_listed":1,"syntology":null},{"url":"/paper/keep-it-simple-graph-autoencoders-without","slug":"keep-it-simple-graph-autoencoders-without","title":"Keep It Simple: Graph Autoencoders Without Graph Convolutional Networks","date":"2019-10-02","arxiv_id":"1910.00942","repositories_listed":1,"syntology":null},{"url":"/paper/deep-clustering-by-gaussian-mixture","slug":"deep-clustering-by-gaussian-mixture","title":"Deep Clustering by Gaussian Mixture Variational Autoencoders With Graph Embedding","date":"2019-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/deep-lifetime-clustering-1","slug":"deep-lifetime-clustering-1","title":"Deep Lifetime Clustering","date":"2019-10-01","arxiv_id":"1910.00547","repositories_listed":1,"syntology":null},{"url":"/paper/view-consistent-4d-light-field-superpixel","slug":"view-consistent-4d-light-field-superpixel","title":"View-Consistent 4D Light Field Superpixel Segmentation","date":"2019-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/k-metamodes-frequency-and-ensemble-based","slug":"k-metamodes-frequency-and-ensemble-based","title":"K-Metamodes: frequency- and ensemble-based distributed k-modes clustering for security analytics","date":"2019-09-30","arxiv_id":"1909.13721","repositories_listed":1,"syntology":null},{"url":"/paper/learning-in-confusion-batch-active-learning","slug":"learning-in-confusion-batch-active-learning","title":"Noisy Batch Active Learning with Deterministic Annealing","date":"2019-09-27","arxiv_id":"1909.12473","repositories_listed":1,"syntology":null},{"url":"/paper/attributed-graph-learning-with-2-d-graph-1","slug":"attributed-graph-learning-with-2-d-graph-1","title":"Dimensionwise Separable 2-D Graph Convolution for Unsupervised and Semi-Supervised Learning on Graphs","date":"2019-09-26","arxiv_id":"1909.12038","repositories_listed":1,"syntology":null},{"url":"/paper/stacnas-towards-stable-and-consistent","slug":"stacnas-towards-stable-and-consistent","title":"Hierarchical Neural Architecture Search via Operator Clustering","date":"2019-09-26","arxiv_id":"1909.11926","repositories_listed":1,"syntology":null},{"url":"/paper/combining-machine-learning-models-using-combo","slug":"combining-machine-learning-models-using-combo","title":"Combining Machine Learning Models using combo Library","date":"2019-09-21","arxiv_id":"1910.07988","repositories_listed":1,"syntology":null},{"url":"/paper/daoc-stable-clustering-of-large-networks","slug":"daoc-stable-clustering-of-large-networks","title":"DAOC: Stable Clustering of Large Networks","date":"2019-09-19","arxiv_id":"1909.08786","repositories_listed":1,"syntology":null},{"url":"/paper/on-efficient-multilevel-clustering-via","slug":"on-efficient-multilevel-clustering-via","title":"On Efficient Multilevel Clustering via Wasserstein Distances","date":"2019-09-19","arxiv_id":"1909.08787","repositories_listed":1,"syntology":null},{"url":"/paper/global-optimal-path-based-clustering","slug":"global-optimal-path-based-clustering","title":"Global Optimal Path-Based Clustering Algorithm","date":"2019-09-17","arxiv_id":"1909.07774","repositories_listed":1,"syntology":null},{"url":"/paper/multi-graph-fusion-for-multi-view-spectral","slug":"multi-graph-fusion-for-multi-view-spectral","title":"Multi-graph Fusion for Multi-view Spectral Clustering","date":"2019-09-16","arxiv_id":"1909.06940","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-self-attention-network-for-medical","slug":"temporal-self-attention-network-for-medical","title":"Temporal Self-Attention Network for Medical Concept Embedding","date":"2019-09-15","arxiv_id":"1909.06886","repositories_listed":1,"syntology":null}],"record_sha256":"305a4ed5f491ad299761234c4ea2767e714aa22ae2906783c24069b51d6f0dd8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}