Finding Low Error Clusterings

No abstract is available for this paper.

• Publication year

  2009

• Venue

  Annual Conference Computational Learning Theory

• Publication date

  2009-12-01

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Pattern Classification

  2021cited by this paper
• Pattern Classification

  2012cited by this paper
• Approximate clustering without the approximation

  2009cited by this paper
• Which Data Sets are ‘Clusterable’? – A Theoretical Study of Clusterability

  2008cited by this paper
• A discriminative framework for clustering via similarity functions

  2008cited by this paper
• Stability of k -Means Clustering

  2007cited by this paper
• Small Space Representations for Metric Min-sum k-Clustering and Their Applications

  2007influential reference
• A Sober Look at Clustering Stability

  2006cited by this paper
• On Spectral Learning of Mixtures of Distributions

  2005cited by this paper
• Error bounds for correlation clustering

  2005cited by this paper
• Comparing clusterings: an axiomatic view

  2005cited by this paper
• The Spectral Method for General Mixture Models

  2005cited by this paper
• Sublinear-Time Approximation for Clustering Via Random Sampling

  2004cited by this paper
• Local Search Heuristics for k-Median and Facility Location Problems

  2004cited by this paper
• A simple linear time (1 + /spl epsiv/)-approximation algorithm for k-means clustering in any dimensions

  2004cited by this paper
• Expander flows, geometric embeddings and graph partitioning

  2004cited by this paper
• A spectral algorithm for learning mixture models

  2004cited by this paper
• Clustering with qualitative information

  2003influential reference
• Approximation schemes for clustering problems

  2003cited by this paper
• Comparing Clusterings by the Variation of Information

  2003cited by this paper
• A new greedy approach for facility location problems

  2002cited by this paper
• An Impossibility Theorem for Clustering

  2002cited by this paper
• Correlation Clustering

  2002influential reference
• Sublinear time approximate clustering

  2001cited by this paper
• Approximating min-sum k-clustering in metric spaces

  2001cited by this paper
• Learning mixtures of arbitrary gaussians

  2001cited by this paper
• Clustering for edge-cost minimization (extended abstract)

  2000cited by this paper
• Testing of clustering

  2000cited by this paper
• A constant-factor approximation algorithm for the k-median problem (extended abstract)

  1999cited by this paper
• Sublinear time algorithms for metric space problems

  1999cited by this paper
• Learning mixtures of Gaussians

  1999cited by this paper
• A Probabilistic Theory of Pattern Recognition

  1996cited by this paper

• On Approximability of ℓ22 Min-Sum Clustering

  2024cites this paper
• Sublinear Time Algorithms for Several Geometric Optimization (With Outliers) Problems In Machine Learning

  2023cites this paper
• New Aspects of Beyond Worst-Case Analysis

  2021cites this paper
• Stability Yields Sublinear Time Algorithms for Geometric Optimization in Machine Learning

  2021cites this paper
• Min-Sum Clustering (with Outliers)

  2020cites this paper
• Graph construction with condition-based weights for spectral clustering of hierarchical datasets

  2020cites this paper
• Minimum Enclosing Ball Revisited: Stability and Sub-linear Time Algorithms

  2019cites this paper
• One Size Fits All : Effectiveness of Local Search on Structured Data

  2017cites this paper
• Statistical Cost Sharing

  2017cites this paper
• On the Local Structure of Stable Clustering Instances

  2017cites this paper
• Robust Communication-Optimal Distributed Clustering Algorithms

  2017cites this paper
• Scalable Algorithms for Data and Network Analysis

  2016cites this paper
• L10: Spectral Clustering

  2016cites this paper
• A Unified Framework for Clustering Constrained Data Without Locality Property

  2015influential citation
• Handbook of Cluster Analysis

  2015cites this paper
• k-center Clustering under Perturbation Resilience

  2015cites this paper
• How Hard is Inference for Structured Prediction?

  2015cites this paper
• Correlation Clustering with Noisy Partial Information

  2014cites this paper
• A Single-Pass Algorithm for Efficiently Recovering Sparse Cluster Centers of High-dimensional Data

  2014cites this paper
• Tight Error Bounds for Structured Prediction

  2014cites this paper
• Beyond Worst-Case Analysis in Privacy and Clustering: Exploiting Explicit and Implicit Assumptions

  2013cites this paper
• Clustering under approximation stability

  2013cites this paper
• Approximation Algorithms and New Models for Clustering and Learning

  2013influential citation
• Why Do We Want a Good Ratio Anyway ? Approximation Stability and Proxy Objectives Scribe : Avrim

  2011cites this paper
• Why Do We Want a Good Ratio Anyway? Approximation Stability and Proxy Objectives

  2011cites this paper
• Proposal : Approximation Algorithms and New Models for Clustering and Learning

  2011cites this paper
• Clustering Under Natural Stability Assumptions

  2010cites this paper
• Clustering with or without the approximation

  2010cites this paper
• Approximate Nash Equilibria under Stability Conditions

  2010cites this paper
• Stability Yields a PTAS for k-Median and k-Means Clustering

  2010cites this paper
• Thoughts on clustering ∗

  2009cites this paper
• Agnostic Clustering

  2009cites this paper
• Approximate clustering without the approximation

  2009influential citation
• Better Guarantees for Sparsest Cut Clustering

  2009cites this paper
• Clustering via Similarity Functions : Theoretical Foundations and Algorithms ∗

  2008cites this paper