{"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/94","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":94,"pages_in_order":108,"rows_per_page":100,"rows":[9301,9400],"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/93","next":"/task/clustering/papers/95","papers":[{"url":null,"slug":"destination-prediction-by-trajectory","title":"Destination Prediction by Trajectory Distribution Based Model","date":"2016-05-10","arxiv_id":"1605.03027","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-time-series-and-the-surprising","title":"Clustering Time Series and the Surprising Robustness of HMMs","date":"2016-05-09","arxiv_id":"1605.02531","repositories_listed":0,"syntology":null},{"url":null,"slug":"fuzzy-clustering-based-segmentation-of","title":"Fuzzy Clustering Based Segmentation Of Vertebrae in T1-Weighted Spinal MR Images","date":"2016-05-09","arxiv_id":"1605.02460","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-learning-for-community-detection-in","title":"Active Learning for Community Detection in Stochastic Block Models","date":"2016-05-08","arxiv_id":"1605.02372","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-recovery-in-shuffled-graphs-via","title":"Information Recovery in Shuffled Graphs via Graph Matching","date":"2016-05-08","arxiv_id":"1605.02315","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-factorization-based-clustering-of","title":"Matrix Factorization-Based Clustering Of Image Features For Bandwidth-Constrained Information Retrieval","date":"2016-05-07","arxiv_id":"1605.02140","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-on-the-edge-learning-structure-in","title":"Clustering on the Edge: Learning Structure in Graphs","date":"2016-05-05","arxiv_id":"1605.01779","repositories_listed":0,"syntology":null},{"url":null,"slug":"do-logarithmic-proximity-measures-outperform","title":"Do logarithmic proximity measures outperform plain ones in graph clustering?","date":"2016-05-03","arxiv_id":"1605.01046","repositories_listed":0,"syntology":null},{"url":null,"slug":"temporal-clustering-of-time-series-via","title":"Temporal Clustering of Time Series via Threshold Autoregressive Models: Application to Commodity Prices","date":"2016-05-03","arxiv_id":"1605.00779","repositories_listed":0,"syntology":null},{"url":null,"slug":"fuzzy-clustering-of-distribution-valued-data","title":"Fuzzy clustering of distribution-valued data using adaptive L2 Wasserstein distances","date":"2016-05-02","arxiv_id":"1605.00513","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-clustering-bandits-for-recommendation","title":"Graph Clustering Bandits for Recommendation","date":"2016-05-02","arxiv_id":"1605.00596","repositories_listed":0,"syntology":null},{"url":null,"slug":"linear-time-outlier-detection-via-sensitivity","title":"Linear-time Outlier Detection via Sensitivity","date":"2016-05-02","arxiv_id":"1605.00519","repositories_listed":0,"syntology":null},{"url":null,"slug":"tradeoffs-for-space-time-data-and-risk-in","title":"Tradeoffs for Space, Time, Data and Risk in Unsupervised Learning","date":"2016-05-02","arxiv_id":"1605.00529","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-comparative-study-of-text-preprocessing","title":"A Comparative Study of Text Preprocessing Approaches for Topic Detection of User Utterances","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-crowdsourced-database-of-event-sequence","title":"A Crowdsourced Database of Event Sequence Descriptions for the Acquisition of High-quality Script Knowledge","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-regional-news-corpora-for-contextualized","title":"A Regional News Corpora for Contextualized Entity Discovery and Linking","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-vector-contraction-inequality-for","title":"A vector-contraction inequality for Rademacher complexities","date":"2016-05-01","arxiv_id":"1605.00251","repositories_listed":0,"syntology":null},{"url":null,"slug":"assessing-the-potential-of-metaphoricity-of","title":"Assessing the Potential of Metaphoricity of verbs using corpus data","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"detecting-optional-arguments-of-verbs","title":"Detecting Optional Arguments of Verbs","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluation-set-for-slovak-news-information","title":"Evaluation Set for Slovak News Information Retrieval","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-induction-of-word-senses-in","title":"Graph-Based Induction of Word Senses in Croatian","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-embedding-language-models-in-semantic","title":"Neural Embedding Language Models in Semantic Clustering of Web Search Results","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"question-answering-with-logic-specific-to","title":"Question-Answering with Logic Specific to Video Games","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"semlinker-a-modular-and-open-source-framework","title":"SemLinker, a Modular and Open Source Framework for Named Entity Discovery and Linking","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"studying-the-temporal-dynamics-of-word-co","title":"Studying the Temporal Dynamics of Word Co-occurrences: An Application to Event Detection","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"vps-gradeup-graded-decisions-on-usage","title":"VPS-GradeUp: Graded Decisions on Usage Patterns","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"whats-the-issue-here-task-based-evaluation-of","title":"What's the Issue Here?: Task-based Evaluation of Reader Comment Summarization Systems","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"an-expressive-dissimilarity-measure-for","title":"An expressive dissimilarity measure for relational clustering using neighbourhood trees","date":"2016-04-29","arxiv_id":"1604.08934","repositories_listed":0,"syntology":null},{"url":null,"slug":"distance-metric-learning-for-aspect-phrase","title":"Distance Metric Learning for Aspect Phrase Grouping","date":"2016-04-29","arxiv_id":"1604.08672","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-transport-vs-fisher-rao-distance","title":"Optimal Transport vs. Fisher-Rao distance between Copulas for Clustering Multivariate Time Series","date":"2016-04-28","arxiv_id":"1604.08634","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-classification-in-hyperspectral","title":"Unsupervised Classification in Hyperspectral Imagery with Nonlocal Total Variation and Primal-Dual Hybrid Gradient Algorithm","date":"2016-04-27","arxiv_id":"1604.08182","repositories_listed":0,"syntology":null},{"url":null,"slug":"condorcets-jury-theorem-for-consensus","title":"Condorcet's Jury Theorem for Consensus Clustering and its Implications for Diversity","date":"2016-04-26","arxiv_id":"1604.07711","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-clustering-of-linear-bandits-in","title":"Distributed Clustering of Linear Bandits in Peer to Peer Networks","date":"2016-04-26","arxiv_id":"1604.07706","repositories_listed":0,"syntology":null},{"url":null,"slug":"ell_p-box-admm-a-versatile-framework-for","title":"$\\ell_p$-Box ADMM: A Versatile Framework for Integer Programming","date":"2016-04-26","arxiv_id":"1604.07666","repositories_listed":0,"syntology":null},{"url":null,"slug":"weighted-spectral-cluster-ensemble","title":"Weighted Spectral Cluster Ensemble","date":"2016-04-25","arxiv_id":"1604.07178","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-with-missing-features-a-penalized","title":"Clustering with Missing Features: A Penalized Dissimilarity Measure based approach","date":"2016-04-22","arxiv_id":"1604.06602","repositories_listed":0,"syntology":null},{"url":null,"slug":"k-bit-swap-a-new-operator-for-real-coded","title":"K-Bit-Swap: A New Operator For Real-Coded Evolutionary Algorithms","date":"2016-04-22","arxiv_id":"1604.06607","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-mean-partition-theorem-of-consensus","title":"The Mean Partition Theorem of Consensus Clustering","date":"2016-04-22","arxiv_id":"1604.06626","repositories_listed":0,"syntology":null},{"url":null,"slug":"loh-and-behold-web-scale-visual-search","title":"LOH and behold: Web-scale visual search, recommendation and clustering using Locally Optimized Hashing","date":"2016-04-21","arxiv_id":"1604.06480","repositories_listed":0,"syntology":null},{"url":null,"slug":"markov-models-for-ocular-fixation-locations","title":"Markov models for ocular fixation locations in the presence and absence of colour","date":"2016-04-21","arxiv_id":"1604.06335","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-detection-and-structural-reconstruction-of","title":"On Detection and Structural Reconstruction of Small-World Random Networks","date":"2016-04-21","arxiv_id":"1604.06474","repositories_listed":0,"syntology":null},{"url":null,"slug":"locating-a-small-cluster-privately","title":"Locating a Small Cluster Privately","date":"2016-04-19","arxiv_id":"1604.05590","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-comparable-corpora-of-russian-and","title":"Clustering Comparable Corpora of Russian and Ukrainian Academic Texts: Word Embeddings and Semantic Fingerprints","date":"2016-04-18","arxiv_id":"1604.05372","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-initial-seed-selection-algorithm-for-k","title":"An Initial Seed Selection Algorithm for K-means Clustering of Georeferenced Data to Improve Replicability of Cluster Assignments for Mapping Application","date":"2016-04-17","arxiv_id":"1604.04893","repositories_listed":0,"syntology":null},{"url":null,"slug":"accessing-accurate-documents-by-mining","title":"Accessing accurate documents by mining auxiliary document information","date":"2016-04-15","arxiv_id":"1604.04558","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-deterministic-conditions-for-subspace","title":"On deterministic conditions for subspace clustering under missing data","date":"2016-04-15","arxiv_id":"1604.04615","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-single-particle-deep-clustering","title":"Unsupervised single-particle deep clustering via statistical manifold learning","date":"2016-04-15","arxiv_id":"1604.04539","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-source-multi-view-clustering-via","title":"Multi-Source Multi-View Clustering via Discrepancy Penalty","date":"2016-04-14","arxiv_id":"1604.04029","repositories_listed":0,"syntology":null},{"url":null,"slug":"reversible-image-merging-for-low-level","title":"Reversible Image Merging for Low-level Machine Vision","date":"2016-04-13","arxiv_id":"1604.03832","repositories_listed":0,"syntology":null},{"url":null,"slug":"reservoir-computing-for-spatiotemporal-signal","title":"Reservoir computing for spatiotemporal signal classification without trained output weights","date":"2016-04-11","arxiv_id":"1604.03073","repositories_listed":0,"syntology":null},{"url":null,"slug":"distance-for-functional-data-clustering-based","title":"Distance for Functional Data Clustering Based on Smoothing Parameter Commutation","date":"2016-04-10","arxiv_id":"1604.02668","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-via-crowdsourcing","title":"Clustering Via Crowdsourcing","date":"2016-04-07","arxiv_id":"1604.01839","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-1-approximation-of-the-lowner-extremal","title":"Fast $(1+ε)$-approximation of the Löwner extremal matrices of high-dimensional symmetric matrices","date":"2016-04-06","arxiv_id":"1604.01592","repositories_listed":0,"syntology":null},{"url":null,"slug":"heavy-hitters-via-cluster-preserving","title":"Heavy hitters via cluster-preserving clustering","date":"2016-04-05","arxiv_id":"1604.01357","repositories_listed":0,"syntology":null},{"url":null,"slug":"voronoi-region-based-adaptive-unsupervised","title":"Voronoi Region-Based Adaptive Unsupervised Color Image Segmentation","date":"2016-04-02","arxiv_id":"1604.00533","repositories_listed":0,"syntology":null},{"url":null,"slug":"audio-visual-speaker-diarization-based-on","title":"Audio-Visual Speaker Diarization Based on Spatiotemporal Bayesian Fusion","date":"2016-03-31","arxiv_id":"1603.09725","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-search-yields-a-ptas-for-k-means-in","title":"Local Search Yields a PTAS for k-Means in Doubling Metrics","date":"2016-03-29","arxiv_id":"1603.08976","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-gaussian-mixture-model-with","title":"Hierarchical Gaussian Mixture Model with Objects Attached to Terminal and Non-terminal Dendrogram Nodes","date":"2016-03-28","arxiv_id":"1603.08342","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchy-of-groups-evaluation-using","title":"Hierarchy of Groups Evaluation Using Different F-score Variants","date":"2016-03-28","arxiv_id":"1603.08323","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-hough-regression-models-via-bridge","title":"Learning Hough Regression Models via Bridge Partial Least Squares for Object Detection","date":"2016-03-26","arxiv_id":"1603.08092","repositories_listed":0,"syntology":null},{"url":null,"slug":"hybridization-of-expectation-maximization-and","title":"Hybridization of Expectation-Maximization and K-Means Algorithms for Better Clustering Performance","date":"2016-03-25","arxiv_id":"1603.07879","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-clustering-financial-time-series-a-need","title":"On clustering financial time series: a need for distances between dependent random variables","date":"2016-03-25","arxiv_id":"1603.07822","repositories_listed":0,"syntology":null},{"url":null,"slug":"privacy-preserved-big-data-analysis-based-on","title":"Privacy-Preserved Big Data Analysis Based on Asymmetric Imputation Kernels and Multiside Similarities","date":"2016-03-25","arxiv_id":"1603.07828","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-category-discovery-via-looped","title":"Unsupervised Category Discovery via Looped Deep Pseudo-Task Optimization Using a Large Scale Radiology Image Database","date":"2016-03-25","arxiv_id":"1603.07965","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-time-series-energy-data-from-smart","title":"Clustering Time-Series Energy Data from Smart Meters","date":"2016-03-24","arxiv_id":"1603.07602","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-properties-of-customer-sentiment-in","title":"Semantic Properties of Customer Sentiment in Tweets","date":"2016-03-24","arxiv_id":"1603.07624","repositories_listed":0,"syntology":null},{"url":null,"slug":"skill-based-differences-in-spatio-temporal","title":"Skill-Based Differences in Spatio-Temporal Team Behavior in Defence of The Ancients 2","date":"2016-03-24","arxiv_id":"1603.07738","repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-glaucoma-visual-field-loss-by","title":"Predicting Glaucoma Visual Field Loss by Hierarchically Aggregating Clustering-based Predictors","date":"2016-03-23","arxiv_id":"1603.07094","repositories_listed":0,"syntology":null},{"url":null,"slug":"completely-random-measures-for-modeling-power","title":"Completely random measures for modeling power laws in sparse graphs","date":"2016-03-22","arxiv_id":"1603.06915","repositories_listed":0,"syntology":null},{"url":null,"slug":"edge-exchangeable-graphs-and-sparsity","title":"Edge-exchangeable graphs and sparsity","date":"2016-03-22","arxiv_id":"1603.06898","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-real-time-cluster-configurations-of","title":"Using real-time cluster configurations of streaming asynchronous features as online state descriptors in financial markets","date":"2016-03-22","arxiv_id":"1603.06805","repositories_listed":0,"syntology":null},{"url":null,"slug":"hard-clustering-with-gaussian-mixture-models","title":"Hard-Clustering with Gaussian Mixture Models","date":"2016-03-21","arxiv_id":"1603.06478","repositories_listed":0,"syntology":null},{"url":null,"slug":"exact-clustering-of-weighted-graphs-via","title":"Exact Clustering of Weighted Graphs via Semidefinite Programming","date":"2016-03-16","arxiv_id":"1603.05296","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-clustering-and-graph-partitioning-via","title":"Data Clustering and Graph Partitioning via Simulated Mixing","date":"2016-03-15","arxiv_id":"1603.04918","repositories_listed":0,"syntology":null},{"url":null,"slug":"regression-based-hypergraph-learning-for","title":"Regression-based Hypergraph Learning for Image Clustering and Classification","date":"2016-03-14","arxiv_id":"1603.04150","repositories_listed":0,"syntology":null},{"url":null,"slug":"sssc-am-a-unified-framework-for-video-co","title":"SSSC-AM: A Unified Framework for Video Co-Segmentation by Structured Sparse Subspace Clustering with Appearance and Motion Features","date":"2016-03-14","arxiv_id":"1603.04139","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-financial-time-series-how-long-is","title":"Clustering Financial Time Series: How Long is Enough?","date":"2016-03-13","arxiv_id":"1603.04017","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-clustering-of-correlated-variables","title":"Efficient Clustering of Correlated Variables and Variable Selection in High-Dimensional Linear Models","date":"2016-03-11","arxiv_id":"1603.03724","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonstationary-distance-metric-learning","title":"Nonstationary Distance Metric Learning","date":"2016-03-11","arxiv_id":"1603.03678","repositories_listed":0,"syntology":null},{"url":null,"slug":"watch-n-patch-unsupervised-learning-of","title":"Watch-n-Patch: Unsupervised Learning of Actions and Relations","date":"2016-03-11","arxiv_id":"1603.03541","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-innovative-imputation-and-classification","title":"An Innovative Imputation and Classification Approach for Accurate Disease Prediction","date":"2016-03-10","arxiv_id":"1603.03281","repositories_listed":0,"syntology":null},{"url":null,"slug":"building-a-fine-grained-entity-typing-system","title":"Building a Fine-Grained Entity Typing System Overnight for a New X (X = Language, Domain, Genre)","date":"2016-03-10","arxiv_id":"1603.03112","repositories_listed":0,"syntology":null},{"url":null,"slug":"real-time-error-detection-in-metal-arc","title":"Real time error detection in metal arc welding process using Artificial Neural Netwroks","date":"2016-03-10","arxiv_id":"1603.03149","repositories_listed":0,"syntology":null},{"url":null,"slug":"bipartite-correlation-clustering-maximizing","title":"Bipartite Correlation Clustering -- Maximizing Agreements","date":"2016-03-09","arxiv_id":"1603.02782","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-bayesian-non-parametric-method-for","title":"A Bayesian non-parametric method for clustering high-dimensional binary data","date":"2016-03-08","arxiv_id":"1603.02494","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-feature-learning-and-object-recognition","title":"A Feature Learning and Object Recognition Framework for Underwater Fish Images","date":"2016-03-05","arxiv_id":"1603.01696","repositories_listed":0,"syntology":null},{"url":null,"slug":"elastic-net-hypergraph-learning-for-image","title":"Elastic Net Hypergraph Learning for Image Clustering and Semi-supervised Classification","date":"2016-03-03","arxiv_id":"1603.01096","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-is-the-right-way-to-represent-document","title":"What is the right way to represent document images?","date":"2016-03-03","arxiv_id":"1603.01076","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-clustering-variational-image","title":"Graph clustering, variational image segmentation methods and Hough transform scale detection for object measurement in images","date":"2016-02-27","arxiv_id":"1602.08574","repositories_listed":0,"syntology":null},{"url":null,"slug":"theoretical-analysis-of-the-k-means-algorithm","title":"Theoretical Analysis of the $k$-Means Algorithm - A Survey","date":"2016-02-26","arxiv_id":"1602.08254","repositories_listed":0,"syntology":null},{"url":null,"slug":"lens-depth-function-and-k-relative","title":"Lens depth function and k-relative neighborhood graph: versatile tools for ordinal data analysis","date":"2016-02-23","arxiv_id":"1602.07194","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-effective-and-efficient-approach-for","title":"An Effective and Efficient Approach for Clusterability Evaluation","date":"2016-02-22","arxiv_id":"1602.06687","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-of-neural-codewords-revealed-by-a","title":"Clustering of neural codewords revealed by a first-order phase transition","date":"2016-02-22","arxiv_id":"1602.06630","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-subgaussian-mixtures-by","title":"Clustering subgaussian mixtures by semidefinite programming","date":"2016-02-22","arxiv_id":"1602.06612","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-with-a-reject-option-interactive-1","title":"Clustering with a Reject Option: Interactive Clustering as Bayesian Prior Elicitation","date":"2016-02-22","arxiv_id":"1602.06886","repositories_listed":0,"syntology":null},{"url":null,"slug":"recovering-the-number-of-clusters-in-data","title":"Recovering the number of clusters in data sets with noise features using feature rescaling factors","date":"2016-02-22","arxiv_id":"1602.06989","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-clustering-for-short-text-via","title":"Semi-supervised Clustering for Short Text via Deep Representation Learning","date":"2016-02-22","arxiv_id":"1602.06797","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-neural-networks-for-learning-graph","title":"Deep neural networks for learning graph representations","date":"2016-02-21","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"uniform-hypergraph-partitioning-provable","title":"Uniform Hypergraph Partitioning: Provable Tensor Methods and Sampling Techniques","date":"2016-02-21","arxiv_id":"1602.06516","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-statistical-tests-for-mrna-and","title":"Generalized Statistical Tests for mRNA and Protein Subcellular Spatial Patterning against Complete Spatial Randomness","date":"2016-02-20","arxiv_id":"1602.06429","repositories_listed":0,"syntology":null}],"record_sha256":"f26cd3e9c5bb169c280129dc517985cb6e79c6ceaa19394a5646d08d241888f1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}