Article View: gwene.acm.algorithms.transactions
Article #419Approximation Schemes for Clustering with Outliers
From: unknown
Date: Mon, 18 Feb 2019 01:00
Date: Mon, 18 Feb 2019 01:00
1 lines
819 bytes
819 bytes
Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour<br /><br />Clustering problems are well studied in a variety of fields, such as data science, operations research, and computer science. Such problems include variants of center 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. For instance, some points may arise from noise in a dataset or one might be willing to discard a certain fraction of the points to avoid incurring unnecessary overhead in the cost of a clustering solution. We study clustering problems with outliers. More specifically, we look at uncapacitated facility location (UFL), k-median, and k-means. <p><a href="http://dl.acm.org/citation.cfm?id301446">Link</a>
Message-ID:
<x1-l8v0vyV1njxTdqDOUYL/UhpXdAs@gwene.org>
Path:
gwene.pugleaf.net!archive.newsdeef.eu!archive!g.newsdeef.eu!news.gmane.org!.POSTED.blaine.gmane.org!not-for-mail