|
Diskretnyi Analiz i Issledovanie Operatsii, 2011, Volume 18, Issue 2, Pages 29–40
(Mi da644)
|
|
|
|
This article is cited in 29 scientific papers (total in 29 papers)
An approximation algorithm for one problem of cluster analysis
A. V. Dolgusheva, A. V. Kel'manovab a Novosibirsk State University, Novosibirsk, Russia
b S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia
Abstract:
A 2-approximation algorithm is presented for a data analysis problem which was previously reduced to an NP-hard optimization problem. Particularly, the problem is to partition a set of Euclidean vectors into two subsets (clusters) under the criterion of minimum-sum-of-squares. Bibliogr. 7.
Keywords:
search for a vector subset, cluster analysis, NP-hardness, efficient approximate algorithm.
Received: 26.12.2010 Revised: 18.01.2011
Citation:
A. V. Dolgushev, A. V. Kel'manov, “An approximation algorithm for one problem of cluster analysis”, Diskretn. Anal. Issled. Oper., 18:2 (2011), 29–40; J. Appl. Industr. Math., 5:4 (2011), 551–558
Linking options:
https://www.mathnet.ru/eng/da644 https://www.mathnet.ru/eng/da/v18/i2/p29
|
Statistics & downloads: |
Abstract page: | 490 | Full-text PDF : | 121 | References: | 53 | First page: | 6 |
|