{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:16:36Z","timestamp":1743092196666,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030210762"},{"type":"electronic","value":"9783030210779"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-21077-9_3","type":"book-chapter","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T23:14:41Z","timestamp":1560899681000},"page":"25-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Comprehensive Methodology to Find Closed Mathematical Models from Experimental Data"],"prefix":"10.1007","author":[{"given":"Angel","family":"Kuri-Morales","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,18]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-319-06483-3_30","volume-title":"Advances in Artificial Intelligence","author":"A Kuri-Morales","year":"2014","unstructured":"Kuri-Morales, A., Cartas-Ayala, A.: Polynomial multivariate approximation with genetic algorithms. In: Sokolova, M., van Beek, P. (eds.) AI 2014. LNCS (LNAI), vol. 8436, pp. 307\u2013312. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06483-3_30"},{"issue":"4","key":"3_CR2","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1109\/72.80265","volume":"1","author":"NE Cotter","year":"1990","unstructured":"Cotter, N.E.: The Stone-Weierstrass theorem and its application to neural networks. IEEE Trans. Neural Netw. 1(4), 290\u2013295 (1990)","journal-title":"IEEE Trans. Neural Netw."},{"key":"3_CR3","unstructured":"https:\/\/archive.ics.uci.edu\/ml\/datasets\/wine. Wine Data Set: Accessed 27 Nov 2018"},{"key":"3_CR4","volume-title":"Neural Networks: A Comprehensive Foundation","author":"S Haykin","year":"1994","unstructured":"Haykin, S.: Neural Networks: A Comprehensive Foundation. Prentice Hall PTR, Upper Saddle River (1994)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Bastian, M., Heymann, S., Jacomy, M.: Gephi: an open source software for exploring and manipulating networks. In: ICWSM, vol. 8, no. 2009, pp. 361\u2013362 (2009)","DOI":"10.1609\/icwsm.v3i1.13937"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-45111-9_2","volume-title":"Advances in Soft Computing and Its Applications","author":"AF Kuri-Morales","year":"2013","unstructured":"Kuri-Morales, A.F., Aldana-Bobadilla, E., L\u00f3pez-Pe\u00f1a, I.: The best genetic algorithm II. In: Castro, F., Gelbukh, A., Gonz\u00e1lez, M. (eds.) MICAI 2013. LNCS (LNAI), vol. 8266, pp. 16\u201329. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45111-9_2"},{"key":"3_CR7","unstructured":"Cheney, W., Kincaid, D.: Linear Algebra: Theory and Applications. The Australian Mathematical Society, p. 110 (2009)"},{"issue":"4","key":"3_CR8","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF02551274","volume":"2","author":"G Cybenko","year":"1989","unstructured":"Cybenko, G.: Approximation by superpositions of a sigmoidal function. Math. Control Signals Syst. 2(4), 303\u2013314 (1989)","journal-title":"Math. Control Signals Syst."},{"key":"3_CR9","unstructured":"Dheeru, D., Karra Taniskidou, E.: UCI machine learning repository (2017). http:\/\/archive.ics.uci.edu\/ml"},{"key":"3_CR10","unstructured":"Alcal\u00e1-Fdez, J., et al.: Keel data-mining software tool: data set repository, integration of algorithms and experimental analysis framework. J. Multiple-Valued Logic Soft Comput. 17 (2011)"},{"issue":"11","key":"3_CR11","doi-asserted-by":"publisher","first-page":"1917","DOI":"10.1109\/26.61469","volume":"38","author":"A Moffat","year":"1990","unstructured":"Moffat, A.: Implementing the PPM data compression scheme. IEEE Trans. Commun. 38(11), 1917\u20131921 (1990)","journal-title":"IEEE Trans. Commun."},{"key":"3_CR12","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"PMB Vit\u00e1nyi","year":"2008","unstructured":"Vit\u00e1nyi, P.M.B., Li, M.: An Introduction to Kolmogorov Complexity and Its Applications. TCS, vol. 34. Springer, New York (2008). https:\/\/doi.org\/10.1007\/978-0-387-49820-1"},{"issue":"2","key":"3_CR13","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1080\/00031305.1984.10483182","volume":"38","author":"JG Saw","year":"1984","unstructured":"Saw, J.G., Yang, M.C.K., Mo, T.C.: Chebyshev inequality with estimated mean and variance. Am. Stat. 38(2), 130\u2013132 (1984)","journal-title":"Am. Stat."},{"key":"3_CR14","unstructured":"Kohavi, R., Becker, B.: Data Mining and Visualization. Silicon Graphics. https:\/\/archive.ics.uci.edu\/ml\/datasets\/Census+Income"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-030-04491-6_12","volume-title":"Advances in Soft Computing","author":"A Kuri-Morales","year":"2018","unstructured":"Kuri-Morales, A.: Transforming mixed data bases for machine learning: a case study. In: Batyrshin, I., Mart\u00ednez-Villase\u00f1or, M., Ponce Espinosa, H. (eds.) MICAI 2018. LNCS (LNAI), vol. 11288, pp. 157\u2013170. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04491-6_12"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21077-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,19]],"date-time":"2024-07-19T22:40:38Z","timestamp":1721428838000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21077-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030210762","9783030210779"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21077-9_3","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":"18 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MCPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexican Conference on Pattern Recognition","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Quer\u00e9taro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","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":"26 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mcpr22019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.mcpr.org.mx","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":"86","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":"40","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":"47% - 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":"2.82","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.39","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}