Standard

Some algorithms with guaranteed accuracy for 2-clustering problems with given center of one cluster. / Kel'Manov, Alexander; Khandeev, Vladimir.

Proceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 91-93 8109844.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Harvard

Kel'Manov, A & Khandeev, V 2017, Some algorithms with guaranteed accuracy for 2-clustering problems with given center of one cluster. in Proceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017., 8109844, Institute of Electrical and Electronics Engineers Inc., pp. 91-93, 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017, Novosibirsk, Russian Federation, 18.09.2017. https://doi.org/10.1109/SIBIRCON.2017.8109844

APA

Kel'Manov, A., & Khandeev, V. (2017). Some algorithms with guaranteed accuracy for 2-clustering problems with given center of one cluster. In Proceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017 (pp. 91-93). [8109844] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SIBIRCON.2017.8109844

Vancouver

Kel'Manov A, Khandeev V. Some algorithms with guaranteed accuracy for 2-clustering problems with given center of one cluster. In Proceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017. Institute of Electrical and Electronics Engineers Inc. 2017. p. 91-93. 8109844 doi: 10.1109/SIBIRCON.2017.8109844

Author

Kel'Manov, Alexander ; Khandeev, Vladimir. / Some algorithms with guaranteed accuracy for 2-clustering problems with given center of one cluster. Proceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 91-93

BibTeX

@inproceedings{9cdcee4dadb548a38362f2f19b9c2b6d,
title = "Some algorithms with guaranteed accuracy for 2-clustering problems with given center of one cluster",
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.",
keywords = "Clusterization, Data analysis, Efficient algorithms with performance guarantees, Intractable problems, Pattern recognition",
author = "Alexander Kel'Manov and Vladimir Khandeev",
note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017 ; Conference date: 18-09-2017 Through 22-09-2017",
year = "2017",
month = nov,
day = "14",
doi = "10.1109/SIBIRCON.2017.8109844",
language = "English",
pages = "91--93",
booktitle = "Proceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

RIS

TY - GEN

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

AU - Kel'Manov, Alexander

AU - Khandeev, Vladimir

N1 - Publisher Copyright: © 2017 IEEE.

PY - 2017/11/14

Y1 - 2017/11/14

N2 - 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.

AB - 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.

KW - Clusterization

KW - Data analysis

KW - Efficient algorithms with performance guarantees

KW - Intractable problems

KW - Pattern recognition

UR - http://www.scopus.com/inward/record.url?scp=85040511586&partnerID=8YFLogxK

U2 - 10.1109/SIBIRCON.2017.8109844

DO - 10.1109/SIBIRCON.2017.8109844

M3 - Conference contribution

AN - SCOPUS:85040511586

SP - 91

EP - 93

BT - Proceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017

Y2 - 18 September 2017 through 22 September 2017

ER -

ID: 9112552