{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:29:23Z","timestamp":1742974163947,"version":"3.40.3"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030110260"},{"type":"electronic","value":"9783030110277"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-11027-7_28","type":"book-chapter","created":{"date-parts":[[2018,12,30]],"date-time":"2018-12-30T21:33:52Z","timestamp":1546205632000},"page":"294-304","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Exact Algorithms for the Special Cases of Two Hard to Solve Problems of Searching for the Largest Subset"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Kel\u2019manov","sequence":"first","affiliation":[]},{"given":"Vladimir","family":"Khandeev","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Panasenko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,31]]},"reference":[{"key":"28_CR1","unstructured":"MacQueen, J.B.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, University of California Press, Berkeley, vol. 1, pp. 281\u2013297 (1967)"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1080\/01621459.1971.10482319","volume":"66","author":"M Rao","year":"1971","unstructured":"Rao, M.: Cluster analysis and mathematical programming. J. Am. Stat. Assoc. 66, 622\u2013626 (1971)","journal-title":"J. Am. Stat. Assoc."},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s003579900019","volume":"15","author":"P Hansen","year":"1998","unstructured":"Hansen, P., Jaumard, B., Mladenovich, N.: Minimum sum of squares clustering in a low dimensional space. J. Classif. 15, 37\u201355 (1998)","journal-title":"J. Classif."},{"key":"28_CR4","first-page":"191","volume":"79","author":"P Hansen","year":"1997","unstructured":"Hansen, P., Jaumard, B.: Cluster analysis and mathematical programming. Math. Program. 79, 191\u2013215 (1997)","journal-title":"Math. Program."},{"key":"28_CR5","volume-title":"Statistical Methods and Scientific Inference","author":"RA Fisher","year":"1956","unstructured":"Fisher, R.A.: Statistical Methods and Scientific Inference. Hafner, New York (1956)"},{"issue":"8","key":"28_CR6","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain, A.K.: Data clustering: 50 years beyond $$k$$-means. Pattern Recogn. Lett. 31(8), 651\u2013666 (2010)","journal-title":"Pattern Recogn. Lett."},{"issue":"2","key":"28_CR7","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."},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/B:MACH.0000033113.59016.96","volume":"56","author":"P Drineas","year":"2004","unstructured":"Drineas, P., Frieze, A., Kannan, R., Vempala, S., Vinay, V.: Clustering large graphs via the singular value decomposition. Mach. Learn. 56, 9\u201333 (2004)","journal-title":"Mach. Learn."},{"issue":"2","key":"28_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)","journal-title":"J. Appl. Ind. Math."},{"key":"28_CR10","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. Theoret. Comput. Sci. 442, 13\u201321 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"28_CR11","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1134\/S1064562408040273","volume":"78","author":"AV Kel\u2019manov","year":"2008","unstructured":"Kel\u2019manov, A.V., Pyatkin, A.V.: On the complexity of a search for a subset of \u201csimilar\u201d vectors. Doklady Math. 78(1), 574\u2013575 (2008)","journal-title":"Doklady Math."},{"issue":"4","key":"28_CR12","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1134\/S1990478909040036","volume":"3","author":"AV Kel\u2019manov","year":"2009","unstructured":"Kel\u2019manov, A.V., Pyatkin, A.V.: On a version of the problem of choosing a vector subset. J. Appl. Ind. Math. 3(4), 447\u2013455 (2009)","journal-title":"J. Appl. Ind. Math."},{"key":"28_CR13","series-title":"LNEMS","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-95322-4_5","volume-title":"Optimization and Operations Research","author":"P Brucker","year":"1978","unstructured":"Brucker, P.: On the complexity of clustering problems. In: Henn, R., Korte, B., Oettli, W. (eds.) Optimization and Operations Research. LNEMS, vol. 157, pp. 45\u201354. Springer, Heidelberg (1978). https:\/\/doi.org\/10.1007\/978-3-642-95322-4_5"},{"key":"28_CR14","unstructured":"Bern, M., Eppstein, D.: Approximation algorithms for geometric problems. In: Approximation Algorithms for NP-Hard Problems, pp. 296\u2013345. PWS Publishing, Boston (1997)"},{"key":"28_CR15","unstructured":"Indyk, P.: A sublinear time approximation scheme for clustering in metric space. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 154\u2013159 (1999)"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1006\/jcss.2001.1772","volume":"63","author":"F de la Vega","year":"2001","unstructured":"de la Vega, F., Kenyon, C.: A randomized approximation scheme for metric max-cut. J. Comput. Syst. Sci. 63, 531\u2013541 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"de la Vega, F., Karpinski, M., Kenyon, C., Rabani, Y.: Polynomial time approximation schemes for metric min-sum clustering. Electronic Colloquium on Computational Complexity (ECCC). Report No. 25 (2002)","DOI":"10.1145\/780542.780550"},{"key":"28_CR18","unstructured":"Hasegawa, S., Imai, H., Inaba, M., Katoh, N., Nakano, J.: Efficient algorithms for variance-based $$k$$-clustering. In: Proceedings of the 1st Pacific Conference on Computer Graphics and Applications, Pacific Graphics 1993, Seoul, Korea, vol. 1. pp. 75\u201389. World Scientific, River Edge (1993)"},{"key":"28_CR19","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), 6\u20138 June 1994, Stony Brook, NY, USA, pp. 332\u2013339. ACM, New York (1994)","DOI":"10.1145\/177424.178042"},{"key":"28_CR20","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.: P-complete approximation problems. J. ACM 23, 555\u2013566 (1976)","journal-title":"J. ACM"},{"issue":"3","key":"28_CR21","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1134\/S1064562414030235","volume":"89","author":"AA Ageev","year":"2014","unstructured":"Ageev, A.A., Kel\u2019manov, A.V., Pyatkin, A.V.: NP-hardness of the Euclidean maxcut problem. Doklady Math. 89(3), 343\u2013345 (2014)","journal-title":"Doklady Math."},{"issue":"4","key":"28_CR22","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1134\/S1990478914040012","volume":"8","author":"AA Ageev","year":"2014","unstructured":"Ageev, A.A., Kel\u2019manov, A.V., Pyatkin, A.V.: Complexity of the weighted max-cut in Euclidean space. J. Appl. Ind. Math. 8(4), 453\u2013457 (2014)","journal-title":"J. Appl. Ind. Math."},{"issue":"2","key":"28_CR23","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1134\/S1064562415050233","volume":"92","author":"AV Kel\u2019manov","year":"2015","unstructured":"Kel\u2019manov, A.V., Pyatkin, A.V.: NP-hardness of some quadratic Euclidean 2-clustering problems. Doklady Math. 92(2), 634\u2013637 (2015)","journal-title":"Doklady Math."},{"issue":"3","key":"28_CR24","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1134\/S096554251603009X","volume":"56","author":"AV Kel\u2019manov","year":"2016","unstructured":"Kel\u2019manov, A.V., Pyatkin, A.V.: On the complexity of some quadratic Euclidean 2-clustering problems. Comput. Math. Math. Phys. 56(3), 491\u2013497 (2016)","journal-title":"Comput. Math. Math. Phys."},{"key":"28_CR25","volume-title":"Pattern Recognition and Machine Learning","author":"CM Bishop","year":"2006","unstructured":"Bishop, C.M.: Pattern Recognition and Machine Learning. Springer Science+Business Media, LLC, New York (2006)"},{"key":"28_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-7138-7","volume-title":"An Introduction to Statistical Learning","author":"G James","year":"2013","unstructured":"James, G., Witten, D., Hastie, T., Tibshirani, R.: An Introduction to Statistical Learning. Springer Science+Business Media, LLC, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-7138-7"},{"key":"28_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7","volume-title":"The Elements of Statistical Learning","author":"T Hastie","year":"2009","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning, 2nd edn. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-0-387-84858-7","edition":"2"},{"key":"28_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14142-8","volume-title":"Data Mining: The Textbook","author":"CC Aggarwal","year":"2015","unstructured":"Aggarwal, C.C.: Data Mining: The Textbook. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-14142-8"},{"key":"28_CR29","unstructured":"Goodfellow, I., Bengio, Y., Courville, A.: Deep Learning. Adaptive Computation and Machine Learning Series. The MIT Press, Cambridge (2017)"},{"key":"28_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/978-3-319-09156-3_49","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2014","author":"AS Shirkhorshidi","year":"2014","unstructured":"Shirkhorshidi, A.S., Aghabozorgi, S., Wah, T.Y., Herawan, T.: Big data clustering: a review. In: Murgante, B., et al. (eds.) ICCSA 2014. LNCS, vol. 8583, pp. 707\u2013720. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09156-3_49"},{"key":"28_CR31","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033203","volume-title":"Combinatorial Geometry","author":"J Pach","year":"1995","unstructured":"Pach, J., Agarwal, P.K.: Combinatorial Geometry. Wiley, New York (1995)"},{"issue":"4","key":"28_CR32","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1134\/S1990478913040066","volume":"7","author":"AV Kel\u2019manov","year":"2013","unstructured":"Kel\u2019manov, A.V., Khandeev, V.I.: A 2-approximation polynomial algorithm for a clustering problem. J. Appl. Ind. Math. 7(4), 515\u2013521 (2013)","journal-title":"J. Appl. Ind. Math."},{"key":"28_CR33","unstructured":"Gimadi, E.Kh., Kel\u2019manov, A.V., Kel\u2019manova, M.A., Khamidullin, S.A.: A posteriori detection of a quasi periodic fragment in numerical sequences with given number of recurrences. Siberian J. Ind. Math. 9(1(25)), 55\u201374 (2006). (in Russian)"},{"issue":"1","key":"28_CR34","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1134\/S1054661808010057","volume":"18","author":"EK Gimadi","year":"2008","unstructured":"Gimadi, E.K., Kel\u2019manov, A.V., Kel\u2019manova, M.A., Khamidullin, S.A.: A posteriori detecting a quasiperiodic fragment in a numerical sequence. Pattern Recogn. Image Anal. 18(1), 30\u201342 (2008)","journal-title":"Pattern Recogn. Image Anal."},{"issue":"1","key":"28_CR35","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1134\/S1990478908010043","volume":"2","author":"AE Baburin","year":"2008","unstructured":"Baburin, A.E., Gimadi, E.K., Glebov, N.I., Pyatkin, A.V.: The problem of finding a subset of vectors with the maximum total weight. J. Appl. Ind. Math. 2(1), 32\u201338 (2008)","journal-title":"J. Appl. Ind. Math."},{"issue":"4","key":"28_CR36","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1134\/S1990478911040107","volume":"5","author":"AV Dolgushev","year":"2011","unstructured":"Dolgushev, A.V., Kel\u2019manov, A.V.: An approximation algorithm for solving a problem of cluster analysis. J. Appl. Ind. Math. 5(4), 551\u2013558 (2011)","journal-title":"J. Appl. Ind. Math."},{"issue":"Suppl. 1","key":"28_CR37","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1134\/S0081543816090066","volume":"295","author":"AV Dolgushev","year":"2016","unstructured":"Dolgushev, A.V., Kel\u2019manov, A.V., Shenmaier, V.V.: Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters. Proc. Steklov Inst. Math. 295(Suppl. 1), 47\u201356 (2016)","journal-title":"Proc. Steklov Inst. Math."},{"issue":"2","key":"28_CR38","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1134\/S096554251502013X","volume":"55","author":"AV Kel\u2019manov","year":"2015","unstructured":"Kel\u2019manov, A.V., Khandeev, V.I.: A randomized algorithm for two-cluster partition of a set of vectors. Comput. Math. Math. Phys. 55(2), 330\u2013339 (2015)","journal-title":"Comput. Math. Math. Phys."},{"issue":"1","key":"28_CR39","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1134\/S1990478910010084","volume":"4","author":"EK Gimadi","year":"2010","unstructured":"Gimadi, E.K., Pyatkin, A.V., Rykov, I.A.: On polynomial solvability of some problems of a vector subset choice in a Euclidean space of fixed dimension. J. Appl. Ind. Math. 4(1), 48\u201353 (2010)","journal-title":"J. Appl. Ind. Math."},{"issue":"4","key":"28_CR40","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1134\/S199047891604013X","volume":"10","author":"VV Shenmaier","year":"2016","unstructured":"Shenmaier, V.V.: Solving some vector subset problems by Voronoi diagrams. J. Appl. Ind. Math. 10(4), 560\u2013566 (2016)","journal-title":"J. Appl. Ind. Math."},{"issue":"4","key":"28_CR41","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1134\/S1990478915040067","volume":"9","author":"AV Kel\u2019manov","year":"2015","unstructured":"Kel\u2019manov, A.V., Khandeev, V.I.: An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors. J. Appl. Ind. Math. 9(4), 497\u2013502 (2015)","journal-title":"J. Appl. Ind. Math."},{"issue":"2","key":"28_CR42","first-page":"334","volume":"56","author":"AV Kel\u2019manov","year":"2016","unstructured":"Kel\u2019manov, A.V., Khandeev, V.I.: Fully polynomial-time approximation scheme for a special case of a quadratic euclidean 2-clustering problem. J. Appl. Ind. Math. 56(2), 334\u2013341 (2016)","journal-title":"J. Appl. Ind. Math."},{"issue":"1","key":"28_CR43","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1134\/S0965542518010074","volume":"58","author":"AV Kel\u2019manov","year":"2018","unstructured":"Kel\u2019manov, A.V., Motkova, A.V.: Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center. Comput. Math. Math. Phys. 58(1), 130\u2013136 (2018)","journal-title":"Comput. Math. Math. Phys."},{"issue":"3","key":"28_CR44","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1134\/S1990478916030054","volume":"10","author":"AV Kel\u2019manov","year":"2016","unstructured":"Kel\u2019manov, A.V., Motkova, A.V.: Exact pseudopolynomial algorithms for a balanced 2-clustering problem. J. Appl. Ind. Math. 10(3), 349\u2013355 (2016)","journal-title":"J. Appl. Ind. Math."},{"key":"28_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-319-44914-2_15","volume-title":"Discrete Optimization and Operations Research","author":"A Kel\u2019manov","year":"2016","unstructured":"Kel\u2019manov, A., Motkova, A.: A fully polynomial-time approximation scheme for a special case of a balanced 2-clustering problem. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. LNCS, vol. 9869, pp. 182\u2013192. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44914-2_15"},{"key":"28_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-319-73013-4_30","volume-title":"Analysis of Images, Social Networks and Texts","author":"A Kel\u2019manov","year":"2018","unstructured":"Kel\u2019manov, A., Motkova, A., Shenmaier, V.: An approximation scheme for a weighted two-cluster partition problem. In: van der Aalst, W.M.P., et al. (eds.) AIST 2017. LNCS, vol. 10716, pp. 323\u2013333. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73013-4_30"},{"key":"28_CR47","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-319-93800-4_9","volume-title":"Optimization Problems and Their Applications","author":"A Kel\u2019manov","year":"2018","unstructured":"Kel\u2019manov, A., Khandeev, V., Panasenko, A.: Randomized algorithms for some clustering problems. In: Eremeev, A., Khachay, M., Kochetov, Y., Pardalos, P. (eds.) OPTA 2018. CCIS, vol. 871, pp. 109\u2013119. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93800-4_9"}],"container-title":["Lecture Notes in Computer Science","Analysis of Images, Social Networks and Texts"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-11027-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:41:00Z","timestamp":1710333660000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-11027-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030110260","9783030110277"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-11027-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"31 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Analysis of Images, Social Networks and Texts","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aist2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aistconf.org\/","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":"81","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":"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":"36% - 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","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":"1.58","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)"}},{"value":"107 papers were sent and 26 of these were rejected without reviewing. 1 other paper was accepted due to the interdisciplinary nature of the paper.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}