Approximation Schemes for Clustering with Outliers

@inproceedings{Friggstad2018ApproximationSF,
  title={Approximation Schemes for Clustering with Outliers},
  author={Zachary Friggstad and Kamyar Khodamoradi and M. Rezapour and M. Salavatipour},
  booktitle={SODA},
  year={2018}
}
  • Zachary Friggstad, Kamyar Khodamoradi, +1 author M. Salavatipour
  • Published in SODA 2018
  • Computer Science, Mathematics
  • Clustering problems are well-studied in a variety of fields such as data science, operations research, and computer science. Such problems include variants of centre location problems, $k$-median, and $k$-means to name a few. In some cases, not all data points need to be clustered; some may be discarded for various reasons. We study clustering problems with outliers. More specifically, we look at Uncapacitated Facility Location (UFL), $k$-Median, and $k$-Means. In UFL with outliers, we have to… CONTINUE READING
    19 Citations
    Improved Algorithms for Clustering with Outliers
    • 3
    • PDF
    Structural Iterative Rounding for Generalized k-Median Problems
    • PDF
    FPT Approximation for Constrained Metric k-Median/Means
    • PDF
    Robust k-means++
    • PDF
    Near-Linear Time Approximations Schemes for Clustering in Doubling Metrics
    • 8
    • PDF
    Submodular Clustering in Low Dimensions
    • PDF

    References

    SHOWING 1-10 OF 40 REFERENCES
    A local search approximation algorithm for k-means clustering
    • 548
    • Highly Influential
    • PDF
    Local Search Yields a PTAS for k-Means in Doubling Metrics
    • 71
    • PDF
    On Variants of k-means Clustering
    • 23
    • PDF
    Local Search Methods for k-Means with Outliers
    • 50
    • PDF
    Simpler Analyses of Local Search Algorithms for Facility Location
    • 71
    • Highly Influential
    • PDF
    Algorithms on clustering, orienteering, and conflict-free coloring
    • 2
    • Highly Influential
    On coresets for k-means and k-median clustering
    • 426
    Approximation schemes for Euclidean k-medians and related problems
    • 365
    • Highly Influential
    • PDF
    On Approximate Geometric k -Clustering
    • J. Matousek
    • Mathematics, Computer Science
    • Discret. Comput. Geom.
    • 2000
    • 121
    • PDF
    Local search heuristic for k-median and facility location problems
    • 349
    • PDF