## Abstract

We consider the strongly NP-hard problem of partitioning a finite set of Euclidean points into two clusters so as to minimize the sum (over both clusters) of the weighted sums of the squared intra-cluster distances from the elements of the cluster to its center. The weights of the sums are equal to the cardinalities of the clusters. The center of one of the clusters is given as input, while the center of the other cluster is unknown and is determined as the mean value over all points in this cluster, i.e., as the geometric center (centroid). The version of the problem with constrained cardinalities of the clusters is analyzed. We construct an approximation algorithm for the problem and show that it is a fully polynomial-time approximation scheme (FPTAS) if the space dimension is bounded by a constant.

Original language | English |
---|---|

Pages (from-to) | 17-23 |

Number of pages | 7 |

Journal | Pattern Recognition and Image Analysis |

Volume | 28 |

Issue number | 1 |

DOIs | |

Publication status | Published - 1 Jan 2018 |

## Keywords

- data analysis
- Euclidean space
- fixed space dimension
- FPTAS
- NP-hardness
- weighted 2-clustering