{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:54:08Z","timestamp":1742914448280,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030375980"},{"type":"electronic","value":"9783030375997"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-37599-7_25","type":"book-chapter","created":{"date-parts":[[2020,1,3]],"date-time":"2020-01-03T09:02:43Z","timestamp":1578042163000},"page":"296-307","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Modification of the k-MXT Algorithm and Its Application to the Geotagged Data Clustering"],"prefix":"10.1007","author":[{"given":"Anastasia","family":"Stepanova","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3699-5006","authenticated-orcid":false,"given":"Sergei V.","family":"Mironov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4047-8239","authenticated-orcid":false,"given":"Sergei","family":"Sidorov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6442-4361","authenticated-orcid":false,"given":"Alexey","family":"Faizliev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,3]]},"reference":[{"key":"25_CR1","unstructured":"B\u00e9jar, J.: K-means vs mini batch k-means: a comparison. Technical report, Universitat Polit\u00e8cnica de Catalunya (2013)"},{"key":"25_CR2","unstructured":"Bottou, L., Bengio, Y.: Convergence properties of the k-means algorithms. In: Advances in Neural Information Processing System (NIPS 1994), pp. 585\u2013592 (1994)"},{"issue":"2","key":"25_CR3","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1109\/TKDE.2007.190689","volume":"20","author":"U Brandes","year":"2008","unstructured":"Brandes, U., et al.: On modularity clustering. IEEE Trans. Knowl. Data Eng. 20(2), 172\u2013188 (2008). \nhttps:\/\/doi.org\/10.1109\/TKDE.2007.190689","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"6","key":"25_CR4","doi-asserted-by":"publisher","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70(6), 066111 (2004). \nhttps:\/\/doi.org\/10.1103\/PhysRevE.70.066111","journal-title":"Phys. Rev. E"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-319-92871-5_10","volume-title":"Algorithms and Models for the Web Graph","author":"C Cooper","year":"2018","unstructured":"Cooper, C., Vu, N.: An experimental study of the k-MXT algorithm with applications to clustering geo-tagged data. In: Bonato, A., Pra\u0142at, P., Raigorodskii, A. (eds.) WAW 2018. LNCS, vol. 10836, pp. 145\u2013169. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-92871-5_10"},{"issue":"7","key":"25_CR6","doi-asserted-by":"publisher","first-page":"e0159161","DOI":"10.1371\/journal.pone.0159161","volume":"11","author":"S Emmons","year":"2016","unstructured":"Emmons, S., Kobourov, S., Gallant, M., B\u00f6rner, K.: Analysis of network clustering algorithms and cluster quality metrics at scale. Public Libr. Sci. 11(7), e0159161 (2016). \nhttps:\/\/doi.org\/10.1371\/journal.pone.0159161","journal-title":"Public Libr. Sci."},{"key":"25_CR7","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, KDD 1996, pp. 226\u2013231. AAAI Press (1996)"},{"issue":"1","key":"25_CR8","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2(1), 193\u2013218 (1985). \nhttps:\/\/doi.org\/10.1007\/BF01908075","journal-title":"J. Classif."},{"issue":"2","key":"25_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/tit.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd, S.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129\u2013137 (1982). \nhttps:\/\/doi.org\/10.1109\/tit.1982.1056489","journal-title":"IEEE Trans. Inf. Theory"},{"key":"25_CR10","unstructured":"Macqueen, J.: Some methods for classification and analysis of multivariate observations. In: 5th Berkeley Symposium on Mathematical Statistics and Probability, pp. 281\u2013297 (1967)"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-319-92871-5_11","volume-title":"Algorithms and Models for the Web Graph","author":"P Miasnikof","year":"2018","unstructured":"Miasnikof, P., Shestopaloff, A.Y., Bonner, A.J., Lawryshyn, Y.: A statistical performance analysis of graph clustering algorithms. In: Bonato, A., Pra\u0142at, P., Raigorodskii, A. (eds.) WAW 2018. LNCS, vol. 10836, pp. 170\u2013184. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-92871-5_11"},{"issue":"2","key":"25_CR12","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004). \nhttps:\/\/doi.org\/10.1103\/PhysRevE.69.026113","journal-title":"Phys. Rev. E"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1016\/j.procs.2015.08.202","volume":"60","author":"K Oku","year":"2015","unstructured":"Oku, K., Hattori, F., Kawagoe, K.: Tweet-mapping method for tourist spots based on now-tweets and spot-photos. Procedia Comput. Sci. 60, 1318\u20131327 (2015). \nhttps:\/\/doi.org\/10.1016\/j.procs.2015.08.202","journal-title":"Procedia Comput. Sci."},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1016\/j.endm.2017.07.058","volume":"61","author":"LO Prokhorenkova","year":"2017","unstructured":"Prokhorenkova, L.O., Pra\u0142at, P., Raigorodskii, A.: Modularity in several random graph models. Electron. Notes Discrete Math. 61, 947\u2013953 (2017). \nhttps:\/\/doi.org\/10.1016\/j.endm.2017.07.058","journal-title":"Electron. Notes Discrete Math."},{"key":"25_CR15","doi-asserted-by":"publisher","unstructured":"Prokhorenkova, L.O., Raigorodskii, A., Pralat, P.: Modularity of complex networks models. Internet Math. (2017). \nhttps:\/\/doi.org\/10.24166\/im.12.2017","DOI":"10.24166\/im.12.2017"},{"issue":"336","key":"25_CR16","doi-asserted-by":"publisher","first-page":"846","DOI":"10.2307\/2284239","volume":"66","author":"WM Rand","year":"1971","unstructured":"Rand, W.M.: Objective criteria for the evaluation of clustering methods. J. Am. Stat. Assoc. 66(336), 846\u2013850 (1971). \nhttps:\/\/doi.org\/10.2307\/2284239","journal-title":"J. Am. Stat. Assoc."},{"issue":"1","key":"25_CR17","doi-asserted-by":"publisher","first-page":"e0210236","DOI":"10.1371\/journal.pone.0210236","volume":"14","author":"MZ Rodriguez","year":"2019","unstructured":"Rodriguez, M.Z., et al.: Clustering algorithms: a comparative approach. PLoS ONE 14(1), e0210236 (2019). \nhttps:\/\/doi.org\/10.1371\/journal.pone.0210236","journal-title":"PLoS ONE"},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","volume":"20","author":"PJ Rousseeuw","year":"1987","unstructured":"Rousseeuw, P.J.: Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J. Comput. Appl. Math. 20, 53\u201365 (1987). \nhttps:\/\/doi.org\/10.1016\/0377-0427(87)90125-7","journal-title":"J. Comput. Appl. Math."},{"key":"25_CR19","doi-asserted-by":"publisher","unstructured":"Sculley, D.: Web-scale k-means clustering. In: Proceedings of the 19th International Conference on World Wide Web - WWW 2010, pp. 1177\u20131178. ACM Press (2010). \nhttps:\/\/doi.org\/10.1145\/1772690.1772862","DOI":"10.1145\/1772690.1772862"},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/080744888","volume":"42","author":"DA Spielman","year":"2013","unstructured":"Spielman, D.A., Teng, S.H.: A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning. SIAM J. Comput. 42, 1\u201326 (2013). \nhttps:\/\/doi.org\/10.1137\/080744888","journal-title":"SIAM J. Comput."},{"issue":"12","key":"25_CR21","first-page":"801","volume":"4","author":"H Steinhaus","year":"1956","unstructured":"Steinhaus, H.: Sur la division des corps materiels en parties. Bull. Acad. Polon. Sci. 4(12), 801\u2013804 (1956)","journal-title":"Bull. Acad. Polon. Sci."},{"key":"25_CR22","doi-asserted-by":"publisher","unstructured":"Stepanova, A., Mironov, S., Korobov, E., Sidorov, S.: The clusterization of geo-tagged data for finding city sights with use of a modification of k-MXT algorithm (2019). \nhttps:\/\/doi.org\/10.2991\/cmdm-18.2019.4","DOI":"10.2991\/cmdm-18.2019.4"},{"key":"25_CR23","first-page":"2837","volume":"11","author":"NX Vinh","year":"2010","unstructured":"Vinh, N.X., Epps, J., Bailey, J.: Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance. J. Mach. Learn. Res. 11, 2837\u20132854 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"25_CR24","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/235968.233324","volume":"25","author":"T Zhang","year":"1996","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: an efficient data clustering method for very large databases. SIGMOD Rec. 25(2), 103\u2013114 (1996). \nhttps:\/\/doi.org\/10.1145\/235968.233324","journal-title":"SIGMOD Rec."}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Data Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-37599-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,3]],"date-time":"2020-01-03T10:11:50Z","timestamp":1578046310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-37599-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030375980","9783030375997"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-37599-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning, Optimization, and Data Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Siena","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mod2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lod2019.icas.xyz\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"158","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}