{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:12:33Z","timestamp":1742969553237,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":37,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819778003"},{"type":"electronic","value":"9789819778010"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-7801-0_5","type":"book-chapter","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:05:37Z","timestamp":1726769137000},"page":"52-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Speeding Up Constrained k-Means Through 2-Means"],"prefix":"10.1007","author":[{"given":"Qilong","family":"Feng","sequence":"first","affiliation":[]},{"given":"Bin","family":"Fu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,19]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Ackermann, M.R., Bl\u00f6mer, J., Sohler, C.: Clustering for metric and nonmetric distance measures. ACM Trans. Algorithms 6(4), 59:1\u201359:26 (2010)","DOI":"10.1145\/1824777.1824779"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Ahmadian, S., Norouzi-Fard, A., Svensson, O., Ward, J.: Better guarantees for k-means and euclidean k-median by primal-dual algorithms. In: Proceedings of 58th Annual Symposium on Foundations of Computer Science, FOCS, California, USA, pp. 61\u201372 (2017)","DOI":"10.1109\/FOCS.2017.15"},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10994-009-5103-0","volume":"75","author":"D Aloise","year":"2009","unstructured":"Aloise, D., Deshpande, A., Hansen, P., Popat, P.: NP-hardness of euclidean sum-of-squares clustering. Mach. Learn. 75(2), 245\u2013248 (2009)","journal-title":"Mach. Learn."},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.comgeo.2014.08.004","volume":"48","author":"EM Arkin","year":"2015","unstructured":"Arkin, E.M., et al.: Bichromatic 2-center of pairs of points. Comput. Geom. 48(2), 94\u2013107 (2015)","journal-title":"Comput. Geom."},{"key":"5_CR5","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. In Proceedings of 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, Louisiana, USA, pp. 1027\u20131035 (2007)"},{"key":"5_CR6","unstructured":"Bhattacharya, A., Jaiswal, R., Kumar, A.: Faster algorithms for the constrained k-means problem. In: Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, STACS, Orl\u00e9ans, France, pp. 1\u201313 (2016)"},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00224-017-9820-7","volume":"62","author":"A Bhattacharya","year":"2018","unstructured":"Bhattacharya, A., Jaiswal, R., Kumar, A.: Faster algorithms for the constrained k-means problem. Theory Comput. Syst. 62(1), 93\u2013115 (2018)","journal-title":"Theory Comput. Syst."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"B\u0103doiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In Proceedings of 34th Annual ACM Symposium on Theory of Computing, STOC, Montr\u00e9al, Qu\u00e9bec, Canada, pp. 250\u2013257 (2002)","DOI":"10.1145\/509907.509947"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Chen, K.: On k-median clustering in high dimensions. In: Proceedings of the 17th annual ACM-SIAM Symposium on Discrete Algorithm, SODA pp. 1177\u20131185 (2006)","DOI":"10.1145\/1109557.1109687"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V.: A fast approximation scheme for low-dimensional $$k$$-means. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 430\u2013440 (2018)","DOI":"10.1137\/1.9781611975031.29"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V., Klein, P.N., Mathieu, C.: Local search yields approximation schemes for $$k$$-means and $$k$$-median in euclidean and minor-free metrics. In: Proceedings of 57th IEEE Annual Symposium on Foundations of Computer Science, FOCS, pp. 353\u2013364 (2016)","DOI":"10.1109\/FOCS.2016.46"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"de\u00a0la Vega, W.F., Karpinski, M., Kenyon, C., Rabani, Y.: Approximation schemes for clustering problems. In: Proceedings of 35th Annual ACM Symposium on Theory of Computing, STOC, California, USA, pp. 50\u201358 (2003)","DOI":"10.1145\/780542.780550"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.ic.2017.04.010","volume":"256","author":"J D\u00edaz","year":"2017","unstructured":"D\u00edaz, J., Mertzios, G.B.: Minimum bisection is np-hard on unit disk graphs. Inf. Comput. 256, 83\u201392 (2017)","journal-title":"Inf. Comput."},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Ding, H., Xu, J.: Solving the chromatic cone clustering problem via minimum spanning sphere. In: Proceedings of 38th International Colloquium on Automata, Languages and Programming, ICALP, pp. 773\u2013784 (2011)","DOI":"10.1007\/978-3-642-22006-7_65"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Ding, H., Xu, J.: A unified framework for clustering constrained data without locality property. In: Proceedings of 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 1471\u20131490 (2015)","DOI":"10.1137\/1.9781611973730.97"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Feldman, D., Monemizadeh, M., Sohler, C.: A PTAS for k-means clustering based on weak coresets. In: Proceedings of the 23rd ACM Symposium on Computational Geometry, SoCG Gyeongju, South Korea, pp. 11\u201318 (2007)","DOI":"10.1145\/1247069.1247072"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Feng, Q., Hu, J., Huang, N., Wang, J.: Improved PTAS for the constrained k-means problem. J. Comb. Optim. to appear (2018)","DOI":"10.1007\/s10878-018-0340-4"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Friggstad, Z., Rezapour, M., Salavatipour, M.R.: Local search yields a PTAS for $$k$$-means in doubling metrics. In: Proceedings of 57th IEEE Annual Symposium on Foundations of Computer Science, FOCS, pp. 365\u2013374 (2016)","DOI":"10.1109\/FOCS.2016.47"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Mazumdar, S.: On coresets for k-means and k-median clustering. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC, Chicago, IL, USA, pp. 291\u2013300 (2004)","DOI":"10.1145\/1007352.1007400"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Inaba, M., Katoh, N., Imai, H.: Applications of weighted voronoi diagrams and randomization to variance-based k-clustering (extended abstract). In: Proceedings of the 10th Annual Symposium on Computational Geometry, SoCG, Stony Brook, New York, USA, pp. 332\u2013339 (1994)","DOI":"10.1145\/177424.178042"},{"issue":"1","key":"5_CR21","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/s00453-013-9833-9","volume":"70","author":"R Jaiswal","year":"2014","unstructured":"Jaiswal, R., Kumar, A., Sen, S.: A simple D$$ ^{2}$$-sampling based PTAS for k-means and other clustering problems. Algorithmica 70(1), 22\u201346 (2014)","journal-title":"Algorithmica"},{"issue":"2","key":"5_CR22","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.ipl.2014.07.009","volume":"115","author":"R Jaiswal","year":"2015","unstructured":"Jaiswal, R., Kumar, M., Yadav, P.: Improved analysis of D$$ ^{2}$$-sampling based PTAS for k-means and other clustering problems. Inf. Process. Lett. 115(2), 100\u2013103 (2015)","journal-title":"Inf. Process. Lett."},{"issue":"2\u20133","key":"5_CR23","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.comgeo.2004.03.003","volume":"28","author":"T Kanungo","year":"2004","unstructured":"Kanungo, T., et al.: A local search approximation algorithm for k-means clustering. Comput. Geom. 28(2\u20133), 89\u2013112 (2004)","journal-title":"Comput. Geom."},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Kumar, A., Sabharwal, Y., Sen, S.: A simple linear time (1+$$\\varepsilon $$)-approximation algorithm for k-means clustering in any dimensions. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS, Washington, DC, USA, pp. 454\u2013462 (2004)","DOI":"10.1109\/FOCS.2004.7"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Kumar, A., Sabharwal, Y., Sen, S.: Linear-time approximation schemes for clustering problems in any dimensions. J. ACM 57(2), 1\u201332 (2010)","DOI":"10.1145\/1667053.1667054"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Li, J., Yi, K., Zhang, Q.: Clustering with deversity. In: Proceedings of 37th International Colloquium on Automata, Languages and Programming, ICALP, pp. 188\u2013200 (2010)","DOI":"10.1007\/978-3-642-14165-2_17"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J.: On approximate geometric $$k$$-clustering. Discrete Comput. Geom. 24(1), 61\u201384 (2000)","DOI":"10.1007\/s004540010019"},{"issue":"1","key":"5_CR28","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s004930070034","volume":"20","author":"J Matou\u0161ek","year":"2000","unstructured":"Matou\u0161ek, J.: On the signed domination in graphs. Combinatorica 20(1), 103\u2013108 (2000)","journal-title":"Combinatorica"},{"key":"5_CR29","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press (2000)"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Rabani, Y., Schulman, L.J., Swamy, C.: The effectiveness of Lloyd-type methods for the k-means problem. J. ACM 59(6), 1\u201322 (2012)","DOI":"10.1145\/2395116.2395117"},{"issue":"2","key":"5_CR31","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.comgeo.2005.01.003","volume":"32","author":"Y Sabharwal","year":"2005","unstructured":"Sabharwal, Y., Sen, S.: A linear time algorithm for approximate 2-means clustering. Comput. Geom. 32(2), 159\u2013172 (2005)","journal-title":"Comput. Geom."},{"issue":"4","key":"5_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1383369.1383382","volume":"4","author":"C Swamy","year":"2008","unstructured":"Swamy, C., Shmoys, D.B.: Fault-tolerant facility location. ACM Trans. Algorithms 4(4), 1\u201327 (2008)","journal-title":"ACM Trans. Algorithms"},{"issue":"5","key":"5_CR33","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney, L.: $$k$$-anonymity: a model for protecting privacy. Int. J. Uncertainity Fuzziness Knowl. Based Syst. 10(5), 557\u2013570 (2002)","journal-title":"Int. J. Uncertainity Fuzziness Knowl. Based Syst."},{"issue":"3","key":"5_CR34","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1016\/j.ejor.2007.11.019","volume":"195","author":"A Valls","year":"2009","unstructured":"Valls, A., Batet, M., Lopez, E.M.: Using expert\u2019s rules as background knowledge in the clusDM methodology. Eur. J. Oper. Res. 195(3), 864\u2013875 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR35","unstructured":"Wagstaff, K., Cardie, C., Rogers, S.: Constrained $$k$$-means clustering with background knowledge. In: Proceedings of the 8th International Conference on Machine Learning, ICML, pp. 577\u2013584 (2001)"},{"issue":"1","key":"5_CR36","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.comgeo.2007.12.002","volume":"43","author":"G Xu","year":"2010","unstructured":"Xu, G., Xu, J.: Efficient approximation algorithms for clustering point-sets. Comput. Geom. 43(1), 59\u201366 (2010)","journal-title":"Comput. Geom."},{"issue":"3","key":"5_CR37","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/S0895480197329776","volume":"13","author":"S Yhuller","year":"2000","unstructured":"Yhuller, S., Sussmann, Y.J.: The capacitated $$k$$-center problem. SIAM J. Discrete Math 13(3), 403\u2013418 (2000)","journal-title":"SIAM J. Discrete Math"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7801-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:08:10Z","timestamp":1726769290000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7801-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819778003","9789819778010"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7801-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"19 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Aspects in Information and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2024\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}