An FPTAS for a vector subset search problem
- 33 Downloads
Under study is a strongly NP-hard problem of finding a subset of a given size of a finite set of vectors in Euclidean space which minimizes the sum of squared distances from the elements of this subset to its center. The center of the subset is defined as the average vector calculated with all subset elements. It is proved that, unless P=NP, in the general case of the problem there is no fully polynomial time approximation scheme (FPTAS). Such a scheme is provided in the case when the dimension of the space is fixed.
Keywordsfinding a vector subset Euclidean space minimum of the sum of squared distances NP-hardness fully polynomial time approximation scheme
Unable to display preview. Download preview PDF.
- 3.A. V. Kel’manov and S. M. Romanchenko, “Pseudopolynomial Algorithms for Certain Computationally Hard Vector Subset and Cluster Analysis Problems,” Avtomat. i Telemekh. No 2, 156–162 (2012) [Automat. Remote Control 73 2), 349–354 (2012)].Google Scholar
- 4.V. V. Shenmaier, “An Approximation Scheme for a Problem of Search for a Vector Subset,” Diskretn. Anal. Issled. Oper. 19(2), 92–100 (2019) [J. Appl. Indust. Math. 6 (3), 381–386 (2012)].Google Scholar
- 5.D. Aloise, A. Deshpande, P. Hansen, and P. Popat, “NP-Hardness of Euclidean Sum-of-Squares Clustering,” Les Cahiers du GERAD, G-2008-33 (2008) [Machine Learning, 75 (2), 245–248 (2009)].Google Scholar
- 9.J. B. MacQueen, “Some Methods for Classification and Analysis of Multivariate Observations,” in Proceedings of the 5th Berkeley Symposium on Mathematics, Statistics, and Probability (Berkeley, June 21–July 18, 1965; December 27, 1965–January 7, 1966), Vol. 1 (Univ. of California Press, Berkeley, 1967), pp. 281–297.Google Scholar