{"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/27","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":27,"pages_in_order":108,"rows_per_page":100,"rows":[2601,2700],"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/26","next":"/task/clustering/papers/28","papers":[{"url":"/paper/rethinking-feature-discrimination-and","slug":"rethinking-feature-discrimination-and","title":"Rethinking Feature Discrimination and Polymerization for Large-scale Recognition","date":"2017-10-02","arxiv_id":"1710.00870","repositories_listed":1,"syntology":null},{"url":"/paper/deep-adaptive-image-clustering","slug":"deep-adaptive-image-clustering","title":"Deep Adaptive Image Clustering","date":"2017-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-nonlinear-orthogonal-non-negative-matrix","slug":"a-nonlinear-orthogonal-non-negative-matrix","title":"A Nonlinear Orthogonal Non-Negative Matrix Factorization Approach to Subspace Clustering","date":"2017-09-29","arxiv_id":"1709.10323","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-nonparametric-clustering","slug":"adaptive-nonparametric-clustering","title":"Adaptive Nonparametric Clustering","date":"2017-09-26","arxiv_id":"1709.09102","repositories_listed":1,"syntology":null},{"url":"/paper/class-splitting-generative-adversarial","slug":"class-splitting-generative-adversarial","title":"Class-Splitting Generative Adversarial Networks","date":"2017-09-21","arxiv_id":"1709.07359","repositories_listed":1,"syntology":null},{"url":"/paper/estimating-mutual-information-for-discrete","slug":"estimating-mutual-information-for-discrete","title":"Estimating Mutual Information for Discrete-Continuous Mixtures","date":"2017-09-19","arxiv_id":"1709.06212","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-positive-and-negative-links-with","slug":"predicting-positive-and-negative-links-with","title":"Predicting Positive and Negative Links with Noisy Queries: Theory & Practice","date":"2017-09-19","arxiv_id":"1709.07308","repositories_listed":1,"syntology":null},{"url":"/paper/autoencoder-driven-weather-clustering-for","slug":"autoencoder-driven-weather-clustering-for","title":"Autoencoder-Driven Weather Clustering for Source Estimation during Nuclear Events","date":"2017-09-18","arxiv_id":"1709.05840","repositories_listed":1,"syntology":null},{"url":"/paper/pqk-means-billion-scale-clustering-for","slug":"pqk-means-billion-scale-clustering-for","title":"PQk-means: Billion-scale Clustering for Product-quantized Codes","date":"2017-09-12","arxiv_id":"1709.03708","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-active-clustering-with-weak","slug":"semi-supervised-active-clustering-with-weak","title":"Semi-Supervised Active Clustering with Weak Oracles","date":"2017-09-11","arxiv_id":"1709.03202","repositories_listed":1,"syntology":null},{"url":"/paper/detection-and-localization-of-drosophila-egg","slug":"detection-and-localization-of-drosophila-egg","title":"Detection and Localization of Drosophila Egg Chambers in Microscopy Images.","date":"2017-09-07","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/inhomogeneous-hypergraph-clustering-with","slug":"inhomogeneous-hypergraph-clustering-with","title":"Inhomogeneous Hypergraph Clustering with Applications","date":"2017-09-05","arxiv_id":"1709.01249","repositories_listed":1,"syntology":null},{"url":"/paper/joint-maximum-purity-forest-with-application","slug":"joint-maximum-purity-forest-with-application","title":"Joint Maximum Purity Forest with Application to Image Super-Resolution","date":"2017-08-30","arxiv_id":"1708.09200","repositories_listed":1,"syntology":null},{"url":"/paper/cross-view-asymmetric-metric-learning-for","slug":"cross-view-asymmetric-metric-learning-for","title":"Cross-view Asymmetric Metric Learning for Unsupervised Person Re-identification","date":"2017-08-27","arxiv_id":"1708.08062","repositories_listed":1,"syntology":null},{"url":"/paper/integrate-multi-omic-data-using-affinity","slug":"integrate-multi-omic-data-using-affinity","title":"Integrate Multi-omic Data Using Affinity Network Fusion (ANF) for Cancer Patient Clustering","date":"2017-08-23","arxiv_id":"1708.07136","repositories_listed":1,"syntology":null},{"url":"/paper/data-driven-tree-transforms-and-metrics","slug":"data-driven-tree-transforms-and-metrics","title":"Data-Driven Tree Transforms and Metrics","date":"2017-08-18","arxiv_id":"1708.05768","repositories_listed":1,"syntology":null},{"url":"/paper/group-driven-reinforcement-learning-for","slug":"group-driven-reinforcement-learning-for","title":"Group-driven Reinforcement Learning for Personalized mHealth Intervention","date":"2017-08-14","arxiv_id":"1708.04001","repositories_listed":1,"syntology":null},{"url":"/paper/neural-expectation-maximization","slug":"neural-expectation-maximization","title":"Neural Expectation Maximization","date":"2017-08-11","arxiv_id":"1708.03498","repositories_listed":1,"syntology":null},{"url":"/paper/incremental-3d-line-segment-extraction-from","slug":"incremental-3d-line-segment-extraction-from","title":"Incremental 3D Line Segment Extraction from Semi-dense SLAM","date":"2017-08-10","arxiv_id":"1708.03275","repositories_listed":1,"syntology":null},{"url":"/paper/making-sense-of-word-embeddings","slug":"making-sense-of-word-embeddings","title":"Making Sense of Word Embeddings","date":"2017-08-10","arxiv_id":"1708.03390","repositories_listed":1,"syntology":null},{"url":"/paper/gaussian-prototypical-networks-for-few-shot","slug":"gaussian-prototypical-networks-for-few-shot","title":"Gaussian Prototypical Networks for Few-Shot Learning on Omniglot","date":"2017-08-09","arxiv_id":"1708.02735","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-spatially-aware-fashion-concept","slug":"automatic-spatially-aware-fashion-concept","title":"Automatic Spatially-aware Fashion Concept Discovery","date":"2017-08-03","arxiv_id":"1708.01311","repositories_listed":1,"syntology":null},{"url":"/paper/a-phoneme-clustering-algorithm-based-on-the","slug":"a-phoneme-clustering-algorithm-based-on-the","title":"A phoneme clustering algorithm based on the obligatory contour principle","date":"2017-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/metapath2vec-scalable-representation-learning","slug":"metapath2vec-scalable-representation-learning","title":"metapath2vec: Scalable Representation Learning for Heterogeneous Networks","date":"2017-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-multi-task-learning","slug":"a-survey-on-multi-task-learning","title":"A Survey on Multi-Task Learning","date":"2017-07-25","arxiv_id":"1707.08114","repositories_listed":1,"syntology":null},{"url":"/paper/structural-regularities-in-text-based-entity","slug":"structural-regularities-in-text-based-entity","title":"Structural Regularities in Text-based Entity Vector Spaces","date":"2017-07-25","arxiv_id":"1707.07930","repositories_listed":1,"syntology":null},{"url":"/paper/discovering-topics-in-text-datasets-by","slug":"discovering-topics-in-text-datasets-by","title":"Discovering topics in text datasets by visualizing relevant words","date":"2017-07-18","arxiv_id":"1707.06100","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-low-rank-kernel-subspace-clustering","slug":"adaptive-low-rank-kernel-subspace-clustering","title":"Adaptive Low-Rank Kernel Subspace Clustering","date":"2017-07-17","arxiv_id":"1707.04974","repositories_listed":1,"syntology":null},{"url":"/paper/merge-or-not-learning-to-group-faces-via","slug":"merge-or-not-learning-to-group-faces-via","title":"Merge or Not? Learning to Group Faces via Imitation Learning","date":"2017-07-13","arxiv_id":"1707.03986","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-mixture-model-for-clustering-of","slug":"efficient-mixture-model-for-clustering-of","title":"Efficient mixture model for clustering of sparse high dimensional binary data","date":"2017-07-11","arxiv_id":"1707.03157","repositories_listed":1,"syntology":null},{"url":"/paper/a-brief-survey-of-text-mining-classification","slug":"a-brief-survey-of-text-mining-classification","title":"A Brief Survey of Text Mining: Classification, Clustering and Extraction Techniques","date":"2017-07-10","arxiv_id":"1707.02919","repositories_listed":1,"syntology":null},{"url":"/paper/the-k-means-u-algorithm-non-local-jumps-and","slug":"the-k-means-u-algorithm-non-local-jumps-and","title":"The k-means-u* algorithm: non-local jumps and greedy retries improve k-means++ clustering","date":"2017-06-27","arxiv_id":"1706.09059","repositories_listed":1,"syntology":null},{"url":"/paper/consistent-feature-attribution-for-tree","slug":"consistent-feature-attribution-for-tree","title":"Consistent feature attribution for tree ensembles","date":"2017-06-19","arxiv_id":"1706.06060","repositories_listed":1,"syntology":null},{"url":"/paper/on-comparing-clusterings-an-element-centric","slug":"on-comparing-clusterings-an-element-centric","title":"Element-centric clustering comparison unifies overlaps and hierarchy","date":"2017-06-19","arxiv_id":"1706.06136","repositories_listed":1,"syntology":null},{"url":"/paper/human-like-clustering-with-deep-convolutional","slug":"human-like-clustering-with-deep-convolutional","title":"Human-like Clustering with Deep Convolutional Neural Networks","date":"2017-06-15","arxiv_id":"1706.05048","repositories_listed":1,"syntology":null},{"url":"/paper/multilevel-clustering-via-wasserstein-means","slug":"multilevel-clustering-via-wasserstein-means","title":"Multilevel Clustering via Wasserstein Means","date":"2017-06-13","arxiv_id":"1706.03883","repositories_listed":1,"syntology":null},{"url":"/paper/encoding-of-phonology-in-a-recurrent-neural","slug":"encoding-of-phonology-in-a-recurrent-neural","title":"Encoding of phonology in a recurrent neural model of grounded speech","date":"2017-06-12","arxiv_id":"1706.03815","repositories_listed":1,"syntology":null},{"url":"/paper/semantic-entity-retrieval-toolkit","slug":"semantic-entity-retrieval-toolkit","title":"Semantic Entity Retrieval Toolkit","date":"2017-06-12","arxiv_id":"1706.03757","repositories_listed":1,"syntology":null},{"url":"/paper/where-is-my-forearm-clustering-of-body-parts","slug":"where-is-my-forearm-clustering-of-body-parts","title":"Where is my forearm? Clustering of body parts from simultaneous tactile and linguistic input using sequential mapping","date":"2017-06-08","arxiv_id":"1706.02490","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-decentralized-visual-place","slug":"efficient-decentralized-visual-place","title":"Efficient Decentralized Visual Place Recognition From Full-Image Descriptors","date":"2017-05-30","arxiv_id":"1705.10739","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-person-re-identification","slug":"unsupervised-person-re-identification","title":"Unsupervised Person Re-identification: Clustering and Fine-tuning","date":"2017-05-30","arxiv_id":"1705.10444","repositories_listed":1,"syntology":null},{"url":"/paper/local-search-methods-for-fast-near-neighbor","slug":"local-search-methods-for-fast-near-neighbor","title":"A scalable solution to the nearest neighbor search problem through local-search methods on neighbor graphs","date":"2017-05-29","arxiv_id":"1705.10351","repositories_listed":1,"syntology":null},{"url":"/paper/effective-sampling-fast-segmentation-using","slug":"effective-sampling-fast-segmentation-using","title":"Effective Sampling: Fast Segmentation Using Robust Geometric Model Fitting","date":"2017-05-26","arxiv_id":"1705.09437","repositories_listed":1,"syntology":null},{"url":"/paper/monaural-audio-speaker-separation-with-source","slug":"monaural-audio-speaker-separation-with-source","title":"Monaural Audio Speaker Separation with Source Contrastive Estimation","date":"2017-05-12","arxiv_id":"1705.04662","repositories_listed":1,"syntology":null},{"url":"/paper/mining-functional-modules-by-multiview-nmf-of","slug":"mining-functional-modules-by-multiview-nmf-of","title":"Mining Functional Modules by Multiview-NMF of Phenome-Genome Association","date":"2017-05-11","arxiv_id":"1705.03998","repositories_listed":1,"syntology":null},{"url":"/paper/watset-automatic-induction-of-synsets-from-a","slug":"watset-automatic-induction-of-synsets-from-a","title":"Watset: Automatic Induction of Synsets from a Graph of Synonyms","date":"2017-04-24","arxiv_id":"1704.07157","repositories_listed":1,"syntology":null},{"url":"/paper/deep-clustering-via-joint-convolutional","slug":"deep-clustering-via-joint-convolutional","title":"Deep Clustering via Joint Convolutional Autoencoder Embedding and Relative Entropy Minimization","date":"2017-04-20","arxiv_id":"1704.06327","repositories_listed":1,"syntology":null},{"url":"/paper/collaborative-low-rank-subspace-clustering","slug":"collaborative-low-rank-subspace-clustering","title":"Collaborative Low-Rank Subspace Clustering","date":"2017-04-13","arxiv_id":"1704.03966","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-sparse-subspace-clustering-by","slug":"efficient-sparse-subspace-clustering-by","title":"Efficient Sparse Subspace Clustering by Nearest Neighbour Filtering","date":"2017-04-13","arxiv_id":"1704.03958","repositories_listed":1,"syntology":null},{"url":"/paper/tractable-clustering-of-data-on-the-curve","slug":"tractable-clustering-of-data-on-the-curve","title":"Tractable Clustering of Data on the Curve Manifold","date":"2017-04-13","arxiv_id":"1704.03963","repositories_listed":1,"syntology":null},{"url":"/paper/conformative-filtering-for-implicit-feedback","slug":"conformative-filtering-for-implicit-feedback","title":"Conformative Filtering for Implicit Feedback Data","date":"2017-04-06","arxiv_id":"1704.01889","repositories_listed":1,"syntology":null},{"url":"/paper/time-series-cluster-kernel-for-learning","slug":"time-series-cluster-kernel-for-learning","title":"Time Series Cluster Kernel for Learning Similarities between Multivariate Time Series with Missing Data","date":"2017-04-03","arxiv_id":"1704.00794","repositories_listed":1,"syntology":null},{"url":"/paper/algebraic-variety-models-for-high-rank-matrix","slug":"algebraic-variety-models-for-high-rank-matrix","title":"Algebraic Variety Models for High-Rank Matrix Completion","date":"2017-03-28","arxiv_id":"1703.09631","repositories_listed":1,"syntology":null},{"url":"/paper/pwls-ultra-an-efficient-clustering-and","slug":"pwls-ultra-an-efficient-clustering-and","title":"PWLS-ULTRA: An Efficient Clustering and Learning-Based Approach for Low-Dose 3D CT Image Reconstruction","date":"2017-03-27","arxiv_id":"1703.09165","repositories_listed":1,"syntology":null},{"url":"/paper/amat-medial-axis-transform-for-natural-images","slug":"amat-medial-axis-transform-for-natural-images","title":"AMAT: Medial Axis Transform for Natural Images","date":"2017-03-24","arxiv_id":"1703.08628","repositories_listed":1,"syntology":null},{"url":"/paper/simlr-a-tool-for-large-scale-genomic-analyses","slug":"simlr-a-tool-for-large-scale-genomic-analyses","title":"SIMLR: A Tool for Large-Scale Genomic Analyses by Multi-Kernel Learning","date":"2017-03-21","arxiv_id":"1703.07844","repositories_listed":1,"syntology":null},{"url":"/paper/character-based-neural-embeddings-for-tweet","slug":"character-based-neural-embeddings-for-tweet","title":"Character-based Neural Embeddings for Tweet Clustering","date":"2017-03-15","arxiv_id":"1703.05123","repositories_listed":1,"syntology":null},{"url":"/paper/graph-sketching-based-space-efficient-data","slug":"graph-sketching-based-space-efficient-data","title":"Graph sketching-based Space-efficient Data Clustering","date":"2017-03-07","arxiv_id":"1703.02375","repositories_listed":1,"syntology":null},{"url":"/paper/classification-and-clustering-for","slug":"classification-and-clustering-for","title":"Classification and clustering for observations of event time data using non-homogeneous Poisson process models","date":"2017-03-06","arxiv_id":"1703.02111","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-k-means-clustering-via-lightweight","slug":"scalable-k-means-clustering-via-lightweight","title":"Scalable k-Means Clustering via Lightweight Coresets","date":"2017-02-27","arxiv_id":"1702.08248","repositories_listed":1,"syntology":null},{"url":"/paper/stability-of-topic-modeling-via-matrix","slug":"stability-of-topic-modeling-via-matrix","title":"Stability of Topic Modeling via Matrix Factorization","date":"2017-02-23","arxiv_id":"1702.07186","repositories_listed":1,"syntology":null},{"url":"/paper/joint-discovery-of-object-states-and","slug":"joint-discovery-of-object-states-and","title":"Joint Discovery of Object States and Manipulation Actions","date":"2017-02-09","arxiv_id":"1702.02738","repositories_listed":1,"syntology":null},{"url":"/paper/a-multi-channel-approach-for-automatic","slug":"a-multi-channel-approach-for-automatic","title":"A multi-channel approach for automatic microseismic event association using RANSAC-based arrival time event clustering(RATEC)","date":"2017-02-07","arxiv_id":"1702.01856","repositories_listed":1,"syntology":null},{"url":"/paper/a-dirichlet-mixture-model-of-hawkes-processes","slug":"a-dirichlet-mixture-model-of-hawkes-processes","title":"A Dirichlet Mixture Model of Hawkes Processes for Event Sequence Clustering","date":"2017-01-31","arxiv_id":"1701.09177","repositories_listed":1,"syntology":null},{"url":"/paper/robust-multilingual-named-entity-recognition","slug":"robust-multilingual-named-entity-recognition","title":"Robust Multilingual Named Entity Recognition with Shallow Semi-Supervised Features","date":"2017-01-31","arxiv_id":"1701.09123","repositories_listed":1,"syntology":null},{"url":"/paper/supervised-deep-sparse-coding-networks","slug":"supervised-deep-sparse-coding-networks","title":"Supervised Deep Sparse Coding Networks","date":"2017-01-29","arxiv_id":"1701.08349","repositories_listed":1,"syntology":null},{"url":"/paper/when-slepian-meets-fiedler-putting-a-focus-on","slug":"when-slepian-meets-fiedler-putting-a-focus-on","title":"When Slepian Meets Fiedler: Putting a Focus on the Graph Spectrum","date":"2017-01-29","arxiv_id":"1701.08401","repositories_listed":1,"syntology":null},{"url":"/paper/the-impact-of-random-models-on-clustering","slug":"the-impact-of-random-models-on-clustering","title":"The Impact of Random Models on Clustering Similarity","date":"2017-01-23","arxiv_id":"1701.06508","repositories_listed":1,"syntology":null},{"url":"/paper/faster-k-means-cluster-estimation","slug":"faster-k-means-cluster-estimation","title":"Faster K-Means Cluster Estimation","date":"2017-01-17","arxiv_id":"1701.04600","repositories_listed":1,"syntology":null},{"url":"/paper/systematic-study-of-color-spaces-and","slug":"systematic-study-of-color-spaces-and","title":"Systematic study of color spaces and components for the segmentation of sky/cloud images","date":"2017-01-17","arxiv_id":"1701.04520","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-signed-networks-with-the-geometric","slug":"clustering-signed-networks-with-the-geometric","title":"Clustering Signed Networks with the Geometric Mean of Laplacians","date":"2017-01-03","arxiv_id":"1701.00757","repositories_listed":1,"syntology":null},{"url":"/paper/an-improved-density-peaks-method-for-data","slug":"an-improved-density-peaks-method-for-data","title":"An Improved Density Peaks Method for Data Clustering","date":"2017-01-02","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/self-taught-convolutional-neural-networks-for","slug":"self-taught-convolutional-neural-networks-for","title":"Self-Taught Convolutional Neural Networks for Short Text Clustering","date":"2017-01-01","arxiv_id":"1701.00185","repositories_listed":1,"syntology":null},{"url":"/paper/quantum-clustering-and-gaussian-mixtures","slug":"quantum-clustering-and-gaussian-mixtures","title":"Quantum Clustering and Gaussian Mixtures","date":"2016-12-29","arxiv_id":"1612.09199","repositories_listed":1,"syntology":null},{"url":"/paper/superpixel-segmentation-using-gaussian","slug":"superpixel-segmentation-using-gaussian","title":"Superpixel Segmentation Using Gaussian Mixture Model","date":"2016-12-28","arxiv_id":"1612.08792","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-with-confidence-finding-clusters","slug":"clustering-with-confidence-finding-clusters","title":"Clustering with Confidence: Finding Clusters with Statistical Guarantees","date":"2016-12-27","arxiv_id":"1612.08714","repositories_listed":1,"syntology":null},{"url":"/paper/rank-one-nmf-based-initialization-for-nmf-and","slug":"rank-one-nmf-based-initialization-for-nmf-and","title":"Rank-One NMF-Based Initialization for NMF and Relative Error Bounds under a Geometric Assumption","date":"2016-12-27","arxiv_id":"1612.08549","repositories_listed":1,"syntology":null},{"url":"/paper/border-peeling-clustering","slug":"border-peeling-clustering","title":"Border-Peeling Clustering","date":"2016-12-14","arxiv_id":"1612.04869","repositories_listed":1,"syntology":null},{"url":"/paper/copasul-manual-contour-based-parametric-and","slug":"copasul-manual-contour-based-parametric-and","title":"CoPaSul Manual - Contour-based parametric and superpositional intonation stylization","date":"2016-12-14","arxiv_id":"1612.04765","repositories_listed":1,"syntology":null},{"url":"/paper/deep-metric-learning-via-facility-location","slug":"deep-metric-learning-via-facility-location","title":"Deep Metric Learning via Facility Location","date":"2016-12-05","arxiv_id":"1612.01213","repositories_listed":1,"syntology":null},{"url":"/paper/fast-and-accurate-spike-sorting-of-high","slug":"fast-and-accurate-spike-sorting-of-high","title":"Fast and accurate spike sorting of high-channel count probes with KiloSort","date":"2016-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fast-and-provably-good-seedings-for-k-means","slug":"fast-and-provably-good-seedings-for-k-means","title":"Fast and Provably Good Seedings for k-Means","date":"2016-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/general-tensor-spectral-co-clustering-for","slug":"general-tensor-spectral-co-clustering-for","title":"General Tensor Spectral Co-clustering for Higher-Order Data","date":"2016-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/improved-deep-metric-learning-with-multi","slug":"improved-deep-metric-learning-with-multi","title":"Improved Deep Metric Learning with Multi-class N-pair Loss Objective","date":"2016-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-deep-parsimonious-representations","slug":"learning-deep-parsimonious-representations","title":"Learning Deep Parsimonious Representations","date":"2016-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/node-embedding-via-word-embedding-for-network","slug":"node-embedding-via-word-embedding-for-network","title":"Node Embedding via Word Embedding for Network Community Discovery","date":"2016-11-09","arxiv_id":"1611.03028","repositories_listed":1,"syntology":null},{"url":"/paper/divide-and-conquer-networks","slug":"divide-and-conquer-networks","title":"Divide and Conquer Networks","date":"2016-11-08","arxiv_id":"1611.02401","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-radio-signal-identification","slug":"semi-supervised-radio-signal-identification","title":"Semi-Supervised Radio Signal Identification","date":"2016-11-01","arxiv_id":"1611.00303","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-and-measuring-non-linear","slug":"exploring-and-measuring-non-linear","title":"Exploring and measuring non-linear correlations: Copulas, Lightspeed Transportation and Clustering","date":"2016-10-30","arxiv_id":"1610.09659","repositories_listed":1,"syntology":null},{"url":"/paper/a-clustering-tool-for-nucleotide-sequences","slug":"a-clustering-tool-for-nucleotide-sequences","title":"A clustering tool for nucleotide sequences using Laplacian Eigenmaps and Gaussian Mixture Models","date":"2016-10-26","arxiv_id":"1610.08227","repositories_listed":1,"syntology":null},{"url":"/paper/dis-s2v-discourse-informed-sen2vec","slug":"dis-s2v-discourse-informed-sen2vec","title":"Dis-S2V: Discourse Informed Sen2Vec","date":"2016-10-25","arxiv_id":"1610.08078","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-the-dynamics-of-online-learning","slug":"modeling-the-dynamics-of-online-learning","title":"Modeling the Dynamics of Online Learning Activity","date":"2016-10-18","arxiv_id":"1610.05775","repositories_listed":1,"syntology":null},{"url":"/paper/an-unsupervised-probability-model-for-speech","slug":"an-unsupervised-probability-model-for-speech","title":"An Unsupervised Probability Model for Speech-to-Translation Alignment of Low-Resource Languages","date":"2016-09-26","arxiv_id":"1609.08139","repositories_listed":1,"syntology":null},{"url":"/paper/amos-an-automated-model-order-selection","slug":"amos-an-automated-model-order-selection","title":"AMOS: An Automated Model Order Selection Algorithm for Spectral Graph Clustering","date":"2016-09-21","arxiv_id":"1609.06457","repositories_listed":1,"syntology":null},{"url":"/paper/recursive-nearest-agglomeration-rena-fast","slug":"recursive-nearest-agglomeration-rena-fast","title":"Recursive nearest agglomeration (ReNA): fast clustering for approximation of structured signals","date":"2016-09-15","arxiv_id":"1609.04608","repositories_listed":1,"syntology":null},{"url":"/paper/a-greedy-algorithm-to-cluster-specialists","slug":"a-greedy-algorithm-to-cluster-specialists","title":"A Greedy Algorithm to Cluster Specialists","date":"2016-09-13","arxiv_id":"1609.03666","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-data-analysis-with","slug":"probabilistic-data-analysis-with","title":"Probabilistic Data Analysis with Probabilistic Programming","date":"2016-08-18","arxiv_id":"1608.05347","repositories_listed":1,"syntology":null},{"url":"/paper/authorship-clustering-using-multi-headed","slug":"authorship-clustering-using-multi-headed","title":"Authorship clustering using multi-headed recurrent neural networks","date":"2016-08-16","arxiv_id":"1608.04485","repositories_listed":1,"syntology":null},{"url":"/paper/sampling-requirements-and-accelerated-schemes","slug":"sampling-requirements-and-accelerated-schemes","title":"Sampling Requirements and Accelerated Schemes for Sparse Linear Regression with Orthogonal Least-Squares","date":"2016-08-08","arxiv_id":"1608.02549","repositories_listed":1,"syntology":null},{"url":"/paper/improving-quality-of-hierarchical-clustering","slug":"improving-quality-of-hierarchical-clustering","title":"Improving Quality of Hierarchical Clustering for Large Data Series","date":"2016-08-03","arxiv_id":"1608.01238","repositories_listed":1,"syntology":null}],"record_sha256":"684d2a71d5bebe0aadf6bf40c91eeb776b498cdb46758306e1bd31004698cb83","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}