{"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/93","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":93,"pages_in_order":108,"rows_per_page":100,"rows":[9201,9300],"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/92","next":"/task/clustering/papers/94","papers":[{"url":null,"slug":"hierarchical-manifold-clustering-on-diffusion","title":"Hierarchical Manifold Clustering on Diffusion Maps for Connectomics (MIT 18.S096 final project)","date":"2016-07-20","arxiv_id":"1607.06318","repositories_listed":0,"syntology":null},{"url":null,"slug":"dendritic-spine-shape-analysis-a-clustering","title":"Dendritic Spine Shape Analysis: A Clustering Perspective","date":"2016-07-19","arxiv_id":"1607.05523","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-graph-clustering-by-load","title":"Distributed Graph Clustering by Load Balancing","date":"2016-07-18","arxiv_id":"1607.04984","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-event-detection-and-entity-resolution-a","title":"Joint Event Detection and Entity Resolution: a Virtuous Cycle","date":"2016-07-18","arxiv_id":"1607.05142","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-social-circles-in-ego-networks-based","title":"Learning Social Circles in Ego Networks based on Multi-View Social Graphs","date":"2016-07-16","arxiv_id":"1607.04747","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-body-non-rigid-structure-from-motion","title":"Multi-body Non-rigid Structure-from-Motion","date":"2016-07-15","arxiv_id":"1607.04515","repositories_listed":0,"syntology":null},{"url":null,"slug":"effects-of-additional-data-on-bayesian","title":"Effects of Additional Data on Bayesian Clustering","date":"2016-07-13","arxiv_id":"1607.03574","repositories_listed":0,"syntology":null},{"url":null,"slug":"fitting-a-simplicial-complex-using-a","title":"Fitting a Simplicial Complex using a Variation of k-means","date":"2016-07-13","arxiv_id":"1607.03849","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-deterministic-conditions-for-subspace-1","title":"On Deterministic Conditions for Subspace Clustering under Missing Data","date":"2016-07-11","arxiv_id":"1607.03191","repositories_listed":0,"syntology":null},{"url":null,"slug":"intra-layer-nonuniform-quantization-for-deep","title":"Intra-layer Nonuniform Quantization for Deep Convolutional Neural Network","date":"2016-07-10","arxiv_id":"1607.02720","repositories_listed":0,"syntology":null},{"url":null,"slug":"document-clustering-games-in-static-and","title":"Document Clustering Games in Static and Dynamic Scenarios","date":"2016-07-08","arxiv_id":"1607.02436","repositories_listed":0,"syntology":null},{"url":null,"slug":"mini-batch-spectral-clustering","title":"Mini-Batch Spectral Clustering","date":"2016-07-07","arxiv_id":"1607.02024","repositories_listed":0,"syntology":null},{"url":null,"slug":"random-walk-graph-laplacian-based-smoothness","title":"Random Walk Graph Laplacian based Smoothness Prior for Soft Decoding of JPEG Images","date":"2016-07-07","arxiv_id":"1607.01895","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-optimal-learning-method-for-developing","title":"An optimal learning method for developing personalized treatment regimes","date":"2016-07-06","arxiv_id":"1607.01462","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphons-mergeons-and-so-on","title":"Graphons, mergeons, and so on!","date":"2016-07-06","arxiv_id":"1607.01718","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-sampling-and-greedy-map-inference-of","title":"On Sampling and Greedy MAP Inference of Constrained Determinantal Point Processes","date":"2016-07-06","arxiv_id":"1607.01551","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithms-for-generalized-cluster-wise","title":"Algorithms for Generalized Cluster-wise Linear Regression","date":"2016-07-05","arxiv_id":"1607.01417","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-aggregate-and-iterative-disaggregate","title":"An Aggregate and Iterative Disaggregate Algorithm with Proven Optimality in Machine Learning","date":"2016-07-05","arxiv_id":"1607.01400","repositories_listed":0,"syntology":null},{"url":null,"slug":"rademacher-complexity-bounds-for-a-penalized","title":"Rademacher Complexity Bounds for a Penalized Multiclass Semi-Supervised Algorithm","date":"2016-07-02","arxiv_id":"1607.00567","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-scaled-bregman-theorem-with-applications","title":"A scaled Bregman theorem with applications","date":"2016-07-01","arxiv_id":"1607.00360","repositories_listed":0,"syntology":null},{"url":null,"slug":"d-etection-et-classification-non-supervis-ees","title":"D\\'etection et classification non supervis\\'ees de relations s\\'emantiques dans des articles scientifiques (Unsupervised Classification of Semantic Relations in Scientific Papers)","date":"2016-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"inbenta-semantic-clustering-un-outil-de","title":"Inbenta Semantic Clustering : un outil de classification non-supervis\\'ee hybride (Inbenta Semantic Clustering : a hybrid unsupervised classification tool)","date":"2016-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-semi-definite-programming-approach-to-low","title":"A Semi-Definite Programming approach to low dimensional embedding for unsupervised clustering","date":"2016-06-29","arxiv_id":"1606.09190","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-based-relational-unsupervised","title":"Clustering-Based Relational Unsupervised Representation Learning with an Explicit Distributed Representation","date":"2016-06-28","arxiv_id":"1606.08658","repositories_listed":0,"syntology":null},{"url":null,"slug":"label-tree-embeddings-for-acoustic-scene","title":"Label Tree Embeddings for Acoustic Scene Classification","date":"2016-06-25","arxiv_id":"1606.07908","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-and-inferring-human-intents-and","title":"Modeling and Inferring Human Intents and Latent Functional Objects for Trajectory Prediction","date":"2016-06-24","arxiv_id":"1606.07827","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-attack-graph-analysis-through","title":"Efficient Attack Graph Analysis through Approximate Inference","date":"2016-06-22","arxiv_id":"1606.07025","repositories_listed":0,"syntology":null},{"url":null,"slug":"grouping-the-executables-to-detect-malware","title":"Grouping the executables to detect malware with high accuracy","date":"2016-06-22","arxiv_id":"1606.06908","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-with-a-reject-option-interactive","title":"Clustering with a Reject Option: Interactive Clustering as Bayesian Prior Elicitation","date":"2016-06-19","arxiv_id":"1606.05896","repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-object-cluster-hierarchies-for","title":"Hierarchical Data Generator based on Tree-Structured Stick Breaking Process for Benchmarking Clustering Methods","date":"2016-06-17","arxiv_id":"1606.05681","repositories_listed":0,"syntology":null},{"url":null,"slug":"psf-introduction-to-r-package-for-pattern","title":"PSF : Introduction to R Package for Pattern Sequence Based Forecasting Algorithm","date":"2016-06-17","arxiv_id":"1606.05492","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-from-non-stationary-stream-data-in","title":"Learning from Non-Stationary Stream Data in Multiobjective Evolutionary Algorithm","date":"2016-06-16","arxiv_id":"1606.05169","repositories_listed":0,"syntology":null},{"url":null,"slug":"ego-surfing-person-localization-in-first","title":"Ego-Surfing: Person Localization in First-Person Videos Using Ego-Motion Signatures","date":"2016-06-15","arxiv_id":"1606.04637","repositories_listed":0,"syntology":null},{"url":null,"slug":"smart-reply-automated-response-suggestion-for","title":"Smart Reply: Automated Response Suggestion for Email","date":"2016-06-15","arxiv_id":"1606.04870","repositories_listed":0,"syntology":null},{"url":null,"slug":"sequential-geophysical-and-flow-inversion-to","title":"Sequential geophysical and flow inversion to characterize fracture networks in subsurface systems","date":"2016-06-14","arxiv_id":"1606.04464","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-fuzzy-logic-to-leverage-html-markup-for","title":"Using Fuzzy Logic to Leverage HTML Markup for Web Page Representation","date":"2016-06-14","arxiv_id":"1606.04429","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-community-detection-for-cross-document","title":"Graph-Community Detection for Cross-Document Topic Segment Relationship Identification","date":"2016-06-13","arxiv_id":"1606.04081","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-combine-a-billion-alphas","title":"How to Combine a Billion Alphas","date":"2016-06-13","arxiv_id":"1603.05937","repositories_listed":0,"syntology":null},{"url":null,"slug":"laplacian-lrr-on-product-grassmann-manifolds","title":"Laplacian LRR on Product Grassmann Manifolds for Human Activity Clustering in Multi-Camera Video Surveillance","date":"2016-06-13","arxiv_id":"1606.03838","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-constrained-clustering-based-approach-for","title":"A constrained clustering based approach for matching a collection of feature sets","date":"2016-06-12","arxiv_id":"1606.03731","repositories_listed":0,"syntology":null},{"url":null,"slug":"store-location-selection-via-mining-search","title":"Store Location Selection via Mining Search Query Logs of Baidu Maps","date":"2016-06-12","arxiv_id":"1606.03662","repositories_listed":0,"syntology":null},{"url":null,"slug":"sub-story-detection-in-twitter-with","title":"Sub-Story Detection in Twitter with Hierarchical Dirichlet Processes","date":"2016-06-11","arxiv_id":"1606.03561","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-application-of-network-lasso-optimization","title":"An Application of Network Lasso Optimization For Ride Sharing Prediction","date":"2016-06-10","arxiv_id":"1606.03276","repositories_listed":0,"syntology":null},{"url":null,"slug":"wordnet2vec-corpora-agnostic-word","title":"WordNet2Vec: Corpora Agnostic Word Vectorization Method","date":"2016-06-10","arxiv_id":"1606.03335","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-with-same-cluster-queries","title":"Clustering with Same-Cluster Queries","date":"2016-06-08","arxiv_id":"1606.02404","repositories_listed":0,"syntology":null},{"url":null,"slug":"symbolic-music-data-version-10","title":"Symbolic Music Data Version 1.0","date":"2016-06-08","arxiv_id":"1606.02542","repositories_listed":0,"syntology":null},{"url":null,"slug":"multilingual-visual-sentiment-concept","title":"Multilingual Visual Sentiment Concept Matching","date":"2016-06-07","arxiv_id":"1606.02276","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-robustness-of-kernel-clustering","title":"On Robustness of Kernel Clustering","date":"2016-06-06","arxiv_id":"1606.01869","repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-multi-robot-spatial-task-allocation","title":"Effective Multi-Robot Spatial Task Allocation using Model Approximations","date":"2016-06-04","arxiv_id":"1606.01380","repositories_listed":0,"syntology":null},{"url":null,"slug":"ecmdd-evidential-c-medoids-clustering-with","title":"ECMdd: Evidential c-medoids clustering with multiple prototypes","date":"2016-06-03","arxiv_id":"1606.01113","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-ensemble-clustering-using-probability","title":"Robust Ensemble Clustering Using Probability Trajectories","date":"2016-06-03","arxiv_id":"1606.01160","repositories_listed":0,"syntology":null},{"url":null,"slug":"3d-action-recognition-from-novel-viewpoints","title":"3D Action Recognition From Novel Viewpoints","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-low-rank-approximation-approach-to-learning","title":"A Low-Rank Approximation Approach to Learning Joint Embeddings of News Stories and Images for Timeline Summarization","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"an-end-to-end-approach-to-learning-semantic","title":"An End-to-end Approach to Learning Semantic Frames with Feedforward Neural Network","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"black-holes-and-white-rabbits-metaphor","title":"Black Holes and White Rabbits: Metaphor Identification with Visual Features","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"closed-form-training-of-mahalanobis-distance","title":"Closed-Form Training of Mahalanobis Distance for Supervised Clustering","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-for-simultaneous-extraction-of","title":"Clustering for Simultaneous Extraction of Aspects and Features from Reviews","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-paraphrases-by-word-sense","title":"Clustering Paraphrases by Word Sense","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-with-phylogenetic-tools-in","title":"Clustering with phylogenetic tools in astrophysics","date":"2016-06-01","arxiv_id":"1606.00235","repositories_listed":0,"syntology":null},{"url":null,"slug":"detecting-smart-spammers-on-social-network-a-1","title":"Detecting ``Smart'' Spammers on Social Network: A Topic Model Approach","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"discovering-phase-transitions-with","title":"Discovering Phase Transitions with Unsupervised Learning","date":"2016-06-01","arxiv_id":"1606.00318","repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminatively-embedded-k-means-for-multi","title":"Discriminatively Embedded K-Means for Multi-View Clustering","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"entity-balanced-gaussian-plsa-for-automated","title":"Entity-balanced Gaussian pLSA for Automated Comparison","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-singular-features","title":"Finding Singular Features","date":"2016-06-01","arxiv_id":"1606.00265","repositories_listed":0,"syntology":null},{"url":null,"slug":"harnessing-object-and-scene-semantics-for","title":"Harnessing Object and Scene Semantics for Large-Scale Video Understanding","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"incremental-object-discovery-in-time-varying","title":"Incremental Object Discovery in Time-Varying Image Collections","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"instance-level-video-segmentation-from-object","title":"Instance-Level Video Segmentation From Object Tracks","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"manifold-slic-a-fast-method-to-compute","title":"Manifold SLIC: A Fast Method to Compute Content-Sensitive Superpixels","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multiple-model-fitting-as-a-set-coverage","title":"Multiple Model Fitting as a Set Coverage Problem","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"proximal-riemannian-pursuit-for-large-scale","title":"Proximal Riemannian Pursuit for Large-Scale Trace-Norm Minimization","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"red-sfa-relation-discovery-based-slow-feature","title":"ReD-SFA: Relation Discovery Based Slow Feature Analysis for Trajectory Clustering","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"scaling-up-word-clustering","title":"Scaling Up Word Clustering","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"search-space-pruning-a-simple-solution-for","title":"Search Space Pruning: A Simple Solution for Better Coreference Resolvers","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"short-communication-on-quist-a-quick","title":"Short Communication on QUIST: A Quick Clustering Algorithm","date":"2016-06-01","arxiv_id":"1606.00398","repositories_listed":0,"syntology":null},{"url":null,"slug":"simultaneous-clustering-and-model-selection-1","title":"Simultaneous Clustering and Model Selection for Tensor Affinities","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"subspace-clustering-with-priors-via-sparse","title":"Subspace Clustering With Priors via Sparse Quadratically Constrained Quadratic Programming","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-sensitivity-of-topic-coherence-evaluation","title":"The Sensitivity of Topic Coherence Evaluation to Topic Cardinality","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-learning-of-discriminative","title":"Unsupervised Learning of Discriminative Attributes and Visual Representations","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"word-sense-clustering-and-clusterability","title":"Word Sense Clustering and Clusterability","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"significant-competitive-dominance-in-mid","title":"A signal of competitive dominance in mid-latitude herbaceous plant communities","date":"2016-05-31","arxiv_id":"1605.09682","repositories_listed":0,"syntology":null},{"url":null,"slug":"image-segmentation-based-on-the-hybrid-total","title":"Image segmentation based on the hybrid total variation model and the K-means clustering strategy","date":"2016-05-30","arxiv_id":"1605.09116","repositories_listed":0,"syntology":null},{"url":null,"slug":"k2-means-for-fast-and-accurate-large-scale","title":"k2-means for fast and accurate large scale clustering","date":"2016-05-30","arxiv_id":"1605.09299","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-discovery-of-el-nino-using","title":"Unsupervised Discovery of El Nino Using Causal Feature Learning on Microlevel Climate Data","date":"2016-05-30","arxiv_id":"1605.09370","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-zero-shot-learning-by-a","title":"Semi-supervised Zero-Shot Learning by a Clustering-based Approach","date":"2016-05-29","arxiv_id":"1605.09016","repositories_listed":0,"syntology":null},{"url":null,"slug":"achieving-stable-subspace-clustering-by-post","title":"Achieving stable subspace clustering by post-processing generic clustering results","date":"2016-05-27","arxiv_id":"1605.08680","repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-visual-exemplars-of-unseen-classes","title":"Predicting Visual Exemplars of Unseen Classes for Zero-Shot Learning","date":"2016-05-26","arxiv_id":"1605.08151","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-rapid-pattern-recognition-method-for","title":"A Rapid Pattern-Recognition Method for Driving Types Using Clustering-Based Support Vector Machines","date":"2016-05-22","arxiv_id":"1605.06742","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-from-hidden-traits-joint-factor","title":"Learning From Hidden Traits: Joint Factor Analysis and Latent Clustering","date":"2016-05-21","arxiv_id":"1605.06711","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-randomized-semi-supervised-clustering","title":"Fast Randomized Semi-Supervised Clustering","date":"2016-05-20","arxiv_id":"1605.06422","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-communities-obstruct-global-consensus","title":"Local communities obstruct global consensus: Naming game on multi-local-world networks","date":"2016-05-20","arxiv_id":"1605.06304","repositories_listed":0,"syntology":null},{"url":null,"slug":"amsom-adaptive-moving-self-organizing-map-for","title":"AMSOM: Adaptive Moving Self-organizing Map for Clustering and Visualization","date":"2016-05-19","arxiv_id":"1605.06047","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-clustering-in-face-similarity","title":"Hierarchical Clustering in Face Similarity Score Space","date":"2016-05-19","arxiv_id":"1605.06052","repositories_listed":0,"syntology":null},{"url":null,"slug":"locally-weighted-ensemble-clustering","title":"Locally Weighted Ensemble Clustering","date":"2016-05-17","arxiv_id":"1605.05011","repositories_listed":0,"syntology":null},{"url":null,"slug":"option-discovery-in-hierarchical","title":"Option Discovery in Hierarchical Reinforcement Learning using Spatio-Temporal Clustering","date":"2016-05-17","arxiv_id":"1605.05359","repositories_listed":0,"syntology":null},{"url":null,"slug":"orthogonal-symmetric-non-negative-matrix","title":"Orthogonal symmetric non-negative matrix factorization under the stochastic block model","date":"2016-05-17","arxiv_id":"1605.05349","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-constant-factor-bi-criteria-approximation","title":"A Constant-Factor Bi-Criteria Approximation Guarantee for $k$-means++","date":"2016-05-16","arxiv_id":"1605.04986","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-scale-analysis-of-counseling","title":"Large-scale Analysis of Counseling Conversations: An Application of Natural Language Processing to Mental Health","date":"2016-05-14","arxiv_id":"1605.04462","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-manifold-distance-measure-for-visual","title":"A New Manifold Distance Measure for Visual Object Categorization","date":"2016-05-12","arxiv_id":"1605.03865","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-and-globally-optimal-manhattan-frame","title":"Robust and Globally Optimal Manhattan Frame Estimation in Near Real Time","date":"2016-05-12","arxiv_id":"1605.03730","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-efficient-k-means-algorithm-for-massive","title":"An efficient K-means algorithm for Massive Data","date":"2016-05-10","arxiv_id":"1605.02989","repositories_listed":0,"syntology":null}],"record_sha256":"e182a10565b04e1e2140dcddb2eb0f40ea0e088ca899a80ffcfc9b1289bb5d10","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}