{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T03:57:22Z","timestamp":1783396642083,"version":"3.54.6"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030778750","type":"print"},{"value":"9783030778767","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-77876-7_31","type":"book-chapter","created":{"date-parts":[[2021,6,13]],"date-time":"2021-06-13T23:03:11Z","timestamp":1623625391000},"page":"462-476","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["K-Means Clustering via a Nonconvex Optimization Approach"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4579-3927","authenticated-orcid":false,"given":"Tatiana V.","family":"Gruzdeva","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8289-6266","authenticated-orcid":false,"given":"Anton V.","family":"Ushakov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,6,14]]},"reference":[{"key":"31_CR1","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, 245\u2013248 (2009). https:\/\/doi.org\/10.1007\/s10994-009-5103-0","journal-title":"Mach. Learn."},{"issue":"1\u20132","key":"31_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10107-010-0349-7","volume":"131","author":"D Aloise","year":"2012","unstructured":"Aloise, D., Hansen, P., Liberti, L.: An improved column generation algorithm for minimum sum-of-squares clustering. Math. Program. 131(1\u20132), 195\u2013220 (2012). https:\/\/doi.org\/10.1007\/s10107-010-0349-7","journal-title":"Math. Program."},{"key":"31_CR3","unstructured":"Arthur, D., Vassilvitskii, S.: K-means++: the advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, pp. 1027\u20131035. SIAM, Philadelphia (2007)"},{"issue":"10","key":"31_CR4","doi-asserted-by":"publisher","first-page":"3192","DOI":"10.1016\/j.patcog.2008.04.004","volume":"41","author":"AM Bagirov","year":"2008","unstructured":"Bagirov, A.M.: Modified global k-means algorithm for minimum sum-of-squares clustering problems. Pattern Recogn. 41(10), 3192\u20133199 (2008). https:\/\/doi.org\/10.1016\/j.patcog.2008.04.004","journal-title":"Pattern Recogn."},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.patcog.2015.11.011","volume":"53","author":"AM Bagirov","year":"2016","unstructured":"Bagirov, A.M., Taheri, S., Ugon, J.: Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems. Pattern Recogn. 53, 12\u201324 (2016). https:\/\/doi.org\/10.1016\/j.patcog.2015.11.011","journal-title":"Pattern Recogn."},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10898-014-0175-1","volume":"63","author":"E Carrizosa","year":"2015","unstructured":"Carrizosa, E., Alguwaizani, A., Hansen, P., Mladenovi\u0107, N.: New heuristic for harmonic means clustering. J. Glob. Optim. 63, 427\u2013443 (2015). https:\/\/doi.org\/10.1007\/s10898-014-0175-1","journal-title":"J. Glob. Optim."},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1014075113874","volume":"23","author":"V Demyanov","year":"2002","unstructured":"Demyanov, V., Bagirov, A., Rubinov, A.: A method of truncated codifferential with application to some problems of cluster analysis. J. Glob. Optim. 23, 63\u201380 (2002). https:\/\/doi.org\/10.1023\/A:1014075113874","journal-title":"J. Glob. Optim."},{"issue":"2","key":"31_CR8","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1137\/0906020","volume":"6","author":"G Diehr","year":"1985","unstructured":"Diehr, G.: Evaluation of a branch and bound algorithm for clustering. SIAM J. Sci. Stat. Comput. 6(2), 268\u2013284 (1985). https:\/\/doi.org\/10.1137\/0906020","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"2","key":"31_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1134\/S1990478911020050","volume":"5","author":"AV Dolgushev","year":"2011","unstructured":"Dolgushev, A.V., Kel\u2019manov, A.V.: On the algorithmic complexity of a problem in cluster analysis. J. Appl. Ind. Math. 5(2), 191\u2013194 (2011). https:\/\/doi.org\/10.1134\/S1990478911020050","journal-title":"J. Appl. Ind. Math."},{"issue":"4","key":"31_CR10","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1137\/S1064827597328327","volume":"21","author":"O du Merle","year":"1999","unstructured":"du Merle, O., Hansen, P., Jaumard, B., Mladenovic, N.: An interior point algorithm for minimum sum-of-squares clustering. SIAM J. Sci. Comput. 21(4), 1485\u20131505 (1999). https:\/\/doi.org\/10.1137\/S1064827597328327","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"31_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10898-015-0319-y","volume":"66","author":"M Gaudioso","year":"2016","unstructured":"Gaudioso, M., Gruzdeva, T.V., Strekalovsky, A.S.: On numerical solving the spherical separability problem. J. Glob. Optim. 66(1), 21\u201334 (2016). https:\/\/doi.org\/10.1007\/s10898-015-0319-y","journal-title":"J. Glob. Optim."},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/j.patcog.2018.12.022","volume":"88","author":"D Gribel","year":"2019","unstructured":"Gribel, D., Vidal, T.: HG-means: a scalable hybrid genetic algorithm for minimum sum-of-squares clustering. Pattern Recogn. 88, 569\u2013583 (2019). https:\/\/doi.org\/10.1016\/j.patcog.2018.12.022","journal-title":"Pattern Recogn."},{"issue":"3","key":"31_CR13","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1007\/s10898-012-9885-4","volume":"56","author":"TV Gruzdeva","year":"2013","unstructured":"Gruzdeva, T.V.: On a continuous approach for the maximum weighted clique problem. J. Glob. Optim. 56(3), 971\u2013981 (2013). https:\/\/doi.org\/10.1007\/s10898-012-9885-4","journal-title":"J. Glob. Optim."},{"issue":"3","key":"31_CR14","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10618-009-0135-4","volume":"19","author":"P Hansen","year":"2009","unstructured":"Hansen, P., Brimberg, J., Urosevi\u0107, D., Mladenovi\u0107, N.: Solving large p-median clustering problems by primal-dual variable neighborhood search. Data Min. Knowl. Discov. 19(3), 351\u2013375 (2009). https:\/\/doi.org\/10.1007\/s10618-009-0135-4","journal-title":"Data Min. Knowl. Discov."},{"issue":"1\u20133","key":"31_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF02614317","volume":"79","author":"P Hansen","year":"1997","unstructured":"Hansen, P., Jaumard, B.: Cluster analysis and mathematical programming. Math. Program. 79(1\u20133), 191\u2013215 (1997). https:\/\/doi.org\/10.1007\/BF02614317","journal-title":"Math. Program."},{"issue":"2","key":"31_CR16","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/S0031-3203(99)00216-2","volume":"34","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107i, N.: J-means: a new local search heuristic for minimum sum of squares clustering. Pattern Recogn. 34(2), 405\u2013413 (2001). https:\/\/doi.org\/10.1016\/S0031-3203(99)00216-2","journal-title":"Pattern Recogn."},{"issue":"1","key":"31_CR17","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/j.patcog.2013.07.012","volume":"47","author":"LT Hoai An","year":"2014","unstructured":"Hoai An, L.T., Hoai Minh, L., Tao, P.D.: New and efficient DCA based algorithms for minimum sum-of-squares clustering. Pattern Recogn. 47(1), 388\u2013401 (2014). https:\/\/doi.org\/10.1016\/j.patcog.2013.07.012","journal-title":"Pattern Recogn."},{"key":"31_CR18","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"LT Hoai An","year":"2005","unstructured":"Hoai An, L.T., Tao, P.D.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133, 23\u201346 (2005). https:\/\/doi.org\/10.1007\/s10479-004-5022-1","journal-title":"Ann. Oper. Res."},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/j.patcog.2018.02.015","volume":"79","author":"H Ismkhan","year":"2018","unstructured":"Ismkhan, H.: I-k-means-+: an iterative clustering algorithm based on an enhanced version of the k-means. Pattern Recogn. 79, 402\u2013413 (2018). https:\/\/doi.org\/10.1016\/j.patcog.2018.02.015","journal-title":"Pattern Recogn."},{"issue":"7","key":"31_CR20","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1109\/TPAMI.2002.1017616","volume":"24","author":"T Kanungo","year":"2002","unstructured":"Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R., Wu, A.Y.: An efficient k-means clustering algorithm: analysis and implementation. IEEE Trans. Pattern Anal. Mach. Intell. 24(7), 881\u2013892 (2002). https:\/\/doi.org\/10.1109\/TPAMI.2002.1017616","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"31_CR21","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.ejor.2017.06.010","volume":"263","author":"N Karmitsa","year":"2017","unstructured":"Karmitsa, N., Bagirov, A.M., Taheri, S.: New diagonal bundle method for clustering problems in large data sets. Eur. J. Oper. Res. 263(2), 367\u2013379 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2017.06.010","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"31_CR22","doi-asserted-by":"publisher","first-page":"1966","DOI":"10.1134\/S0965542509110128","volume":"49","author":"AV Kel\u2019manov","year":"2009","unstructured":"Kel\u2019manov, A.V., Pyatkin, A.V.: Complexity of certain problems of searching for subsets of vectors and cluster analysis. Comput. Math. Math. Phys. 49(11), 1966\u20131971 (2009). https:\/\/doi.org\/10.1134\/S0965542509110128","journal-title":"Comput. Math. Math. Phys."},{"key":"31_CR23","doi-asserted-by":"publisher","unstructured":"Kumar, A., Sabharwal, Y., Sen, S.: A simple linear time ($$1 + \\varepsilon $$)-approximation algorithm for k-means clustering in any dimensions. In: 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 454\u2013462. IEEE, New York (2004). https:\/\/doi.org\/10.1109\/FOCS.2004.7","DOI":"10.1109\/FOCS.2004.7"},{"issue":"2","key":"31_CR24","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0031-3203(02)00060-2","volume":"36","author":"A Likas","year":"2003","unstructured":"Likas, A., Vlassis, N., Verbeek, J.J.: The global k-means clustering algorithm. Pattern Recogn. 36(2), 451\u2013461 (2003). https:\/\/doi.org\/10.1016\/S0031-3203(02)00060-2","journal-title":"Pattern Recogn."},{"issue":"12","key":"31_CR25","doi-asserted-by":"publisher","first-page":"2680","DOI":"10.1016\/j.ins.2008.01.022","volume":"178","author":"Y Liu","year":"2008","unstructured":"Liu, Y., Yi, Z., Wu, H., Ye, M., Chen, K.: A tabu search approach for the minimum sum-of-squares clustering problem. Inf. Sci. 178(12), 2680\u20132704 (2008). https:\/\/doi.org\/10.1016\/j.ins.2008.01.022","journal-title":"Inf. Sci."},{"key":"31_CR26","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2010.05.034","volume":"442","author":"M Mahajan","year":"2012","unstructured":"Mahajan, M., Nimbhorkar, P., Varadarajan, K.: The planar k-means problem is NP-hard. Theor. Comput. Sci. 442, 13\u201321 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2010.05.034. Special Issue on the Workshop on Algorithms and Computation (WALCOM 2009)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR27","doi-asserted-by":"publisher","first-page":"107849","DOI":"10.1016\/j.patcog.2021.107849","volume":"114","author":"P Mansueto","year":"2021","unstructured":"Mansueto, P., Schoen, F.: Memetic differential evolution methods for clustering problems. Pattern Recogn. 114, 107849 (2021). https:\/\/doi.org\/10.1016\/j.patcog.2021.107849","journal-title":"Pattern Recogn."},{"key":"31_CR28","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s004540010019","volume":"24","author":"J Matou\u0161ek","year":"2000","unstructured":"Matou\u0161ek, J.: On approximate geometric k-clustering. Discrete Comput. Geom. 24, 61\u201384 (2000). https:\/\/doi.org\/10.1007\/s004540010019","journal-title":"Discrete Comput. Geom."},{"key":"31_CR29","doi-asserted-by":"publisher","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) (2013). https:\/\/doi.org\/10.1145\/2395116.2395117","DOI":"10.1145\/2395116.2395117"},{"issue":"5","key":"31_CR30","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1016\/j.cor.2003.11.006","volume":"32","author":"JA Pacheco","year":"2005","unstructured":"Pacheco, J.A.: A scatter search approach for the minimum sum-of-squares clustering problem. Comput. Oper. Res. 32(5), 1325\u20131335 (2005). https:\/\/doi.org\/10.1016\/j.cor.2003.11.006","journal-title":"Comput. Oper. Res."},{"key":"31_CR31","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s10898-004-2706-7","volume":"32","author":"HD Sherali","year":"2005","unstructured":"Sherali, H.D., Desai, J.: A global optimization RLT-based approach for solving the hard clustering problem. J. Glob. Optim. 32, 281\u2013306 (2005). https:\/\/doi.org\/10.1007\/s10898-004-2706-7","journal-title":"J. Glob. Optim."},{"key":"31_CR32","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.amc.2014.08.092","volume":"255","author":"AS Strekalovsky","year":"2015","unstructured":"Strekalovsky, A.S.: On local search in d.c. optimization problems. Appl. Math. Comput. 255, 73\u201383 (2015)","journal-title":"Appl. Math. Comput."},{"key":"31_CR33","first-page":"380","volume":"43","author":"A Strekalovsky","year":"2003","unstructured":"Strekalovsky, A.: On the minimization of the difference of convex functions on a feasible set. Comput. Math. Math. Phys. 43, 380\u2013390 (2003)","journal-title":"Comput. Math. Math. Phys."},{"key":"31_CR34","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-1-4939-0808-0_23","volume-title":"Optimization in Science and Engineering","author":"AS Strekalovsky","year":"2014","unstructured":"Strekalovsky, A.S.: On solving optimization problems with hidden nonconvex structures. In: Rassias, T.M., Floudas, C.A., Butenko, S. (eds.) Optimization in Science and Engineering, pp. 465\u2013502. Springer, New York (2014). https:\/\/doi.org\/10.1007\/978-1-4939-0808-0_23"},{"key":"31_CR35","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.ins.2020.08.121","volume":"545","author":"AV Ushakov","year":"2021","unstructured":"Ushakov, A.V., Vasilyev, I.: Near-optimal large-scale k-medoids clustering. Inf. Sci. 545, 344\u2013362 (2021). https:\/\/doi.org\/10.1016\/j.ins.2020.08.121","journal-title":"Inf. Sci."},{"issue":"1","key":"31_CR36","first-page":"229","volume":"13","author":"AV Ushakov","year":"2015","unstructured":"Ushakov, A.V., Vasilyev, I.L., Gruzdeva, T.V.: A computational comparison of the p-median clustering and k-means. Int. J. Artif. Intell. 13(1), 229\u2013242 (2015)","journal-title":"Int. J. Artif. Intell."},{"issue":"326","key":"31_CR37","doi-asserted-by":"publisher","first-page":"506","DOI":"10.2307\/2283635","volume":"64","author":"HD Vinod","year":"1969","unstructured":"Vinod, H.D.: Integer programming and the theory of grouping. J. Am. Stat. Assoc. 64(326), 506\u2013519 (1969). https:\/\/doi.org\/10.2307\/2283635","journal-title":"J. Am. Stat. Assoc."},{"issue":"2","key":"31_CR38","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/A:1009783824328","volume":"1","author":"T Zhang","year":"1997","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: a new data clustering algorithm and its applications. Data Min. Knowl. Discov. 1(2), 141\u2013182 (1997). https:\/\/doi.org\/10.1023\/A:1009783824328","journal-title":"Data Min. Knowl. Discov."}],"container-title":["Lecture Notes in Computer Science","Mathematical Optimization Theory and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77876-7_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T21:18:46Z","timestamp":1699132726000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77876-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030778750","9783030778767"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77876-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"14 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOTOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Optimization Theory and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Irkutsk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"motor2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.icc.ru\/e\/motor2021","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"102","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":"29","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":"1","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":"28% - 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":"3,4","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":"2,5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}