Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Greedy Strategy Works for $k$-Center Clustering with Outliers and
  Coreset Construction   We study the problem of $k$-center clustering with outliers in arbitrary
metrics and Euclidean space. Though a number of methods have been developed in
the past decades, it is still quite challenging to design quality guaranteed
algorithm with low complexity for this problem. Our idea is inspired by the
greedy method, Gonzalez's algorithm, for solving the problem of ordinary
$k$-center clustering. Based on some novel observations, we show that this
greedy strategy actually can handle $k$-center clustering with outliers
efficiently, in terms of clustering quality and time complexity. We further
show that the greedy approach yields small coreset for the problem in doubling
metrics, so as to reduce the time complexity significantly. Our algorithms are
easy to implement in practice. We test our method on both synthetic and real
datasets. The experimental results suggest that our algorithms can achieve near
optimal solutions and yield lower running times comparing with existing
methods.

29
The categories of this paper are: funct-an
35
The categories of this paper are: mtrl-th
5
The categories of this paper are: gr-qc
13
The categories of this paper are: quant-ph
32
The categories of this paper are: atom-ph
8
The categories of this paper are: hep-ex
33
The categories of this paper are: plasm-ph
11
The categories of this paper are: hep-lat
31
The categories of this paper are: ao-sci
37
The categories of this paper are: supr-con
15
The categories of this paper are: nucl-ex
28
The categories of this paper are: alg-geom
16
The categories of this paper are: stat
19
The categories of this paper are: eess
14
The categories of this paper are: math-ph
34
The categories of this paper are: chem-ph