{"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/106","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":106,"pages_in_order":108,"rows_per_page":100,"rows":[10501,10600],"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/105","next":"/task/clustering/papers/107","papers":[{"url":null,"slug":"revealing-social-networks-of-spammers-through","title":"Revealing social networks of spammers through spectral clustering","date":"2013-04-30","arxiv_id":"1305.0051","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-information-maximization","title":"Semi-Supervised Information-Maximization Clustering","date":"2013-04-30","arxiv_id":"1304.8020","repositories_listed":0,"syntology":null},{"url":null,"slug":"deterministic-initialization-of-the-k-means","title":"Deterministic Initialization of the K-Means Algorithm Using Hierarchical Clustering","date":"2013-04-28","arxiv_id":"1304.7465","repositories_listed":0,"syntology":null},{"url":null,"slug":"measuring-cultural-relativity-of-emotional","title":"Measuring Cultural Relativity of Emotional Valence and Arousal using Semantic Clustering and Twitter","date":"2013-04-28","arxiv_id":"1304.7507","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-eigenvectors-for-large-scale","title":"Semi-supervised Eigenvectors for Large-scale Locally-biased Learning","date":"2013-04-28","arxiv_id":"1304.7528","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-implementation-of-the-relational-k-means","title":"An implementation of the relational k-means algorithm","date":"2013-04-25","arxiv_id":"1304.6899","repositories_listed":0,"syntology":null},{"url":null,"slug":"locally-linear-representation-for-image","title":"Locally linear representation for image clustering","date":"2013-04-24","arxiv_id":"1304.6487","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-k-modes-algorithm-for-clustering","title":"The K-modes algorithm for clustering","date":"2013-04-24","arxiv_id":"1304.6478","repositories_listed":0,"syntology":null},{"url":null,"slug":"commonsense-reasoning-and-large-network","title":"Commonsense Reasoning and Large Network Analysis: A Computational Study of ConceptNet 4","date":"2013-04-22","arxiv_id":"1304.5863","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-low-rank-subspace-segmentation","title":"Distributed Low-rank Subspace Segmentation","date":"2013-04-20","arxiv_id":"1304.5583","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-homogeneity-inter-clusters-measure-in","title":"A New Homogeneity Inter-Clusters Measure in SemiSupervised Clustering","date":"2013-04-13","arxiv_id":"1304.3840","repositories_listed":0,"syntology":null},{"url":null,"slug":"identification-of-relevant-subtypes-via","title":"Identification of relevant subtypes via preweighted sparse clustering","date":"2013-04-13","arxiv_id":"1304.3760","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-cancer-subtypes-in-glioblastoma","title":"Identifying cancer subtypes in glioblastoma by combining genomic, transcriptomic and epigenomic data","date":"2013-04-12","arxiv_id":"1304.3577","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-more-accurate-clustering-method-by","title":"Towards more accurate clustering method by using dynamic time warping","date":"2013-04-12","arxiv_id":"1304.3745","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-approach-to-two-view-motion","title":"A New Approach To Two-View Motion Segmentation Using Global Dimension Minimization","date":"2013-04-10","arxiv_id":"1304.2999","repositories_listed":0,"syntology":null},{"url":null,"slug":"entropy-landscape-of-solutions-in-the-binary","title":"Entropy landscape of solutions in the binary perceptron problem","date":"2013-04-10","arxiv_id":"1304.2850","repositories_listed":0,"syntology":null},{"url":null,"slug":"phase-transition-and-network-structure-in","title":"Phase Transition and Network Structure in Realistic SAT Problems","date":"2013-03-30","arxiv_id":"1304.0145","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-symmetrical-kullback-leibler-jeffreys","title":"On the symmetrical Kullback-Leibler Jeffreys centroids","date":"2013-03-29","arxiv_id":"1303.7286","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-comparative-analysis-on-the-applicability","title":"A Comparative Analysis on the Applicability of Entropy in remote sensing","date":"2013-03-27","arxiv_id":"1303.6926","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-clustering-and-polymorphy","title":"Machine Learning, Clustering, and Polymorphy","date":"2013-03-27","arxiv_id":"1304.3432","repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-evaluation-of-candidates-and","title":"Probabilistic Evaluation of Candidates and Symptom Clustering for Multidisorder Diagnosis","date":"2013-03-27","arxiv_id":"1304.1136","repositories_listed":0,"syntology":null},{"url":null,"slug":"video-face-matching-using-subset-selection","title":"Video Face Matching using Subset Selection and Clustering of Probabilistic Multi-Region Histograms","date":"2013-03-26","arxiv_id":"1303.6361","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalizing-k-means-for-an-arbitrary","title":"Generalizing k-means for an arbitrary distance matrix","date":"2013-03-24","arxiv_id":"1303.6001","repositories_listed":0,"syntology":null},{"url":null,"slug":"greedy-feature-selection-for-subspace","title":"Greedy Feature Selection for Subspace Clustering","date":"2013-03-19","arxiv_id":"1303.4778","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-quorum-sensing-inspired-algorithm-for","title":"A Quorum Sensing Inspired Algorithm for Dynamic Clustering","date":"2013-03-16","arxiv_id":"1303.3934","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-dependent-partition-valued-process-for","title":"A dependent partition-valued process for multitask clustering and time evolving network modelling","date":"2013-03-13","arxiv_id":"1303.3265","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-clustering-with-epidemic-diffusion","title":"Spectral Clustering with Epidemic Diffusion","date":"2013-03-11","arxiv_id":"1303.2663","repositories_listed":0,"syntology":null},{"url":null,"slug":"convex-discriminative-multitask-clustering","title":"Convex Discriminative Multitask Clustering","date":"2013-03-08","arxiv_id":"1303.2130","repositories_listed":0,"syntology":null},{"url":null,"slug":"heuristic-ternary-error-correcting-output","title":"Heuristic Ternary Error-Correcting Output Codes Via Weight Optimization and Layered Clustering-Based Approach","date":"2013-03-08","arxiv_id":"1303.2132","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hybrid-approach-to-extract-keyphrases-from","title":"A Hybrid Approach to Extract Keyphrases from Medical Documents","date":"2013-03-06","arxiv_id":"1303.1441","repositories_listed":0,"syntology":null},{"url":null,"slug":"convex-and-scalable-weakly-labeled-svms","title":"Convex and Scalable Weakly Labeled SVMs","date":"2013-03-06","arxiv_id":"1303.1271","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-stable-multilevel-dictionaries-for","title":"Learning Stable Multilevel Dictionaries for Sparse Representations","date":"2013-03-03","arxiv_id":"1303.0448","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiple-kernel-sparse-representations-for","title":"Multiple Kernel Sparse Representations for Supervised and Unsupervised Learning","date":"2013-03-03","arxiv_id":"1303.0582","repositories_listed":0,"syntology":null},{"url":null,"slug":"domain-adaptable-semantic-clustering-in","title":"Domain Adaptable Semantic Clustering in Statistical NLG","date":"2013-03-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-conformal-prediction-approach-to-explore","title":"A Conformal Prediction Approach to Explore Functional Data","date":"2013-02-26","arxiv_id":"1302.6452","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-bio-inspired-method-for-remote-sensing","title":"A new bio-inspired method for remote sensing imagery classification","date":"2013-02-11","arxiv_id":"1302.2606","repositories_listed":0,"syntology":null},{"url":null,"slug":"axiomatic-construction-of-hierarchical","title":"Axiomatic Construction of Hierarchical Clustering in Asymmetric Networks","date":"2013-01-31","arxiv_id":"1301.7724","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-experimental-comparison-of-several","title":"An Experimental Comparison of Several Clustering and Initialization Methods","date":"2013-01-30","arxiv_id":"1301.7401","repositories_listed":0,"syntology":null},{"url":null,"slug":"empirical-analysis-of-predictive-algorithms","title":"Empirical Analysis of Predictive Algorithms for Collaborative Filtering","date":"2013-01-30","arxiv_id":"1301.7363","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-based-matrix-factorization","title":"Clustering-Based Matrix Factorization","date":"2013-01-28","arxiv_id":"1301.6659","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-learning-from-sparse-data","title":"Fast Learning from Sparse Data","date":"2013-01-23","arxiv_id":"1301.6685","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-subspace-clustering","title":"Robust subspace clustering","date":"2013-01-11","arxiv_id":"1301.2603","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-text-detection-in-natural-scene-images","title":"Robust Text Detection in Natural Scene Images","date":"2013-01-11","arxiv_id":"1301.2628","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-eigen-updating-for-spectral-graph","title":"Efficient Eigen-updating for Spectral Graph Clustering","date":"2013-01-07","arxiv_id":"1301.1318","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-and-diversifying-web-search","title":"Clustering and Diversifying Web Search Results with Graph-Based Word Sense Induction","date":"2013-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"combined-distributional-and-logical-semantics","title":"Combined Distributional and Logical Semantics","date":"2013-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"powergrading-a-clustering-approach-to-amplify","title":"Powergrading: a Clustering Approach to Amplify Human Effort for Short Answer Grading","date":"2013-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"mixture-model-averaging-for-clustering","title":"Mixture Model Averaging for Clustering","date":"2012-12-23","arxiv_id":"1212.5760","repositories_listed":0,"syntology":null},{"url":null,"slug":"topic-extraction-and-bundling-of-related","title":"Topic Extraction and Bundling of Related Scientific Articles","date":"2012-12-21","arxiv_id":"1212.5423","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-multi-view-embedding-space-for-modeling","title":"A Multi-View Embedding Space for Modeling Internet Images, Tags, and their Semantics","date":"2012-12-18","arxiv_id":"1212.4522","repositories_listed":0,"syntology":null},{"url":null,"slug":"co-clustering-separately-exchangeable-network","title":"Co-clustering separately exchangeable network data","date":"2012-12-17","arxiv_id":"1212.4093","repositories_listed":0,"syntology":null},{"url":null,"slug":"group-component-analysis-for-multiblock-data","title":"Group Component Analysis for Multiblock Data: Common and Individual Feature Extraction","date":"2012-12-17","arxiv_id":"1212.3913","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-in-proof-general-interfacing","title":"Machine Learning in Proof General: Interfacing Interfaces","date":"2012-12-14","arxiv_id":"1212.3618","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-metaphor-hierarchies-in-a-corpus","title":"Identifying Metaphor Hierarchies in a Corpus Analysis of Finance Articles","date":"2012-12-13","arxiv_id":"1212.3138","repositories_listed":0,"syntology":null},{"url":null,"slug":"developments-in-the-theory-of-randomized","title":"Developments in the theory of randomized shortest paths with a comparison of graph node distances","date":"2012-12-07","arxiv_id":"1212.1666","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-divide-and-conquer-method-for-sparse","title":"A Divide-and-Conquer Method for Sparse Inverse Covariance Estimation","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-linear-time-active-learning-algorithm-for","title":"A Linear Time Active Learning Algorithm for Link Classification","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-nonparametric-variable-clustering-model","title":"A nonparametric variable clustering model","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-spectral-algorithm-for-latent-dirichlet","title":"A Spectral Algorithm for Latent Dirichlet Allocation","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"chinese-name-disambiguation-based-on-adaptive","title":"Chinese Name Disambiguation Based on Adaptive Clustering with the Attribute Features","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-aggregation-as-maximum-weight","title":"Clustering Aggregation as Maximum-Weight Independent Set","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-by-nonnegative-matrix","title":"Clustering by Nonnegative Matrix Factorization Using Graph Random Walk","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-sparse-graphs","title":"Clustering Sparse Graphs","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"combining-wordnet-and-morphosyntactic","title":"Combining Wordnet and Morphosyntactic Information in Terminology Clustering","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-and-energy-landscape-for-cheeger","title":"Convergence and Energy Landscape for Cheeger Cut Clustering","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"coreference-clustering-using-column","title":"Coreference Clustering using Column Generation","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dip-means-an-incremental-clustering-method","title":"Dip-means: an incremental clustering method for estimating the number of clusters","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"domain-based-punjabi-text-document-clustering","title":"Domain Based Punjabi Text Document Clustering","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"emergence-of-object-selective-features-in","title":"Emergence of Object-Selective Features in Unsupervised Feature Learning","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"experiments-with-clustering-based-features","title":"Experiments with Clustering-based Features for Sentence Classification in Medical Publications: Macquarie Test's participation in the ALTA 2012 shared task.","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-discourse-relations-between","title":"Exploiting Discourse Relations between Sentences for Text Clustering","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fastex-hash-clustering-with-exponential","title":"FastEx: Hash Clustering with Exponential Families","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-clustering-for-accelerating-parallel","title":"Feature Clustering for Accelerating Parallel Coordinate Descent","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"forging-the-graphs-a-low-rank-and-positive","title":"Forging The Graphs: A Low Rank and Positive Semidefinite Graph Learning Approach","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fusion-with-diffusion-for-robust-visual","title":"Fusion with Diffusion for Robust Visual Tracking","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"identification-of-recurrent-patterns-in-the","title":"Identification of Recurrent Patterns in the Activation of Brain Networks","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"jointly-disambiguating-and-clustering","title":"Jointly Disambiguating and Clustering Concepts and Entities with Markov Logic","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"latent-community-discovery-with-network","title":"Latent Community Discovery with Network Regularization for Core Actors Clustering","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-the-architecture-of-sum-product","title":"Learning the Architecture of Sum-Product Networks Using Clustering on Variables","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-discover-social-circles-in-ego","title":"Learning to Discover Social Circles in Ego Networks","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"minimizing-sparse-high-order-energies-by","title":"Minimizing Sparse High-Order Energies by Submodular Vertex-Cover","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-low-rank-subspace-clustering","title":"Probabilistic Low-Rank Subspace Clustering","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"recovery-of-sparse-probability-measures-via","title":"Recovery of Sparse Probability Measures via Convex Programming","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-crowdsourced-clustering-generalizing","title":"Semi-Crowdsourced Clustering: Generalizing Crowd Labeling by Robust Distance Metric Learning","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"small-variance-asymptotics-for-exponential","title":"Small-Variance Asymptotics for Exponential Family Dirichlet Process Mixture Models","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-time-marginalized-coalescent-prior-for","title":"The Time-Marginalized Coalescent Prior for Hierarchical Clustering","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-variational-hierarchical-em-algorithm-for","title":"The variational hierarchical EM algorithm for clustering hidden Markov models","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-feature-rich-clustering","title":"Unsupervised Feature-Rich Clustering","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"using-collocations-and-k-means-clustering-to","title":"Using Collocations and K-means Clustering to Improve the N-pos Model for Japanese IME","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"using-qualia-information-to-identify-lexical","title":"Using Qualia Information to Identify Lexical Semantic Classes in an Unsupervised Clustering Task","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"orientation-determination-from-cryo-em-images","title":"Orientation Determination from Cryo-EM images Using Least Unsquared Deviation","date":"2012-11-29","arxiv_id":"1211.7045","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hash-based-approach-for-secure-keyless","title":"A Hash based Approach for Secure Keyless Steganography in Lossless RGB Images","date":"2012-11-23","arxiv_id":"1211.5614","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-nonparametric-plackett-luce-models","title":"Bayesian nonparametric Plackett-Luce models for the analysis of preferences for college degree programmes","date":"2012-11-21","arxiv_id":"1211.5037","repositories_listed":0,"syntology":null},{"url":null,"slug":"mixed-licors-a-nonparametric-algorithm-for","title":"Mixed LICORS: A Nonparametric Algorithm for Predictive State Reconstruction","date":"2012-11-15","arxiv_id":"1211.3760","repositories_listed":0,"syntology":null},{"url":null,"slug":"measures-of-entropy-from-data-using","title":"Measures of Entropy from Data Using Infinitely Divisible Kernels","date":"2012-11-11","arxiv_id":"1211.2459","repositories_listed":0,"syntology":null},{"url":null,"slug":"k-plane-regression","title":"K-Plane Regression","date":"2012-11-07","arxiv_id":"1211.1513","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-density-sensitive-hierarchical-clustering","title":"A density-sensitive hierarchical clustering method","date":"2012-10-23","arxiv_id":"1210.6292","repositories_listed":0,"syntology":null},{"url":null,"slug":"reducing-statistical-time-series-problems-to","title":"Reducing statistical time-series problems to binary classification","date":"2012-10-22","arxiv_id":"1210.6001","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-graph-clustering","title":"Improved Graph Clustering","date":"2012-10-11","arxiv_id":"1210.3335","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-unsupervised-classification","title":"Nonparametric Unsupervised Classification","date":"2012-10-02","arxiv_id":"1210.0645","repositories_listed":0,"syntology":null}],"record_sha256":"9ad2a2f8a3461d446713811e38e9b966e35833efdad9ffd8ddb3974755de03f5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}