• DOI:10.1137/1.9781611975031.27
Corpus ID: 6567675

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

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed