{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:32:07Z","timestamp":1742913127622,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030954697"},{"type":"electronic","value":"9783030954703"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-95470-3_24","type":"book-chapter","created":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T10:07:13Z","timestamp":1643710033000},"page":"314-324","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A New Nash-Probit Model for\u00a0Binary Classification"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0659-4594","authenticated-orcid":false,"given":"Mihai-Alexandru","family":"Suciu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5572-8141","authenticated-orcid":false,"given":"Rodica Ioana","family":"Lung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,2]]},"reference":[{"key":"24_CR1","unstructured":"Dua, D., Graff, C.: UCI machine learning repository (2017). http:\/\/archive.ics.uci.edu\/ml"},{"issue":"2","key":"24_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1162\/106365601750190398","volume":"9","author":"N Hansen","year":"2001","unstructured":"Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evol. Comput. 9(2), 159\u2013195 (2001). https:\/\/doi.org\/10.1162\/106365601750190398","journal-title":"Evol. Comput."},{"key":"24_CR3","doi-asserted-by":"publisher","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning. Springer Series in Statistics. Springer, New York (2001). https:\/\/doi.org\/10.1007\/978-0-387-84858-7","DOI":"10.1007\/978-0-387-84858-7"},{"key":"24_CR4","doi-asserted-by":"publisher","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The elements of statistical learning: data mining, inference and prediction. Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-0-387-84858-7","DOI":"10.1007\/978-0-387-84858-7"},{"key":"24_CR5","unstructured":"Lung, R.I., Dumitrescu, D.: Computing Nash equilibria by means of evolutionary computation. Int. J. Comput. Commun. Control III(Suppl. Issue), 364\u2013368 (2008)"},{"key":"24_CR6","doi-asserted-by":"publisher","unstructured":"Lung, R.I., Mihoc, T.D., Dumitrescu, D.: Nash extremal optimization and large cournot games. In: Pelta, D.A., Krasnogor, N., Dumitrescu, D., Chira, C., Lung, R. (eds.) Nature Inspired Cooperative Strategies for Optimization (NICSO 2011). Studies in Computational Intelligence, vol. 387, pp. 195\u2013203. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24094-2_14","DOI":"10.1007\/978-3-642-24094-2_14"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Lung, R.I., Suciu, M.A.: Equilibrium in classification: a new game theoretic approach to supervised learning. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion, GECCO 2020, pp. 137\u2013138. Association for Computing Machinery, New York (2020)","DOI":"10.1145\/3377929.3390001"},{"key":"24_CR8","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-981-15-0657-4_9","volume-title":"Game Theory","author":"J-X Nan","year":"2019","unstructured":"Nan, J.-X., Zhang, L., Li, D.-F.: The method for solving bi-matrix games with intuitionistic fuzzy set payoffs. In: Li, D.-F. (ed.) EAGT 2019. CCIS, vol. 1082, pp. 131\u2013150. Springer, Singapore (2019). https:\/\/doi.org\/10.1007\/978-981-15-0657-4_9"},{"issue":"2","key":"24_CR9","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. Ann. Math. 54(2), 286\u2013295 (1951)","journal-title":"Ann. Math."},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Pavlidis, N., Parsopoulos, K., Vrahatis, M.: Computing Nash equilibria through computational intelligence methods. J. Comput. Appl. Math. 175(1), 113\u2013136 (2005). Selected Papers of the International Conference on Computational Methods in Sciences and Engineering","DOI":"10.1016\/j.cam.2004.06.005"},{"key":"24_CR11","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"24_CR12","doi-asserted-by":"publisher","unstructured":"Rosset, S.: Model selection via the AUC. In: Proceedings of the Twenty-First International Conference on Machine Learning, ICML 2004, p. 89. Association for Computing Machinery, New York (2004). https:\/\/doi.org\/10.1145\/1015330.1015400","DOI":"10.1145\/1015330.1015400"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-030-58112-1_37","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XVI","author":"M-A Suciu","year":"2020","unstructured":"Suciu, M.-A., Lung, R.I.: Nash equilibrium as a solution in supervised classification. In: B\u00e4ck, T., et al. (eds.) PPSN 2020. LNCS, vol. 12269, pp. 539\u2013551. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58112-1_37"}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95470-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T10:16:01Z","timestamp":1643710561000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95470-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030954697","9783030954703"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95470-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"2 February 2022","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":"Grasmere","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"4 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2021","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":"mod2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lod2021.icas.cc\/","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":"215","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":"86","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":"40% - 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-6","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-2","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)"}}]}}