{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T03:57:18Z","timestamp":1783396638994,"version":"3.54.6"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030910587","type":"print"},{"value":"9783030910594","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-91059-4_6","type":"book-chapter","created":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T15:02:57Z","timestamp":1636038177000},"page":"79-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering"],"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,11,5]]},"reference":[{"key":"6_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":"6_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":"6_CR3","doi-asserted-by":"publisher","unstructured":"Arthur, D., Vassilvitskii, S.: How slow is the k-means method? In: Amenta, N., Cheong, O. (eds.) Proceedings of the Twenty-Second Annual Symposium on Computational Geometry, SCG 2006, pp. 144\u2013153. ACM, New York (2006). https:\/\/doi.org\/10.1145\/1137856.1137880","DOI":"10.1145\/1137856.1137880"},{"key":"6_CR4","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":"6_CR5","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":"6_CR6","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."},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10898-014-0175-1","volume":"63","author":"E Carrizosa","year":"2014","unstructured":"Carrizosa, E., Alguwaizani, A., Hansen, P., Mladenovi\u0107, N.: New heuristic for harmonic means clustering. J. Glob. Optim. 63(3), 427\u2013443 (2014). https:\/\/doi.org\/10.1007\/s10898-014-0175-1","journal-title":"J. Glob. Optim."},{"key":"6_CR8","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":"6_CR9","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":"6_CR10","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":"6_CR11","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":"09","key":"6_CR12","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1109\/T-C.1975.224336","volume":"24","author":"K Fukunaga","year":"1975","unstructured":"Fukunaga, K., Narendra, P., Koontz, W.: A branch and bound clustering algorithm. IEEE Trans. Comput. 24(09), 908\u2013915 (1975). https:\/\/doi.org\/10.1109\/T-C.1975.224336","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"6_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10898-015-0319-y","volume":"66","author":"M Gaudioso","year":"2015","unstructured":"Gaudioso, M., Gruzdeva, T.V., Strekalovsky, A.S.: On numerical solving the spherical separability problem. J. Glob. Optim. 66(1), 21\u201334 (2015). https:\/\/doi.org\/10.1007\/s10898-015-0319-y","journal-title":"J. Glob. Optim."},{"issue":"3","key":"6_CR14","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."},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.amc.2017.07.074","volume":"318","author":"TV Gruzdeva","year":"2018","unstructured":"Gruzdeva, T.V., Strekalovsky, A.S.: On solving the sum-of-ratios problem. Appl. Math. Comput. 318, 260\u2013269 (2018). https:\/\/doi.org\/10.1016\/j.amc.2017.07.074","journal-title":"Appl. Math. Comput."},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-030-77876-7_31","volume-title":"Mathematical Optimization Theory and Operations Research","author":"TV Gruzdeva","year":"2021","unstructured":"Gruzdeva, T.V., Ushakov, A.V.: K-means clustering via a nonconvex optimization approach. In: Pardalos, P., Khachay, M., Kazakov, A. (eds.) MOTOR 2021. LNCS, vol. 12755, pp. 462\u2013476. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77876-7_31"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.compchemeng.2017.10.001","volume":"108","author":"TV Gruzdeva","year":"2018","unstructured":"Gruzdeva, T.V., Ushakov, A.V., Enkhbat, R.: A biobjective DC programming approach to optimization of rougher flotation process. Comput. Chem. Eng. 108, 349\u2013359 (2018). https:\/\/doi.org\/10.1016\/j.compchemeng.2017.10.001","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"6_CR18","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":"2","key":"6_CR19","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\u0107, 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":"6_CR20","doi-asserted-by":"publisher","first-page":"100","DOI":"10.2307\/2346830","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan, J.A., Wong, M.A.: Algorithm AS 136: A k-means clustering algorithm. J. R. Stat. Soc. Ser. C 28(1), 100\u2013108 (1979). https:\/\/doi.org\/10.2307\/2346830","journal-title":"J. R. Stat. Soc. Ser. C"},{"issue":"1","key":"6_CR21","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":"6_CR22","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":"6_CR23","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.asoc.2015.12.001","volume":"41","author":"A Jos\u00e9-Garc\u00eda","year":"2016","unstructured":"Jos\u00e9-Garc\u00eda, A., G\u00f3mez-Flores, W.: Automatic clustering using nature-inspired metaheuristics: a survey. Appl. Soft Comput. 41, 192\u2013213 (2016). https:\/\/doi.org\/10.1016\/j.asoc.2015.12.001","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"6_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":"2","key":"6_CR25","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). https:\/\/doi.org\/10.1109\/TIT.1982.1056489","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR26","first-page":"281","volume-title":"Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability","author":"J MacQueen","year":"1967","unstructured":"MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Cam, L.M.L., Neyman, J. (eds.) Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 281\u2013297. University of California Press, Berkeley (1967)"},{"key":"6_CR27","doi-asserted-by":"publisher","unstructured":"Mahajan, M., Nimbhorkar, P., Varadarajan, K.: The planar k-means problem is NP-hard. Theor. Comput. Sci. 442, 13\u201321 (2012). Special Issue on the Workshop on Algorithms and Computation (WALCOM 2009). https:\/\/doi.org\/10.1016\/j.tcs.2010.05.034","DOI":"10.1016\/j.tcs.2010.05.034"},{"key":"6_CR28","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":"6_CR29","series-title":"Operations Research and Financial Engineering","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-40065-5","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Operations Research and Financial Engineering, 2nd edn. Springer, New York (2006). https:\/\/doi.org\/10.1007\/978-0-387-40065-5","edition":"2"},{"key":"6_CR30","doi-asserted-by":"publisher","unstructured":"Okafor, A., Pardalos, P.: K-Means Clustering Using Entropy Minimization. Series on Computers and Operations Research, vol. 4, pp. 339\u2013351. World Scientific Publishing, Singapore (2004). https:\/\/doi.org\/10.1142\/9789812796592_0015","DOI":"10.1142\/9789812796592_0015"},{"key":"6_CR31","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10898-014-0171-5","volume":"61","author":"B Ordin","year":"2015","unstructured":"Ordin, B., Bagirov, A.M.: A heuristic algorithm for solving the minimum sum-of-squares clustering problems. J. Glob. Optim. 61, 341\u2013361 (2015). https:\/\/doi.org\/10.1007\/s10898-014-0171-5","journal-title":"J. Glob. Optim."},{"key":"6_CR32","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":"1","key":"6_CR33","doi-asserted-by":"publisher","first-page":"e0210075","DOI":"10.1371\/journal.pone.0210075","volume":"14","author":"G Shao","year":"2019","unstructured":"Shao, G., Li, D., Zhang, J., Yang, J., Shangguan, Y.: Automatic microarray image segmentation with clustering-based algorithms. PLoS ONE 14(1), e0210075 (2019). https:\/\/doi.org\/10.1371\/journal.pone.0210075","journal-title":"PLoS ONE"},{"key":"6_CR34","first-page":"73","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":"6_CR35","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":"6_CR36","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":"6_CR37","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":"6_CR38","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":"6_CR39","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."}],"container-title":["Lecture Notes in Computer Science","Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91059-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T23:03:53Z","timestamp":1638399833000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91059-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030910587","9783030910594"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91059-4_6","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":"5 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OPTIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Petrovac","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montenegro","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":"27 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"optima2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/agora.guru.ru\/display.php?conf=OPTIMA-2021","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":"63","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":"41","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":"3","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":"65% - 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.1","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)"}}]}}