{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T16:40:09Z","timestamp":1745599209729,"version":"3.40.4"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819658800","type":"print"},{"value":"9789819658817","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-5881-7_3","type":"book-chapter","created":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T15:10:53Z","timestamp":1745593853000},"page":"32-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Boosting K-means for\u00a0Big Data by\u00a0Fusing Data Streaming with\u00a0Global Optimization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1105-5990","authenticated-orcid":false,"given":"Ravil","family":"Mussabayev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7283-5144","authenticated-orcid":false,"given":"Rustam","family":"Mussabayev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,17]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Aloise, D., Deshpande, A., Hansen, P., et al.: Np-hardness of Euclidean sum-of-squares clustering. Mach. Learn. (2009). https:\/\/doi.org\/10.1007\/s10994-009-5103-0","DOI":"10.1007\/s10994-009-5103-0"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Cuong, T.H., Yao, J., Yen, N.D.: Qualitative properties of the minimum sum-of-squares clustering problem. J. Math. Program. Oper. Res. (2020). https:\/\/doi.org\/10.1080\/02331934.2020.1778685","DOI":"10.1080\/02331934.2020.1778685"},{"key":"3_CR3","unstructured":"Desale, S., Rasool, A., Andhale, S., Rane, P.: Heuristic and meta-heuristic algorithms and their relevance to the real world: a survey. Int. J. Comput. Eng. Res. Trends (2015)"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Gribel, D., Vidal, T.: HG-means: a scalable hybrid genetic algorithm for minimum sum-of-squares clustering. Pattern Recogn. (2019). https:\/\/doi.org\/10.1016\/j.patcog.2018.12.022","DOI":"10.1016\/j.patcog.2018.12.022"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Hansen, P., Mladenovic, N.: J-means: a new local search heuristic for minimum sum of squares clustering. Pattern Recogn. (2001). https:\/\/doi.org\/10.1016\/S0031-3203(99)00216-2","DOI":"10.1016\/S0031-3203(99)00216-2"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovic, N.: Variable neighborhood search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics. Kluwer (2003)","DOI":"10.1007\/0-306-48056-5_6"},{"issue":"3","key":"3_CR7","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2016","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423\u2013454 (2016). https:\/\/doi.org\/10.1007\/s13675-016-0075-x","journal-title":"EURO J. Comput. Optim."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovic, N.: Variable neighborhood search. In: Introductory Tutorials in Optimization and Decision Support Techniques, Search Methodologies (2014)","DOI":"10.1007\/978-1-4614-6940-7_12"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Karmitsa, N., Bagirov, A.M., Taheri, S.: Clustering in large data sets with the limited memory bundle method. Pattern Recogn. (2018). https:\/\/doi.org\/10.1016\/j.patcog.2018.05.028","DOI":"10.1016\/j.patcog.2018.05.028"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Mansueto, P., Schoen, F.: Memetic differential evolution methods for clustering problems. Pattern Recogn. (2021). https:\/\/doi.org\/10.1016\/j.patcog.2021.107849","DOI":"10.1016\/j.patcog.2021.107849"},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1007\/s11227-017-2213-5","volume":"74","author":"A Marowka","year":"2018","unstructured":"Marowka, A.: Python accelerators for high-performance computing. J. Supercomput. 74(4), 1449\u20131460 (2018)","journal-title":"J. Supercomput."},{"key":"3_CR12","doi-asserted-by":"publisher","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. (1997). https:\/\/doi.org\/10.1016\/S0305-0548(97)00031-2","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Mussabayev, R., Mussabayev, R.: Comparative analysis of optimization strategies for k-means clustering in big data contexts: a review (2024). https:\/\/doi.org\/10.48550\/arXiv.2310.09819, https:\/\/arxiv.org\/abs\/2310.09819","DOI":"10.48550\/arXiv.2310.09819"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Mussabayev, R., Mussabayev, R.: High-performance hybrid algorithm for minimum sum-of-squares clustering of infinitely tall data. Mathematics 12(13) (2024). https:\/\/doi.org\/10.3390\/math12131930, https:\/\/www.mdpi.com\/2227-7390\/12\/13\/1930","DOI":"10.3390\/math12131930"},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Mussabayev, R., Mladenovic, N., Jarboui, B., Mussabayev, R.: How to use k-means for big data clustering? Pattern Recogn. 137, 109269 (2023) https:\/\/doi.org\/10.1016\/j.patcog.2022.109269, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0031320322007488","DOI":"10.1016\/j.patcog.2022.109269"},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"Mussabayev, R., Mussabayev, R.: Superior parallel big data clustering through competitive stochastic sample size optimization in big-means. In: Nguyen, N.T., et al. (eds.) Intelligent Information and Database Systems, pp. 224\u2013236. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-97-4985-0_18","DOI":"10.1007\/978-981-97-4985-0_18"},{"key":"3_CR17","unstructured":"Mussabayev, R., Mussabayev, R.: Variable landscape search: a novel metaheuristic paradigm for unlocking hidden dimensions in global optimization (2024). https:\/\/arxiv.org\/abs\/2408.03895"}],"container-title":["Communications in Computer and Information Science","Recent Challenges in Intelligent Information and Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-5881-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T16:01:43Z","timestamp":1745596903000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-5881-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819658800","9789819658817"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-5881-7_3","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACIIDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Conference on Intelligent Information and Database Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kitakyushu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aciids2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aciids.pwr.edu.pl\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}