An approximation polynomial-time algorithm for a cardinality-weighted 2-clustering problem

We consider the strongly NP-hard problem of partitioning a set of Euclidean points into two clusters so as to minimize the sum over both clusters of the weighted sums of the squared intracluster distances from the elements of the clusters to their centers. The weights of sums are the cardinalities o...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON) S. 94 - 96
Hauptverfasser:	Kel'manov, Alexander, Motkova, Anna
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.09.2017
Schlagworte:	2-approximation polynomial-time algorithm Algorithm design and analysis Approximation algorithms Clustering algorithms Euclidean space Machine learning algorithms NP-hardness Partitioning algorithms Pattern recognition Weighted-clustering
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!