{"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/107","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":107,"pages_in_order":108,"rows_per_page":100,"rows":[10601,10700],"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/106","next":"/task/clustering/papers/108","papers":[{"url":null,"slug":"constructing-the-l2-graph-for-robust-subspace","title":"Constructing the L2-Graph for Robust Subspace Learning and Subspace Clustering","date":"2012-09-05","arxiv_id":"1209.0841","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-segmentation-of-fluorescence","title":"Automatic Segmentation of Fluorescence Lifetime Microscopy Images of Cells Using Multi-Resolution Community Detection","date":"2012-08-23","arxiv_id":"1208.4662","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-graph-via-multiple-kernel-learning","title":"Adaptive Graph via Multiple Kernel Learning for Nonnegative Matrix Factorization","date":"2012-08-19","arxiv_id":"1208.3845","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-data-collection-for-informative","title":"Optimal Data Collection For Informative Rankings Expose Well-Connected Graphs","date":"2012-07-26","arxiv_id":"1207.6430","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-price-of-privacy-in-untrusted","title":"The Price of Privacy in Untrusted Recommendation Engines","date":"2012-07-13","arxiv_id":"1207.3269","repositories_listed":0,"syntology":null},{"url":null,"slug":"pseudo-likelihood-methods-for-community","title":"Pseudo-likelihood methods for community detection in large sparse networks","date":"2012-07-10","arxiv_id":"1207.2340","repositories_listed":0,"syntology":null},{"url":null,"slug":"anatomical-structure-segmentation-in-liver","title":"Anatomical Structure Segmentation in Liver MRI Images","date":"2012-07-03","arxiv_id":"1207.0805","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-parametric-estimation-method-for-graph","title":"A New Parametric Estimation Method for Graph-based Clustering","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-clustering-for-coreference","title":"Adaptive Clustering for Coreference Resolution with Deterministic Rules and Web-Based Language Models","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"aligning-predicates-across-monolingual","title":"Aligning Predicates across Monolingual Comparable Texts using Graph-based Clustering","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sentence-clustering-via-projection-over-term","title":"Sentence Clustering via Projection over Term Clusters","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"church-a-language-for-generative-models","title":"Church: a language for generative models","date":"2012-06-13","arxiv_id":"1206.3255","repositories_listed":0,"syntology":null},{"url":null,"slug":"image-similarity-using-sparse-representation","title":"Image Similarity Using Sparse Representation and Compression Distance","date":"2012-06-12","arxiv_id":"1206.2627","repositories_listed":0,"syntology":null},{"url":null,"slug":"entity-clustering-across-languages","title":"Entity Clustering Across Languages","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-clustering-of-word-class","title":"Hierarchical clustering of word class distributions","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"informing-determiner-and-preposition-error","title":"Informing Determiner and Preposition Error Correction with Hierarchical Word Clustering","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"nouvelle-approche-pour-le-regroupement-des","title":"Nouvelle approche pour le regroupement des locuteurs dans des \\'emissions radiophoniques et t\\'el\\'evisuelles (New approach for speaker clustering of broadcast news) [in French]","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"summarization-of-historical-articles-using","title":"Summarization of Historical Articles Using Temporal Event Clustering","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-translation-sense-clustering","title":"Unsupervised Translation Sense Clustering","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"asymptotic-accuracy-of-bayes-estimation-for","title":"Asymptotic Accuracy of Bayes Estimation for Latent Variables with Redundancy","date":"2012-05-15","arxiv_id":"1205.3234","repositories_listed":0,"syntology":null},{"url":null,"slug":"building-text-to-speech-systems-for-resource","title":"Building Text-to-Speech Systems for Resource Poor Languages","date":"2012-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cltc-a-chinese-english-cross-lingual-topic","title":"CLTC: A Chinese-English Cross-lingual Topic Corpus","date":"2012-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"effects-of-document-clustering-in-modeling","title":"Effects of Document Clustering in Modeling Wikipedia-style Term Descriptions","date":"2012-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-expressive-speech-synthesis-from","title":"Evaluating expressive speech synthesis from audiobook corpora for conversational phrases","date":"2012-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluation-of-a-complex-information","title":"Evaluation of a Complex Information Extraction Application in Specific Domain","date":"2012-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluation-of-unsupervised-information","title":"Evaluation of Unsupervised Information Extraction","date":"2012-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"gerned-a-german-corpus-for-named-entity","title":"GerNED: A German Corpus for Named Entity Disambiguation","date":"2012-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"linguagrid-a-network-of-linguistic-and","title":"Linguagrid: a network of Linguistic and Semantic Services for the Italian Language.","date":"2012-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"using-an-asr-database-to-design-a","title":"Using an ASR database to design a pronunciation evaluation system in Basque","date":"2012-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"co-clustering-for-directed-graphs-the","title":"Co-clustering for directed graphs: the Stochastic co-Blockmodel and spectral algorithm Di-Sim","date":"2012-04-10","arxiv_id":"1204.2296","repositories_listed":0,"syntology":null},{"url":null,"slug":"discourse-type-clustering-using-pos-n-gram","title":"Discourse Type Clustering using POS n-gram Profiles and High-Dimensional Embeddings","date":"2012-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-methods-for-in-domain-and","title":"Generalization Methods for In-Domain and Cross-Domain Opinion Holder Extraction","date":"2012-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-hierarchical-clustering-of","title":"Probabilistic Hierarchical Clustering of Morphological Paradigms","date":"2012-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-induction-of-parts-of-speech-in-child","title":"Robust Induction of Parts-of-Speech in Child-Directed Language by Co-Clustering of Words and Contexts","date":"2012-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"guaranteed-clustering-and-biclustering-via","title":"Guaranteed clustering and biclustering via semidefinite programming","date":"2012-02-16","arxiv_id":"1202.3663","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-efficient-high-quality-hierarchical","title":"An efficient high-quality hierarchical clustering algorithm for automatic inference of software architecture from the source code of a software system","date":"2012-02-15","arxiv_id":"1202.3335","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-under-perturbation-resilience","title":"Clustering under Perturbation Resilience","date":"2011-12-05","arxiv_id":"1112.0826","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-blind-sparse-deconvolution-method-for","title":"A blind sparse deconvolution method for neural spike identification","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-spectral-clustering-tight-relaxations","title":"Beyond Spectral Clustering - Tight Relaxations of Balanced Graph Cuts","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-via-dirichlet-process-mixture","title":"Clustering via Dirichlet Process Mixture Models for Portable Skill Discovery","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"co-regularized-multi-view-spectral-clustering","title":"Co-regularized Multi-view Spectral Clustering","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"crowdclustering","title":"Crowdclustering","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"higher-order-correlation-clustering-for-image","title":"Higher-Order Correlation Clustering for Image Segmentation","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"image-parsing-with-stochastic-scene-grammar","title":"Image Parsing with Stochastic Scene Grammar","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"inferring-interaction-networks-using-the-ibp","title":"Inferring Interaction Networks using the IBP applied to microRNA Target Prediction","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-agglomerate-superpixel","title":"Learning to Agglomerate Superpixel Hierarchies","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"minimax-localization-of-structural","title":"Minimax Localization of Structural Information in Large Noisy Matrices","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"noise-thresholds-for-spectral-clustering","title":"Noise Thresholds for Spectral Clustering","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-u-processes-and-clustering-performance","title":"On U-processes and clustering performance","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"shaping-level-sets-with-submodular-functions","title":"Shaping Level Sets with Submodular Functions","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-manifold-clustering-and-embedding","title":"Sparse Manifold Clustering and Embedding","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-with-submodular-functions-a-convex","title":"Learning with Submodular Functions: A Convex Optimization Perspective","date":"2011-11-28","arxiv_id":"1111.6453","repositories_listed":0,"syntology":null},{"url":null,"slug":"combinatorial-clustering-and-the-beta","title":"Combinatorial clustering and the beta negative binomial process","date":"2011-11-08","arxiv_id":"1111.1802","repositories_listed":0,"syntology":null},{"url":null,"slug":"randomized-dimensionality-reduction-for-k","title":"Randomized Dimensionality Reduction for k-means Clustering","date":"2011-10-13","arxiv_id":"1110.2897","repositories_listed":0,"syntology":null},{"url":null,"slug":"deterministic-feature-selection-for-k-means","title":"Deterministic Feature Selection for $k$-means Clustering","date":"2011-09-26","arxiv_id":"1109.5664","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-of-latent-mixing-measures-in","title":"Convergence of latent mixing measures in finite and infinite mixture models","date":"2011-09-15","arxiv_id":"1109.3250","repositories_listed":0,"syntology":null},{"url":null,"slug":"weighted-clustering","title":"Weighted Clustering","date":"2011-09-08","arxiv_id":"1109.1844","repositories_listed":0,"syntology":null},{"url":null,"slug":"complex-valued-autoencoders","title":"Complex-Valued Autoencoders","date":"2011-08-20","arxiv_id":"1108.4135","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-stability-in-clustering-a-closer-look","title":"Data Stability in Clustering: A Closer Look","date":"2011-07-12","arxiv_id":"1107.2379","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-framework-for-approximating-and","title":"A Unified Framework for Approximating and Clustering Data","date":"2011-06-07","arxiv_id":"1106.1379","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-partially-observed-graphs-via","title":"Clustering Partially Observed Graphs via Convex Optimization","date":"2011-04-25","arxiv_id":"1104.4803","repositories_listed":0,"syntology":null},{"url":null,"slug":"cluster-forests","title":"Cluster Forests","date":"2011-04-14","arxiv_id":"1104.2930","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-statistical-nonparametric-approach-of-face","title":"A Statistical Nonparametric Approach of Face Recognition: Combination of Eigenface & Modified k-Means Clustering","date":"2011-04-07","arxiv_id":"1104.01237","repositories_listed":0,"syntology":null},{"url":null,"slug":"analysis-of-agglomerative-clustering","title":"Analysis of Agglomerative Clustering","date":"2010-12-16","arxiv_id":"1012.3697","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-species-sampling-priors-with","title":"Generalized Species Sampling Priors with Latent Beta reinforcements","date":"2010-12-04","arxiv_id":"1012.0866","repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminative-clustering-by-regularized","title":"Discriminative Clustering by Regularized Information Maximization","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-optimization-for-discriminative","title":"Efficient Optimization for Discriminative Latent Class Models","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-patients-at-risk-of-major-adverse","title":"Identifying Patients at Risk of Major Adverse Cardiovascular Events Using Symbolic Mismatch","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"minimum-average-cost-clustering","title":"Minimum Average Cost Clustering","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"practical-large-scale-optimization-for-max","title":"Practical Large-Scale Optimization for Max-norm Regularization","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"random-projections-for-k-means-clustering","title":"Random Projections for k-means Clustering","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-clustering-as-ensembles-of-affinity","title":"Robust Clustering as Ensembles of Affinity Relations","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sphere-embedding-an-application-to-part-of","title":"Sphere Embedding: An Application to Part-of-Speech Induction","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"structural-epitome-a-way-to-summarize-ones","title":"Structural epitome: a way to summarize one’s visual experience","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"supervised-clustering","title":"Supervised Clustering","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-property-based-classification-of","title":"Towards Property-Based Classification of Clustering Paradigms","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"tree-structured-stick-breaking-for","title":"Tree-Structured Stick Breaking for Hierarchical Data","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-kernel-dimension-reduction","title":"Unsupervised Kernel Dimension Reduction","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"classifying-clustering-schemes","title":"Classifying Clustering Schemes","date":"2010-11-24","arxiv_id":"1011.5270","repositories_listed":0,"syntology":null},{"url":null,"slug":"t-drive-driving-directions-based-on-taxi","title":"T-Drive: Driving Directions Based on Taxi Trajectories","date":"2010-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-processes","title":"Clustering processes","date":"2010-05-05","arxiv_id":"1005.0826","repositories_listed":0,"syntology":null},{"url":"/paper/complete-gradient-clustering-algorithm-for","slug":"complete-gradient-clustering-algorithm-for","title":"Complete gradient clustering algorithm for features analysis of x-ray images","date":"2010-04-30","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-approach-to-content-based-file-type","title":"A new approach to content-based file type detection","date":"2010-02-17","arxiv_id":"1002.3174","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-bayesian-model-for-simultaneous-image","title":"A Bayesian Model for Simultaneous Image Clustering, Annotation and Object Segmentation","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-game-theoretic-approach-to-hypergraph","title":"A Game-Theoretic Approach to Hypergraph Clustering","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-nonparametric-models-on-decomposable","title":"Bayesian Nonparametric Models on Decomposable Graphs","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-sequence-sets-for-motif-discovery","title":"Clustering sequence sets for motif discovery","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-graph-laplacian-regularized-kernel","title":"Fast Graph Laplacian Regularized Kernel Learning via Semidefinite–Quadratic–Linear Programming","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"filtering-abstract-senses-from-image-search","title":"Filtering Abstract Senses From Image Search Results","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-consensus-maximization-among","title":"Graph-based Consensus Maximization among Multiple Supervised and Unsupervised Models","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-bregman-distance-functions-and-its","title":"Learning Bregman Distance Functions and Its Application for Semi-Supervised Clustering","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"modelling-relational-data-using-bayesian","title":"Modelling Relational Data using Bayesian Clustered Tensor Factorization","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-bayesian-models-for","title":"Nonparametric Bayesian Models for Unsupervised Event Coreference Resolution","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-scoring-for-unsupervised-learning","title":"Optimal Scoring for Unsupervised Learning","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"speaker-comparison-with-inner-product","title":"Speaker Comparison with Inner Product Discriminant Functions","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"streaming-k-means-approximation","title":"Streaming k-means approximation","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-ordered-residual-kernel-for-robust-motion","title":"The Ordered Residual Kernel for Robust Motion Subspace Clustering","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-feature-selection-for-the-k","title":"Unsupervised Feature Selection for the k-means Clustering Problem","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"discovering-volatile-events-in-your","title":"Discovering Volatile Events in Your Neighborhood: Local-Area Topic Extraction from Blog Entries","date":"2009-10-21","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-template-matching-with-shift","title":"Adaptive Template Matching with Shift-Invariant Semi-NMF","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"88a8efaab5908af86cd780d97a503f4b65d5fea46e2fd5000d6bddcdf136b94b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}