{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:52:51Z","timestamp":1743105171847,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030166915"},{"type":"electronic","value":"9783030166922"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-16692-2_37","type":"book-chapter","created":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T19:44:24Z","timestamp":1554839064000},"page":"550-564","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fundamental Flowers: Evolutionary Discovery of Coresets for Classification"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3155-2564","authenticated-orcid":false,"given":"Pietro","family":"Barbiero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5895-4809","authenticated-orcid":false,"given":"Alberto","family":"Tonda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,30]]},"reference":[{"key":"37_CR1","unstructured":"Bachem, O., Lucic, M., Krause, A.: Practical coreset constructions for machine learning. arXiv preprint \n                      arXiv:1703.06476\n                      \n                     (2017)"},{"key":"37_CR2","unstructured":"Huggins, J.H., Campbell, T., Broderick, T.: Coresets for scalable bayesian logistic regression. In: 30th Annual Conference on Neural Information Processing Systems (NIPS) (2016). \n                      https:\/\/arxiv.org\/pdf\/1605.06423.pdf"},{"key":"37_CR3","unstructured":"Campbell, T., Broderick, T.: Bayesian coreset construction via greedy iterative geodesic ascent. In: International Conference on Machine Learning (ICML) (2018). \n                      https:\/\/arxiv.org\/pdf\/1802.01737.pdf"},{"key":"37_CR4","unstructured":"Clarkson, K.L.: Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm. ACM Trans. Algorithms 6(4), 63 (2010). \n                      http:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.145.9299&rep=rep1&type=pdf"},{"key":"37_CR5","volume-title":"Mathematical Methods for Digital Computers","author":"MA Efroymson","year":"1960","unstructured":"Efroymson, M.A.: Multiple regression analysis. In: Ralston, A., Wilf, H.S. (eds.) Mathematical Methods for Digital Computers. Wiley, New York (1960)"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Efron, B., Hastie, T., Johnstone, I., Tibshirani, R.: Least angle regression. Ann. Stat. 32(2), 407\u2013451 (2004). \n                      https:\/\/arxiv.org\/pdf\/math\/0406456.pdf","DOI":"10.1214\/009053604000000067"},{"key":"37_CR7","unstructured":"Boutsidis, C., Drineas, P., Magdon-Ismail, M.: Near-optimal coresets for least-squares regression. Technical report (2013). \n                      https:\/\/arxiv.org\/pdf\/1202.3505.pdf"},{"issue":"12","key":"37_CR8","doi-asserted-by":"publisher","first-page":"3397","DOI":"10.1109\/78.258082","volume":"42","author":"S Mallat","year":"1993","unstructured":"Mallat, S., Zhang, Z.: Matching pursuits with time-frequency dictionaries. IEEE Trans. Signal Process. 42(12), 3397\u20133415 (1993)","journal-title":"IEEE Trans. Signal Process."},{"key":"37_CR9","unstructured":"Pati, Y., Rezaiifar, R., Krishnaprasad, P.: Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition. In: Proceedings of 27th Asilomar Conference on Signals, Systems and Computers, pp. 40\u201344 (1993). \n                      http:\/\/ieeexplore.ieee.org\/document\/342465\/"},{"issue":"2","key":"37_CR10","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-ii. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"37_CR11","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1147\/rd.33.0210","volume":"3","author":"AL Samuel","year":"1959","unstructured":"Samuel, A.L.: Some studies in machine learning using the game of checkers. IBM J. Res. Dev. 3(3), 210\u2013229 (1959)","journal-title":"IBM J. Res. Dev."},{"key":"37_CR12","volume-title":"Classification and Regression Trees","author":"L Breiman","year":"1984","unstructured":"Breiman, L., Friedman, J., Stone, C.J., Olshen, R.A.: Classification and Regression Trees. CRC Press, Boca Raton (1984)"},{"key":"37_CR13","unstructured":"Cox, D.R.: The regression analysis of binary sequences. J. Roy. Stat. Soc.: Ser. B (Methodol.) 20(2), 215\u2013242 (1958)"},{"key":"37_CR14","volume-title":"Deep Learning","author":"I Goodfellow","year":"2016","unstructured":"Goodfellow, I., Bengio, Y., Courville, A.: Deep Learning. MIT press, Massachusetts (2016)"},{"key":"37_CR15","first-page":"363","volume":"6","author":"IW Tsang","year":"2005","unstructured":"Tsang, I.W., Kwok, J.T., Cheung, P.M.: Core vector machines: fast SVM training on very large data sets. J. Mach. Learn. Res. 6, 363\u2013392 (2005)","journal-title":"J. Mach. Learn. Res."},{"key":"37_CR16","unstructured":"Campbell, T., Broderick, T.: Automated Scalable Bayesian Inference via Hilbert Coresets (2017). \n                      http:\/\/arxiv.org\/abs\/1710.05053"},{"issue":"1\u20132","key":"37_CR17","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1023\/A:1007563306331","volume":"36","author":"L Breiman","year":"1999","unstructured":"Breiman, L.: Pasting small votes for classification in large databases and on-line. Mach. Learn. 36(1\u20132), 85\u2013103 (1999)","journal-title":"Mach. Learn."},{"issue":"5","key":"37_CR18","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1214\/aos\/1013203451","volume":"29","author":"JH Friedman","year":"2001","unstructured":"Friedman, J.H.: Greedy function approximation: a gradient boosting machine. Ann. Stat. 29(5), 1189\u20131232 (2001)","journal-title":"Ann. Stat."},{"issue":"1","key":"37_CR19","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001)","journal-title":"Mach. Learn."},{"key":"37_CR20","first-page":"195","volume":"39","author":"AN Tikhonov","year":"1943","unstructured":"Tikhonov, A.N.: On the stability of inverse problems. Dokl. Akad. Nauk SSSR. 39, 195\u2013198 (1943)","journal-title":"Dokl. Akad. Nauk SSSR."},{"issue":"4","key":"37_CR21","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/5254.708428","volume":"13","author":"MA Hearst","year":"1998","unstructured":"Hearst, M.A., Dumais, S.T., Osman, E., Platt, J., Scholkopf, B.: Support vector machines. IEEE Intell. Syst. Appl. 13(4), 18\u201328 (1998)","journal-title":"IEEE Intell. Syst. Appl."},{"key":"37_CR22","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":"37_CR23","unstructured":"Garrett, A.: inspyred (version 1.0.1) inspired intelligence (2012). \n                      https:\/\/github.com\/aarongarrett\/inspyred"},{"issue":"2","key":"37_CR24","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1111\/j.1469-1809.1936.tb02137.x","volume":"7","author":"RA Fisher","year":"1936","unstructured":"Fisher, R.A.: The use of multiple measurements in taxonomic problems. Ann. Eugenics 7(2), 179\u2013188 (1936)","journal-title":"Ann. Eugenics"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16692-2_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:05:06Z","timestamp":1558343106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-16692-2_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030166915","9783030166922"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16692-2_37","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":"30 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoApplications","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Applications of Evolutionary Computation (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leipzig","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"24 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2019\/cfp_evoapps.php","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"}},{"value":"MyReview","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"44","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"24","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"67% - 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"}},{"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"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}