Name
Abstract | ||
|---|---|---|
The Labeled Correlation Clustering problem, a variant of Correlation Clustering problem, is defined and studied in this paper. It is shown that the problem is NP-complete, and an approximation algorithm is given. For the case when a parameter is fixed, a better approximation algorithm is proposed, and, for a simple fragment of that problem, a PTime algorithm is introduced. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s10878-013-9607-y | J. Comb. Optim. |
Keywords | Field | DocType |
Labeled correlation clustering,Algorithm,Computational complexity | k-medians clustering,Canopy clustering algorithm,Mathematical optimization,CURE data clustering algorithm,Clustering high-dimensional data,Combinatorics,Correlation clustering,Determining the number of clusters in a data set,Algorithm,Biclustering,Cluster analysis,Mathematics | Journal |
Volume | Issue | ISSN |
29 | 2 | 1382-6905 |
Citations | PageRank | References |
1 | 0.35 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xianmin Liu | 1 | 12 | 5.00 |
| Jianzhong Li | 2 | 3196 | 304.46 |