Some algorithms with guaranteed accuracy for 2-clustering problems with given center of one cluster

Alexander Kel'Manov, Vladimir Khandeev

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

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 languageEnglish
Title of host publicationProceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages91-93
Number of pages3
ISBN (Electronic)9781538615966
DOIs
Publication statusPublished - 14 Nov 2017
Event2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017 - Novosibirsk, Russian Federation
Duration: 18 Sep 201722 Sep 2017

Conference

Conference2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017
CountryRussian Federation
CityNovosibirsk
Period18.09.201722.09.2017

Keywords

  • Clusterization
  • Data analysis
  • Efficient algorithms with performance guarantees
  • Intractable problems
  • Pattern recognition

Fingerprint Dive into the research topics of 'Some algorithms with guaranteed accuracy for 2-clustering problems with given center of one cluster'. Together they form a unique fingerprint.

Cite this