{"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/100","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":100,"pages_in_order":108,"rows_per_page":100,"rows":[9901,10000],"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/99","next":"/task/clustering/papers/101","papers":[{"url":null,"slug":"image-classification-by-visual-bag-of-words","title":"Image classification by visual bag-of-words refinement and reduction","date":"2015-01-18","arxiv_id":"1501.04292","repositories_listed":0,"syntology":null},{"url":null,"slug":"mathematical-language-processing-automatic","title":"Mathematical Language Processing: Automatic Grading and Feedback for Open Response Mathematical Questions","date":"2015-01-18","arxiv_id":"1501.04346","repositories_listed":0,"syntology":null},{"url":null,"slug":"screen-content-image-segmentation-using-least","title":"Screen Content Image Segmentation Using Least Absolute Deviation Fitting","date":"2015-01-15","arxiv_id":"1501.03755","repositories_listed":0,"syntology":null},{"url":null,"slug":"dirichlet-process-parsimonious-mixtures-for","title":"Dirichlet Process Parsimonious Mixtures for clustering","date":"2015-01-14","arxiv_id":"1501.03347","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-from-multiple-sources-for-video","title":"Learning from Multiple Sources for Video Summarisation","date":"2015-01-13","arxiv_id":"1501.03069","repositories_listed":0,"syntology":null},{"url":null,"slug":"autodetection-and-classification-of-hidden","title":"Autodetection and Classification of Hidden Cultural City Districts from Yelp Reviews","date":"2015-01-12","arxiv_id":"1501.02527","repositories_listed":0,"syntology":null},{"url":null,"slug":"belief-hierarchical-clustering","title":"Belief Hierarchical Clustering","date":"2015-01-12","arxiv_id":"1501.02560","repositories_listed":0,"syntology":null},{"url":null,"slug":"scaling-up-empirical-risk-minimization","title":"Scaling-up Empirical Risk Minimization: Optimization of Incomplete U-statistics","date":"2015-01-12","arxiv_id":"1501.02629","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-metric-learning-for-symmetric","title":"Riemannian Metric Learning for Symmetric Positive Definite Matrices","date":"2015-01-10","arxiv_id":"1501.02393","repositories_listed":0,"syntology":null},{"url":null,"slug":"less-is-more-building-selective-anomaly","title":"Less is More: Building Selective Anomaly Ensembles","date":"2015-01-08","arxiv_id":"1501.01924","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-autoencoders-for-dimensionality","title":"Deep Autoencoders for Dimensionality Reduction of High-Content Screening Data","date":"2015-01-07","arxiv_id":"1501.01348","repositories_listed":0,"syntology":null},{"url":null,"slug":"median-evidential-c-means-algorithm-and-its","title":"Median evidential c-means algorithm and its application to community detection","date":"2015-01-07","arxiv_id":"1501.01460","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-study-on-clustering-for-clustering-based","title":"A Study on Clustering for Clustering Based Image De-Noising","date":"2015-01-06","arxiv_id":"1501.01106","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-trajectory-behavior-a-motion","title":"Understanding Trajectory Behavior: A Motion Pattern Approach","date":"2015-01-04","arxiv_id":"1501.00614","repositories_listed":0,"syntology":null},{"url":null,"slug":"computational-feasibility-of-clustering-under","title":"Computational Feasibility of Clustering under Clusterability Assumptions","date":"2015-01-02","arxiv_id":"1501.00437","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficiently-discovering-frequent-motifs-in","title":"Efficiently Discovering Frequent Motifs in Large-scale Sensor Data","date":"2015-01-02","arxiv_id":"1501.00405","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-document-co-reference-resolution-using","title":"Cross-Document Co-Reference Resolution using Sample-Based Clustering with Knowledge Enrichment","date":"2015-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"accams-additive-co-clustering-to-approximate","title":"ACCAMS: Additive Co-Clustering to Approximate Matrices Succinctly","date":"2014-12-31","arxiv_id":"1501.00199","repositories_listed":0,"syntology":null},{"url":null,"slug":"maximum-margin-clustering-for-state","title":"Maximum Margin Clustering for State Decomposition of Metastable Systems","date":"2014-12-31","arxiv_id":"1501.00125","repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminative-clustering-with-relative","title":"Discriminative Clustering with Relative Constraints","date":"2014-12-30","arxiv_id":"1501.00037","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-effective-semi-supervised-divisive","title":"An Effective Semi-supervised Divisive Clustering Algorithm","date":"2014-12-24","arxiv_id":"1412.7625","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-computational-theory-of-intelligence","title":"The Computational Theory of Intelligence: Information Entropy","date":"2014-12-24","arxiv_id":"1412.7978","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximate-subspace-sparse-recovery-with","title":"Approximate Subspace-Sparse Recovery with Corrupted Data via Constrained $\\ell_1$-Minimization","date":"2014-12-23","arxiv_id":"1412.7260","repositories_listed":0,"syntology":null},{"url":null,"slug":"fusing-color-and-texture-cues-to-categorize","title":"Fusing Color and Texture Cues to Categorize the Fruit Diseases from Images","date":"2014-12-23","arxiv_id":"1412.7277","repositories_listed":0,"syntology":null},{"url":null,"slug":"audio-source-separation-using-a-deep","title":"Audio Source Separation Using a Deep Autoencoder","date":"2014-12-22","arxiv_id":"1412.7193","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-multi-way-data-a-novel-algebraic","title":"Clustering multi-way data: a novel algebraic approach","date":"2014-12-22","arxiv_id":"1412.7056","repositories_listed":0,"syntology":null},{"url":null,"slug":"bi-directional-shape-correspondences-bsc-a","title":"Bi-directional Shape Correspondences (BSC): A Novel Technique for 2-d Shape Warping in Quadratic Time?","date":"2014-12-21","arxiv_id":"1412.6759","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-the-nonlinear-geometry-of-high","title":"Learning the nonlinear geometry of high-dimensional data: Models and algorithms","date":"2014-12-21","arxiv_id":"1412.6808","repositories_listed":0,"syntology":null},{"url":null,"slug":"microbial-community-pattern-detection-in","title":"Microbial community pattern detection in human body habitats via ensemble clustering framework","date":"2014-12-21","arxiv_id":"1412.7384","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithmic-robustness-for-learning-via-good","title":"Algorithmic Robustness for Learning via $(ε, γ, τ)$-Good Similarity Functions","date":"2014-12-19","arxiv_id":"1412.6452","repositories_listed":0,"syntology":null},{"url":null,"slug":"n-gram-based-low-dimensional-representation","title":"N-gram-Based Low-Dimensional Representation for Document Classification","date":"2014-12-19","arxiv_id":"1412.6277","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-algorithm-for-online-k-means-clustering","title":"An Algorithm for Online K-Means Clustering","date":"2014-12-18","arxiv_id":"1412.5721","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressing-deep-convolutional-networks-using","title":"Compressing Deep Convolutional Networks using Vector Quantization","date":"2014-12-18","arxiv_id":"1412.6115","repositories_listed":0,"syntology":null},{"url":null,"slug":"gene-similarity-based-approaches-for","title":"Gene Similarity-based Approaches for Determining Core-Genes of Chloroplasts","date":"2014-12-17","arxiv_id":"1412.5323","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-a-constructive-multilayer-perceptron","title":"Towards a constructive multilayer perceptron for regression task using non-parametric clustering. A case study of Photo-Z redshift reconstruction","date":"2014-12-17","arxiv_id":"1412.5513","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-robust-regression-approach-for","title":"A Robust Regression Approach for Background/Foreground Segmentation","date":"2014-12-16","arxiv_id":"1412.5126","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-framework-for-shape-analysis-via-hilbert","title":"A Framework for Shape Analysis via Hilbert Space Embedding","date":"2014-12-13","arxiv_id":"1412.4174","repositories_listed":0,"syntology":null},{"url":null,"slug":"oriented-edge-forests-for-boundary-detection","title":"Oriented Edge Forests for Boundary Detection","date":"2014-12-13","arxiv_id":"1412.4181","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-stochastic-gradient-descent-on-the","title":"Adaptive Stochastic Gradient Descent on the Grassmannian for Robust Low-Rank Subspace Recovery and Clustering","date":"2014-12-12","arxiv_id":"1412.4044","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-adaptive-possibilistic-clustering","title":"A Novel Adaptive Possibilistic Clustering Algorithm","date":"2014-12-11","arxiv_id":"1412.3613","repositories_listed":0,"syntology":null},{"url":null,"slug":"detecting-overlapping-communities-in-networks","title":"Detecting Overlapping Communities in Networks Using Spectral Methods","date":"2014-12-10","arxiv_id":"1412.3432","repositories_listed":0,"syntology":null},{"url":null,"slug":"circumventing-the-curse-of-dimensionality-in","title":"Circumventing the Curse of Dimensionality in Prediction: Causal Rate-Distortion for Infinite-Order Markov Processes","date":"2014-12-09","arxiv_id":"1412.2859","repositories_listed":0,"syntology":null},{"url":null,"slug":"fuzzy-c-ordered-means-clustering","title":"Fuzzy c-ordered-means clustering","date":"2014-12-07","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"nearest-descent-in-tree-and-clustering","title":"Nearest Descent, In-Tree, and Clustering","date":"2014-12-07","arxiv_id":"1412.5902","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-parallel-sampling-based-clustering","title":"A parallel sampling based clustering","date":"2014-12-05","arxiv_id":"1412.1947","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-iterative-step-function-estimator-for","title":"An iterative step-function estimator for graphons","date":"2014-12-05","arxiv_id":"1412.2129","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-many-communities-are-there","title":"How Many Communities Are There?","date":"2014-12-04","arxiv_id":"1412.1684","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-exchange-and-learning-dynamics","title":"Information Exchange and Learning Dynamics over Weakly-Connected Adaptive Networks","date":"2014-12-04","arxiv_id":"1412.1523","repositories_listed":0,"syntology":null},{"url":null,"slug":"iterative-subsampling-in-solution-path","title":"Iterative Subsampling in Solution Path Clustering of Noisy Big Data","date":"2014-12-04","arxiv_id":"1412.1559","repositories_listed":0,"syntology":null},{"url":null,"slug":"tiered-clustering-to-improve-lexical","title":"Tiered Clustering to Improve Lexical Entailment","date":"2014-12-02","arxiv_id":"1412.0751","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximating-hierarchical-mv-sets-for","title":"Approximating Hierarchical MV-sets for Hierarchical Clustering","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"biclustering-using-message-passing","title":"Biclustering Using Message Passing","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"clustered-factor-analysis-of-multineuronal","title":"Clustered factor analysis of multineuronal spike data","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-from-labels-and-time-varying","title":"Clustering from Labels and Time-Varying Graphs","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"convex-optimization-procedure-for-clustering","title":"Convex Optimization Procedure for Clustering: Theoretical Revisit","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dependent-nonparametric-trees-for-dynamic","title":"Dependent nonparametric trees for dynamic hierarchical clustering","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-balanced-clustering-via-mapping","title":"Distributed Balanced Clustering via Mapping Coresets","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-multivariate-spatio-temporal-analysis","title":"Fast Multivariate Spatio-temporal Analysis via Low Rank Tensor Learning","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-clustering-with-missing-data-convex","title":"Graph Clustering With Missing Data: Convex Algorithms and Analysis","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"grouping-based-low-rank-trajectory-completion","title":"Grouping-Based Low-Rank Trajectory Completion and 3D Reconstruction","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-scale-spectral-decomposition-of-massive","title":"Multi-Scale Spectral Decomposition of Massive Graphs","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-a-theory-of-nonparametric-pairwise","title":"On a Theory of Nonparametric Pairwise Similarity for Clustering: Connecting Clustering to Classification","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-integrated-clustering-and-outlier","title":"On Integrated Clustering and Outlier Detection","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-relations-of-lfps-neural-spike-trains","title":"On the relations of LFPs & Neural Spike Trains","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-bayesian-max-margin-clustering","title":"Robust Bayesian Max-Margin Clustering","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"streaming-memory-limited-algorithms-for","title":"Streaming, Memory Limited Algorithms for Community Detection","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"streaming-variational-inference-for-bayesian","title":"Streaming Variational Inference for Bayesian Nonparametric Mixture Models","date":"2014-12-01","arxiv_id":"1412.0694","repositories_listed":0,"syntology":null},{"url":null,"slug":"tight-continuous-relaxation-of-the-balanced-k-1","title":"Tight Continuous Relaxation of the Balanced k-Cut Problem","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-modal-learning-via-pairwise-constraints","title":"Cross-Modal Learning via Pairwise Constraints","date":"2014-11-28","arxiv_id":"1411.7798","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-with-algebraic-invariances-and-the","title":"Learning with Algebraic Invariances, and the Invariant Kernel Trick","date":"2014-11-28","arxiv_id":"1411.7817","repositories_listed":0,"syntology":null},{"url":null,"slug":"features-in-concert-discriminative-feature","title":"Features in Concert: Discriminative Feature Selection meets Unsupervised Clustering","date":"2014-11-27","arxiv_id":"1411.7714","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-sensitive-indices-for-comparing","title":"Graph Sensitive Indices for Comparing Clusterings","date":"2014-11-27","arxiv_id":"1411.7582","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-scale-binary-quadratic-optimization","title":"Large-scale Binary Quadratic Optimization Using Semidefinite Relaxation and Applications","date":"2014-11-27","arxiv_id":"1411.7564","repositories_listed":0,"syntology":null},{"url":null,"slug":"consistency-of-cheeger-and-ratio-graph-cuts","title":"Consistency of Cheeger and Ratio Graph Cuts","date":"2014-11-24","arxiv_id":"1411.6590","repositories_listed":0,"syntology":null},{"url":null,"slug":"noise-benefits-in-expectation-maximization","title":"Noise Benefits in Expectation-Maximization Algorithms","date":"2014-11-24","arxiv_id":"1411.6622","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-convex-formulation-for-spectral-shrunk","title":"A Convex Formulation for Spectral Shrunk Clustering","date":"2014-11-23","arxiv_id":"1411.6308","repositories_listed":0,"syntology":null},{"url":null,"slug":"balanced-k-means-and-min-cut-clustering","title":"Balanced k-Means and Min-Cut Clustering","date":"2014-11-23","arxiv_id":"1411.6235","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-spectral-clustering-via-embedded","title":"Improved Spectral Clustering via Embedded Label Propagation","date":"2014-11-23","arxiv_id":"1411.6241","repositories_listed":0,"syntology":null},{"url":null,"slug":"pu-learning-for-matrix-completion","title":"PU Learning for Matrix Completion","date":"2014-11-22","arxiv_id":"1411.6081","repositories_listed":0,"syntology":null},{"url":null,"slug":"fuzzy-adaptive-resonance-theory-diffusion","title":"Fuzzy Adaptive Resonance Theory, Diffusion Maps and their applications to Clustering and Biclustering","date":"2014-11-21","arxiv_id":"1411.5737","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-evolving-data-using-kernel-based","title":"Clustering evolving data using kernel-based methods","date":"2014-11-20","arxiv_id":"1411.5988","repositories_listed":0,"syntology":null},{"url":null,"slug":"anisotropic-agglomerative-adaptive-mean-shift","title":"Anisotropic Agglomerative Adaptive Mean-Shift","date":"2014-11-15","arxiv_id":"1411.4102","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-gaussian-measures-for-efficient","title":"Using Gaussian Measures for Efficient Constraint Based Clustering","date":"2014-11-12","arxiv_id":"1411.3302","repositories_listed":0,"syntology":null},{"url":null,"slug":"supervised-classification-of-flow-cytometric","title":"Supervised Classification of Flow Cytometric Samples via the Joint Clustering and Matching (JCM) Procedure","date":"2014-11-11","arxiv_id":"1411.2820","repositories_listed":0,"syntology":null},{"url":null,"slug":"covariate-assisted-spectral-clustering","title":"Covariate-assisted spectral clustering","date":"2014-11-08","arxiv_id":"1411.2158","repositories_listed":0,"syntology":null},{"url":null,"slug":"partitioning-well-clustered-graphs-spectral","title":"Partitioning Well-Clustered Graphs: Spectral Clustering Works!","date":"2014-11-07","arxiv_id":"1411.2021","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-generic-sample-splitting-approach-for","title":"A Generic Sample Splitting Approach for Refined Community Recovery in Stochastic Block Models","date":"2014-11-06","arxiv_id":"1411.1469","repositories_listed":0,"syntology":null},{"url":null,"slug":"eigenvectors-of-orthogonally-decomposable","title":"Eigenvectors of Orthogonally Decomposable Functions","date":"2014-11-05","arxiv_id":"1411.1420","repositories_listed":0,"syntology":null},{"url":null,"slug":"simple-approximate-map-inference-for","title":"Simple approximate MAP Inference for Dirichlet processes","date":"2014-11-04","arxiv_id":"1411.0939","repositories_listed":0,"syntology":null},{"url":null,"slug":"canonicalizing-open-knowledge-bases","title":"Canonicalizing Open Knowledge Bases","date":"2014-11-03","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-memes-in-social-media-streams","title":"Clustering memes in social media streams","date":"2014-11-03","arxiv_id":"1411.0652","repositories_listed":0,"syntology":null},{"url":null,"slug":"correlation-clustering-with-constrained","title":"Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds","date":"2014-11-03","arxiv_id":"1411.0547","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-submodular-maximization","title":"Distributed Submodular Maximization","date":"2014-11-03","arxiv_id":"1411.0541","repositories_listed":0,"syntology":null},{"url":null,"slug":"multivariate-response-and-parsimony-for","title":"Multivariate response and parsimony for Gaussian cluster-weighted models","date":"2014-11-03","arxiv_id":"1411.0560","repositories_listed":0,"syntology":null},{"url":null,"slug":"noisy-matrix-completion-under-sparse-factor","title":"Noisy Matrix Completion under Sparse Factor Models","date":"2014-11-02","arxiv_id":"1411.0282","repositories_listed":0,"syntology":null},{"url":null,"slug":"synchronization-clustering-based-on-a","title":"Synchronization Clustering based on a Linearized Version of Vicsek model","date":"2014-11-02","arxiv_id":"1411.0189","repositories_listed":0,"syntology":null},{"url":null,"slug":"greedy-subspace-clustering","title":"Greedy Subspace Clustering","date":"2014-10-31","arxiv_id":"1410.8864","repositories_listed":0,"syntology":null},{"url":null,"slug":"symmetric-low-rank-representation-for","title":"Symmetric low-rank representation for subspace clustering","date":"2014-10-31","arxiv_id":"1410.8618","repositories_listed":0,"syntology":null},{"url":null,"slug":"power-law-graph-cuts","title":"Power-Law Graph Cuts","date":"2014-10-29","arxiv_id":"1411.1971","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-method-for-context-based-adaptive-qrs","title":"A method for context-based adaptive QRS clustering in real-time","date":"2014-10-27","arxiv_id":"1410.7211","repositories_listed":0,"syntology":null}],"record_sha256":"8fae3b1116705fd6155fa6cf2ffeedc2f1d1a43378ca6acf2d96188912170a59","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}