Abstract
We consider the strongly NP-hard problem of partitioning a set of Euclidean points into two clusters so as to minimize the sum (over both clusters) of the weighted sum of the squared intracluster distances from the elements of the clusters to their centers. The weights of sums are the cardinalities of the clusters. The center of one of the clusters is given as input, while the center of the other cluster is unknown and determined as the geometric center (centroid), i.e. the average value over all points in the cluster. We analyze the variant of the problem with cardinality constraints. We present an approximation algorithm for the problem and prove that it is a fully polynomial-time approximation scheme when the space dimension is bounded by a constant.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Kel’manov, A.V., Pyatkin, A.V.: NP-hardness of some quadratic euclidean 2-clustering problems. Doklady Math. 92(2), 634–637 (2015)
Kel’manov, A.V., Pyatkin, A.V.: On the complexity of some quadratic euclidean 2-clustering problems. Comput. Math. Math. Phys. 56(3), 491–497 (2016)
Aggarwal, C.C.: Data Mining: The Textbook. Springer International Publishing, Switzerland (2015)
Bishop, C.M.: Pattern Recognition and Machine Learning. Springer Science+Business Media, LLC, New York (2006)
Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer-Verlag, New York (2001)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
Kel’manov, A.V., Motkova, A.V.: An exact pseudopolynomial algorithm for a special case of a euclidean balanced variance-based 2-clustering problem. In: Abstracts of the VI International Conference “Optimization and Applications” (OPTIMA-2015), P. 98. Petrovac, Montenegro (2015)
Sahni, S., Gonzalez, T.: P-complete approximation problems. J. ACM 23, 555–566 (1976)
Brucker, P.: On the complexity of clustering problems. Lect. Notes Econ. Math. Syst. 157, 45–54 (1978)
Inaba, M., Katoh, N., Imai, H.: Applications of Weighted Voronoi Diagrams and Randomization toVariance-Based \(k\)-Clustering: (extended abstract). Stony Brook, NY, USA, pp. 332–339 (1994)
Hasegawa, S., Imai, H., Inaba, M., Katoh, N., Nakano, J.: Efficient algorithms for variance-based \(k\)-clustering. In: Proceedings of the 1st Pacific Conference on Computer Graphics andApplications (Pacific Graphics 1993, Seoul, Korea),World Scientific, River Edge, NJ. 1, pp. 75–89 (1993)
de la Vega, F., Kenyon, C.: A randomized approximation scheme for metric max-cut. J. Comput. Syst. Sci. 63, 531–541 (2001)
de la Vega, F., Karpinski, M., Kenyon, C., Rabani, Y.: Polynomial Time Approximation Schemes for Metric Min-Sum Clustering. Electronic Colloquium on Computational Complexity (ECCC), 25 (2002)
Aloise, D., Deshpande, A., Hansen, P., Popat, P.: NP-hardness of euclidean sum-of-squares clustering. Mach. Learn. 75(2), 245–248 (2009)
Fisher, R.A.: Statistical Methods and Scientific Inference. Hafner Press, New York (1956)
Rao, M.: Cluster analysis and mathematical programming. J. Amer. Statist. Assoc. 66, 626–662 (1971)
Gimadi, E.K., Kel’manov, A.V., Kel’manova, M.A., Khamidullin, S.A.: Aposteriori finding of a quasiperiodic fragment with a given number of repetitions in a numerical sequence (in Russian). Sib. Zh. Ind. Mat. 9(25), 55–74 (2006)
Gimadi, E.K., Kel’manov, A.V., Kel’manova, M.A., Khamidullin, S.A.: A posteriori detecting a quasiperiodic fragment in a numerical sequence. Pattern Recogn. Image Anal. 18(1), 30–42 (2008)
Dolgushev, A.V., Kel’manov, A.V.: An approximation algorithm for solving a problem of cluster analysis. J. Appl. Indust. Math. 5(4), 551–558 (2011)
Dolgushev, A.V., Kel’manov, A.V., Shenmaier, V.V.: A polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters (in Russian). Trudy Inst. Mat. i Mekh. UrO. RAN. 21(3), 100–109 (2015)
Kel’manov, A.V., Khandeev, V.I.: A 2-approximation polynomial algorithm for a clustering problem. J. Appl. Indust. Math. 7(4), 515–521 (2013)
Kel’manov, A.V., Khandeev, V.I.: A randomized algorithm for two-cluster partition of a set of vectors. Comput. Math. Math. Phys. 55(2), 330–339 (2015)
Kel’manov, A.V., Khandeev, V.I.: An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors. J. Appl. Indust. Math. 9(4), 497–502 (2015)
Kel’manov, A.V., Khandeev, V.I.: Fully polynomial-time approximation scheme for a special case of a quadratic euclidean 2-clustering problem. Comput. Math. Math. Phys. 56(2), 334–341 (2016)
Kel’manov, A.V., Romanchenko, S.M.: An approximation algorithm for solving a problem of search for a vector subset. J. Appl. Ind. Math. 6(1), 90–96 (2012)
Kel’manov, A.V., Romanchenko, S.M.: An FPTAS for a vector subset search problem. J. Appl. Indust. Math. 8(3), 329–336 (2014)
Wirth, N.: Algorithms + Data Structures = Programs. Prentice Hall, New Jersey (1976)
Acknowledgments
This work was supported by the RFBR, projects 15-01-00462, 16-31-00186 and 16-07-00168.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Kel’manov, A., Motkova, A. (2016). A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds) Discrete Optimization and Operations Research. DOOR 2016. Lecture Notes in Computer Science(), vol 9869. Springer, Cham. https://doi.org/10.1007/978-3-319-44914-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-44914-2_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-44913-5
Online ISBN: 978-3-319-44914-2
eBook Packages: Computer ScienceComputer Science (R0)