{"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/105","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":105,"pages_in_order":108,"rows_per_page":100,"rows":[10401,10500],"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/104","next":"/task/clustering/papers/106","papers":[{"url":null,"slug":"multigraph-clustering-for-unsupervised","title":"Multigraph Clustering for Unsupervised Coreference Resolution","date":"2013-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"post-retrieval-clustering-using-third-order","title":"Post-Retrieval Clustering Using Third-Order Similarity Measures","date":"2013-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"tracking-extrema-in-dynamic-environment-using","title":"Tracking Extrema in Dynamic Environment using Multi-Swarm Cellular PSO with Local Search","date":"2013-07-31","arxiv_id":"1307.8279","repositories_listed":0,"syntology":null},{"url":null,"slug":"who-and-where-people-and-location-co","title":"Who and Where: People and Location Co-Clustering","date":"2013-07-31","arxiv_id":"1307.8405","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimistic-concurrency-control-for","title":"Optimistic Concurrency Control for Distributed Unsupervised Learning","date":"2013-07-30","arxiv_id":"1307.8049","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-propound-method-for-the-improvement-of","title":"A Propound Method for the Improvement of Cluster Quality","date":"2013-07-25","arxiv_id":"1307.6814","repositories_listed":0,"syntology":null},{"url":null,"slug":"cluster-trees-on-manifolds","title":"Cluster Trees on Manifolds","date":"2013-07-24","arxiv_id":"1307.6515","repositories_listed":0,"syntology":null},{"url":null,"slug":"new-optimization-approach-using-clustering","title":"New Optimization Approach Using Clustering-Based Parallel Genetic Algorithm","date":"2013-07-22","arxiv_id":"1307.5667","repositories_listed":0,"syntology":null},{"url":null,"slug":"mixtures-of-common-skew-t-factor-analyzers","title":"Mixtures of Common Skew-t Factor Analyzers","date":"2013-07-21","arxiv_id":"1307.5558","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-algorithm-for-gujarati-language","title":"Clustering Algorithm for Gujarati Language","date":"2013-07-20","arxiv_id":"1307.5393","repositories_listed":0,"syntology":null},{"url":null,"slug":"making-laplacians-commute","title":"Making Laplacians commute","date":"2013-07-19","arxiv_id":"1307.6549","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-cluster-graphical-lasso-for-improved","title":"The Cluster Graphical Lasso for improved estimation of Gaussian graphical models","date":"2013-07-19","arxiv_id":"1307.5339","repositories_listed":0,"syntology":null},{"url":null,"slug":"video-text-localization-using-wavelet-and","title":"Video Text Localization using Wavelet and Shearlet Transforms","date":"2013-07-18","arxiv_id":"1307.4990","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-soft-power-diagrams","title":"On Soft Power Diagrams","date":"2013-07-15","arxiv_id":"1307.3949","repositories_listed":0,"syntology":null},{"url":null,"slug":"fractionally-supervised-classification","title":"Fractionally-Supervised Classification","date":"2013-07-13","arxiv_id":"1307.3598","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-an-integrated-distance-metric-for","title":"Learning an Integrated Distance Metric for Comparing Structure of Complex Networks","date":"2013-07-13","arxiv_id":"1307.3626","repositories_listed":0,"syntology":null},{"url":null,"slug":"performance-analysis-of-clustering-algorithms","title":"Performance Analysis of Clustering Algorithms for Gene Expression Data","date":"2013-07-12","arxiv_id":"1307.3549","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-gene-expression-data-using","title":"Unsupervised Gene Expression Data using Enhanced Clustering Method","date":"2013-07-12","arxiv_id":"1307.3337","repositories_listed":0,"syntology":null},{"url":null,"slug":"flow-based-algorithms-for-local-graph","title":"Flow-Based Algorithms for Local Graph Clustering","date":"2013-07-10","arxiv_id":"1307.2855","repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-the-creatures-of-habit-clustering","title":"Finding the creatures of habit; Clustering households based on their flexibility in using electricity","date":"2013-07-08","arxiv_id":"1307.2111","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-blessing-of-transitivity-in-sparse-and","title":"The blessing of transitivity in sparse and stochastic networks","date":"2013-07-08","arxiv_id":"1307.2302","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-clustering-to-extract-personality","title":"Using Clustering to extract Personality Information from socio economic data","date":"2013-07-08","arxiv_id":"1307.1998","repositories_listed":0,"syntology":null},{"url":null,"slug":"biomarker-clustering-of-colorectal-cancer","title":"Biomarker Clustering of Colorectal Cancer Data to Complement Clinical Classification","date":"2013-07-05","arxiv_id":"1307.1601","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-of-complex-networks-and-community","title":"Clustering of Complex Networks and Community Detection Using Group Search Optimization","date":"2013-07-04","arxiv_id":"1307.1372","repositories_listed":0,"syntology":null},{"url":null,"slug":"creating-personalised-energy-plans-from","title":"Creating Personalised Energy Plans. From Groups to Individuals using Fuzzy C Means Clustering","date":"2013-07-04","arxiv_id":"1307.1385","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-application-of-a-data-mining-framework-to","title":"The Application of a Data Mining Framework to Energy Usage Profiling in Domestic Residences using UK data","date":"2013-07-04","arxiv_id":"1307.1380","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-efficient-model-selection-for-gaussian","title":"An Efficient Model Selection for Gaussian Mixture Model in a Bayesian Framework","date":"2013-07-03","arxiv_id":"1307.0995","repositories_listed":0,"syntology":null},{"url":null,"slug":"application-of-a-clustering-framework-to-uk","title":"Application of a clustering framework to UK domestic electricity data","date":"2013-07-03","arxiv_id":"1307.1079","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploratory-learning","title":"Exploratory Learning","date":"2013-07-01","arxiv_id":"1307.0253","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-clustering-methods","title":"Semi-supervised clustering methods","date":"2013-07-01","arxiv_id":"1307.0252","repositories_listed":0,"syntology":null},{"url":null,"slug":"websets-extracting-sets-of-entities-from-the","title":"WebSets: Extracting Sets of Entities from the Web Using Unsupervised Information Extraction","date":"2013-07-01","arxiv_id":"1307.0261","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-active-contour-model-for-texture","title":"A Novel Active Contour Model for Texture Segmentation","date":"2013-06-28","arxiv_id":"1306.6726","repositories_listed":0,"syntology":null},{"url":null,"slug":"constrained-optimization-for-a-subset-of-the","title":"Constrained Optimization for a Subset of the Gaussian Parsimonious Clustering Models","date":"2013-06-25","arxiv_id":"1306.5824","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-redemption-clustering-sparse","title":"Spectral redemption: clustering sparse networks","date":"2013-06-24","arxiv_id":"1306.5550","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-variational-approximations-dic-rubric-for","title":"A Variational Approximations-DIC Rubric for Parameter Estimation and Mixture Model Selection Within a Family Setting","date":"2013-06-23","arxiv_id":"1306.5368","repositories_listed":0,"syntology":null},{"url":null,"slug":"song-based-classification-techniques-for","title":"Song-based Classification techniques for Endangered Bird Conservation","date":"2013-06-22","arxiv_id":"1306.5349","repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminating-word-senses-with-tourist-walks","title":"Discriminating word senses with tourist walks in complex networks","date":"2013-06-17","arxiv_id":"1306.3920","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-parametric-power-law-data-clustering","title":"Non-parametric Power-law Data Clustering","date":"2013-06-13","arxiv_id":"1306.3003","repositories_listed":0,"syntology":null},{"url":null,"slug":"flexible-sampling-of-discrete-data","title":"Flexible sampling of discrete data correlations without the marginal distributions","date":"2013-06-12","arxiv_id":"1306.2685","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimization-of-clustering-for-clustering","title":"Optimization of Clustering for Clustering-based Image Denoising","date":"2013-06-12","arxiv_id":"1306.2967","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-approach-for-single-gene-selection","title":"A Novel Approach for Single Gene Selection Using Clustering and Dimensionality Reduction","date":"2013-06-10","arxiv_id":"1306.2118","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-noisy-clustering","title":"Adaptive Noisy Clustering","date":"2013-06-10","arxiv_id":"1306.2194","repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminative-k-means-clustering","title":"Discriminative k-means clustering","date":"2013-06-10","arxiv_id":"1306.2102","repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-model-selection-using-a-scalable","title":"Generative Model Selection Using a Scalable and Size-Independent Complex Network Classifier","date":"2013-06-10","arxiv_id":"1306.2298","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimax-theory-for-high-dimensional-gaussian","title":"Minimax Theory for High-dimensional Gaussian Mixtures with Sparse Mean Separation","date":"2013-06-09","arxiv_id":"1306.2035","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-greedy-algorithm-for-subspace-clustering","title":"Fast greedy algorithm for subspace clustering from corrupted and incomplete data","date":"2013-06-07","arxiv_id":"1306.1716","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-fuzzy-based-approach-to-text-mining-and","title":"A Fuzzy Based Approach to Text Mining and Document Clustering","date":"2013-06-06","arxiv_id":"1306.4633","repositories_listed":0,"syntology":null},{"url":null,"slug":"diffusion-map-for-clustering-fmri-spatial","title":"Diffusion map for clustering fMRI spatial maps extracted by independent component analysis","date":"2013-06-06","arxiv_id":"1306.1350","repositories_listed":0,"syntology":null},{"url":null,"slug":"verdict-accuracy-of-quick-reduct-algorithm","title":"Verdict Accuracy of Quick Reduct Algorithm using Clustering and Classification Techniques for Gene Expression Data","date":"2013-06-06","arxiv_id":"1306.1323","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiclass-total-variation-clustering","title":"Multiclass Total Variation Clustering","date":"2013-06-05","arxiv_id":"1306.1185","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-gang-of-bandits","title":"A Gang of Bandits","date":"2013-06-04","arxiv_id":"1306.0811","repositories_listed":0,"syntology":null},{"url":null,"slug":"urban-ozone-concentration-forecasting-with","title":"Urban ozone concentration forecasting with artificial neural network in Corsica","date":"2013-06-04","arxiv_id":"1306.0897","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-k-means-and-k-median-clustering","title":"Distributed k-Means and k-Median Clustering on General Topologies","date":"2013-06-03","arxiv_id":"1306.0604","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-bayesian-approach-to-multimodal-visual","title":"A Bayesian Approach to Multimodal Visual Dictionary Learning","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-fast-approximate-aib-algorithm-for","title":"A Fast Approximate AIB Algorithm for Distributional Word Clustering","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-minimum-error-vanishing-point-detection","title":"A Minimum Error Vanishing Point Detection Approach for Uncalibrated Monocular Images of Man-Made Environments","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"bottom-up-segmentation-for-top-down-detection","title":"Bottom-Up Segmentation for Top-Down Detection","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"broadly-improving-user-classification-via","title":"Broadly Improving User Classification via Communication-Based Name and Location Clustering on Twitter","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-for-categorial-grammar-induction","title":"Clustering for categorial grammar induction (Inf\\'erence grammaticale guid\\'ee par clustering) [in French]","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-voices-in-the-waste-land","title":"Clustering Voices in The Waste Land","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"constrained-clustering-and-its-application-to","title":"Constrained Clustering and Its Application to Face Clustering in Videos","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"constraints-as-features","title":"Constraints as Features","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminative-color-descriptors","title":"Discriminative Color Descriptors","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminative-sub-categorization","title":"Discriminative Sub-categorization","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminative-subspace-clustering","title":"Discriminative Subspace Clustering","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"duluth-word-sense-induction-applied-to-web","title":"Duluth : Word Sense Induction Applied to Web Page Clustering","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-laplacian-pca-closed-form-solution-and","title":"Graph-Laplacian PCA: Closed-Form Solution and Robustness","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-image-set-classification-via-joint","title":"Improved Image Set Classification via Joint Sparse Approximated Nearest Subspaces","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"is-there-a-procedural-logic-to-architecture","title":"Is There a Procedural Logic to Architecture?","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-sparsity-based-representation-and","title":"Joint Sparsity-Based Representation and Analysis of Unconstrained Activities","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"k-means-hashing-an-affinity-preserving","title":"K-Means Hashing: An Affinity-Preserving Quantization Method for Learning Binary Compact Codes","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-cross-domain-information-transfer","title":"Learning Cross-Domain Information Transfer for Location Recognition and Clustering","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-without-human-scores-for-blind-image","title":"Learning without Human Scores for Blind Image Quality Assessment","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"limsi-cross-lingual-word-sense-disambiguation","title":"LIMSI : Cross-lingual Word Sense Disambiguation using Translation Sense Clustering","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/locally-aligned-feature-transforms-across","slug":"locally-aligned-feature-transforms-across","title":"Locally Aligned Feature Transforms across Views","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multilingual-document-clustering-state-of-the","title":"Multilingual document clustering : state of the art (Construction de corpus multilingues : \\'etat de l'art) [in French]","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-object-co-detection","title":"Robust Object Co-detection","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"satty-word-sense-induction-application-in-web","title":"SATTY : Word Sense Induction Application in Web Search Clustering","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-sparse-subspace-clustering","title":"Scalable Sparse Subspace Clustering","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-relation-clustering-for-unsupervised","title":"Semantic relation clustering for unsupervised information extraction (Regroupement s\\'emantique de relations pour l'extraction d'information non supervis\\'ee) [in French]","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"similarities-induced-by-a-comparability","title":"Similarities induced by a comparability mapping : meaning and utility in the context of the clustering of comparable texts (Similarit\\'es induites par mesure de comparabilit\\'e : signification et utilit\\'e pour le clustering et l'alignement de textes comparables) [in French]","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-generalized-laplacian-distance-and-its","title":"The Generalized Laplacian Distance and Its Applications for Visual Matching","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unimelb-topic-modelling-based-word-sense","title":"unimelb: Topic Modelling-based Word Sense Induction for Web Snippet Clustering","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-metaphor-identification-using","title":"Unsupervised Metaphor Identification Using Hierarchical Graph Factorization Clustering","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"weakly-supervised-dual-clustering-for-image","title":"Weakly-Supervised Dual Clustering for Image Semantic Segmentation","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-modeling-and-registration-of-cell","title":"Joint Modeling and Registration of Cell Populations in Cohorts of High-Dimensional Flow Cytometric Data","date":"2013-05-31","arxiv_id":"1305.7344","repositories_listed":0,"syntology":null},{"url":null,"slug":"privileged-information-for-data-clustering","title":"Privileged Information for Data Clustering","date":"2013-05-31","arxiv_id":"1305.7454","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-symmetric-rank-one-quasi-newton-method-for","title":"A Symmetric Rank-one Quasi Newton Method for Non-negative Matrix Factorization","date":"2013-05-24","arxiv_id":"1305.5829","repositories_listed":0,"syntology":null},{"url":null,"slug":"power-to-the-points-validating-data","title":"Power to the Points: Validating Data Memberships in Clusterings","date":"2013-05-21","arxiv_id":"1305.4757","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-annealing-for-dirichlet-process","title":"Quantum Annealing for Dirichlet Process Mixture Models with Applications to Network Clustering","date":"2013-05-19","arxiv_id":"1305.4325","repositories_listed":0,"syntology":null},{"url":null,"slug":"noisy-subspace-clustering-via-thresholding","title":"Noisy Subspace Clustering via Thresholding","date":"2013-05-15","arxiv_id":"1305.3486","repositories_listed":0,"syntology":null},{"url":null,"slug":"performance-enhancement-of-distributed-quasi","title":"Performance Enhancement of Distributed Quasi Steady-State Genetic Algorithm","date":"2013-05-10","arxiv_id":"1305.2830","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-method-for-visuo-spatial-classification-of","title":"A Method for Visuo-Spatial Classification of Freehand Shapes Freely Sketched","date":"2013-05-07","arxiv_id":"1305.1520","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-svm-and-k-means-clustering-based-fast-and","title":"A SVM and K-means clustering based fast and efficient intrusion detection system","date":"2013-05-06","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"simple-deep-random-model-ensemble","title":"Simple Deep Random Model Ensemble","date":"2013-05-05","arxiv_id":"1305.1019","repositories_listed":0,"syntology":null},{"url":null,"slug":"anisotropic-oracle-inequalities-in-noisy","title":"Anisotropic oracle inequalities in noisy quantization","date":"2013-05-03","arxiv_id":"1305.0630","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-decompositions-a-new-concept-in-brain","title":"Tensor Decompositions: A New Concept in Brain Data Analysis?","date":"2013-05-02","arxiv_id":"1305.0395","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-unclustered-data-unsupervised","title":"Clustering Unclustered Data: Unsupervised Binary Labeling of Two Datasets Having Different Class Balances","date":"2013-05-01","arxiv_id":"1305.0103","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-speech-corpus-to-intonation-corpus","title":"From Speech Corpus to Intonation Corpus: Clustering Phrase Pitch Contours of Lithuanian","date":"2013-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"local-graph-clustering-beyond-cheegers","title":"Local Graph Clustering Beyond Cheeger's Inequality","date":"2013-04-30","arxiv_id":"1304.8132","repositories_listed":0,"syntology":null}],"record_sha256":"f9d7159e1ef42360c1ef18b8525f9da95b5f95ac94879b68d6cdaa35e19755a3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}