Abstract
We consider the problem of 2-partitioning a finite set of points in Euclidean space minimizing the sum of squared distances between cluster elements and the corresponding cluster centers. It is assumed that the center of one of the desired clusters is the origin, while the center of the other cluster is unknown and determined as the mean value over cluster elements. In this work, we present a short survey on the results for this problem.
Original language | English |
---|---|
Title of host publication | Proceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 91-93 |
Number of pages | 3 |
ISBN (Electronic) | 9781538615966 |
DOIs | |
Publication status | Published - 14 Nov 2017 |
Event | 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017 - Novosibirsk, Russian Federation Duration: 18 Sep 2017 → 22 Sep 2017 |
Conference
Conference | 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017 |
---|---|
Country | Russian Federation |
City | Novosibirsk |
Period | 18.09.2017 → 22.09.2017 |
Keywords
- Clusterization
- Data analysis
- Efficient algorithms with performance guarantees
- Intractable problems
- Pattern recognition