{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T10:31:41Z","timestamp":1763202701540,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031272493"},{"type":"electronic","value":"9783031272509"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-27250-9_10","type":"book-chapter","created":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T00:03:18Z","timestamp":1678320198000},"page":"134-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Investigating Innovized Progress Operators with\u00a0Different Machine Learning Methods"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9318-5563","authenticated-orcid":false,"given":"Drishti","family":"Bhasin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3046-221X","authenticated-orcid":false,"given":"Sajag","family":"Swami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4980-0415","authenticated-orcid":false,"given":"Sarthak","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0335-2637","authenticated-orcid":false,"given":"Saumya","family":"Sah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7809-7744","authenticated-orcid":false,"given":"Dhish Kumar","family":"Saxena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7402-9939","authenticated-orcid":false,"given":"Kalyanmoy","family":"Deb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,9]]},"reference":[{"issue":"1","key":"10_CR1","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). https:\/\/doi.org\/10.1023\/A:1010933404324","journal-title":"Mach. Learn."},{"issue":"12","key":"10_CR2","doi-asserted-by":"publisher","first-page":"4129","DOI":"10.1109\/TCYB.2018.2859171","volume":"49","author":"L Chen","year":"2019","unstructured":"Chen, L., Liu, H.L., Tan, K.C., Cheung, Y.M., Wang, Y.: Evolutionary many-objective algorithm using decomposition-based dominance relationship. IEEE Trans. Cybern. 49(12), 4129\u20134139 (2019). https:\/\/doi.org\/10.1109\/TCYB.2018.2859171","journal-title":"IEEE Trans. Cybern."},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Chen, T., Guestrin, C.: XGBoost: a scalable tree boosting system, pp. 785\u2013794 (2016). https:\/\/doi.org\/10.1145\/2939672.2939785","DOI":"10.1145\/2939672.2939785"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s40747-017-0039-7","volume":"3","author":"R Cheng","year":"2017","unstructured":"Cheng, R., et al.: A benchmark test suite for evolutionary many-objective optimization. Complex Intell. Syst. 3(1), 67\u201381 (2017). https:\/\/doi.org\/10.1007\/s40747-017-0039-7","journal-title":"Complex Intell. Syst."},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/TIT.1968.1054098","volume":"14","author":"T Cover","year":"1968","unstructured":"Cover, T.: Estimation by the nearest neighbor rule. IEEE Trans. Inf. Theory 14(1), 50\u201355 (1968). https:\/\/doi.org\/10.1109\/TIT.1968.1054098","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"10_CR6","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE Trans. Evol. Comput. 18(4), 577\u2013601 (2014). https:\/\/doi.org\/10.1109\/TEVC.2013.2281535","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/1-84628-137-7_6","volume-title":"Evolutionary Multiobjective Optimization: Theoretical Advances and Applications","author":"K Deb","year":"2005","unstructured":"Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable test problems for evolutionary multiobjective optimization. In: Abraham, A., Jain, L., Goldberg, R. (eds.) Evolutionary Multiobjective Optimization: Theoretical Advances and Applications, pp. 105\u2013145. Springer, London (2005). https:\/\/doi.org\/10.1007\/1-84628-137-7_6"},{"issue":"7","key":"10_CR8","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1109\/TSMC.2017.2654301","volume":"48","author":"M Elarbi","year":"2018","unstructured":"Elarbi, M., Bechikh, S., Gupta, A., Ben Said, L., Ong, Y.: A new decomposition-based NSGA-II for many-objective optimization. IEEE Trans. Syst. Man Cybern.: Syst. 48(7), 1191\u20131210 (2018). https:\/\/doi.org\/10.1109\/TSMC.2017.2654301","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Goldstein, B.A., Polley, E.C., Briggs, F.B.S.: Random forests for genetic association studies. Stat. Appl. Genet. Mol. Biol. 10(1) (2011). https:\/\/doi.org\/10.2202\/1544-6115.1691","DOI":"10.2202\/1544-6115.1691"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Hussain, J.N.: High dimensional data challenges in estimating multiple linear regression. In: Journal of Physics: Conference Series, vol. 1591, no. 1, p. 012035 (2020). https:\/\/doi.org\/10.1088\/1742-6596\/1591\/1\/012035","DOI":"10.1088\/1742-6596\/1591\/1\/012035"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"81701","DOI":"10.1109\/ACCESS.2019.2920698","volume":"7","author":"J Liu","year":"2019","unstructured":"Liu, J., Wang, Y., Wei, S., Wu, X., Tong, W.: A parameterless penalty rule-based fitness estimation for decomposition-based many-objective optimization evolutionary algorithm. IEEE Access 7, 81701\u201381716 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2920698","journal-title":"IEEE Access"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Mittal, S., Saxena, D.K., Deb, K., Goodman, E.D.: A learning-based Innovized progress operator for faster convergence in evolutionary multi-objective optimization. ACM Trans. Evol. Learn. Optim. 2(1) (2021). https:\/\/doi.org\/10.1145\/3474059","DOI":"10.1145\/3474059"},{"issue":"5","key":"10_CR13","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1109\/TEVC.2021.3131952","volume":"26","author":"S Mittal","year":"2022","unstructured":"Mittal, S., Saxena, D.K., Deb, K., Goodman, E.D.: Enhanced Innovized progress operator for evolutionary multi- and many-objective optimization. IEEE Trans. Evol. Comput. 26(5), 961\u2013975 (2022). https:\/\/doi.org\/10.1109\/TEVC.2021.3131952","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10_CR14","unstructured":"Mittal, S., Saxena, D.K., Deb, K., Goodman, E.D.: A unified Innovized progress operator for performance enhancement in evolutionary multi- and many-objective optimization. Technical report. 2022006, Computational Optimization and Innovation Laboratory, Michigan State University, East Lansing, MI-48824, USA (2022). https:\/\/coin-lab.org\/content\/publications.html"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Ogutu, J., Schulz-Streeck, T., Piepho, H.P.: Genomic selection using regularized linear regression models: ridge regression, lasso, elastic net and their extensions. BMC Proc. 6(2), S10 (2012). https:\/\/doi.org\/10.1186\/1753-6561-6-S2-S10","DOI":"10.1186\/1753-6561-6-S2-S10"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-12598-1_16","volume-title":"Evolutionary Multi-Criterion Optimization","author":"DK Saxena","year":"2019","unstructured":"Saxena, D.K., Kapoor, S.: On timing the nadir-point estimation and\/or termination of reference-based multi- and many-objective evolutionary algorithms. In: Deb, K., et al. (eds.) EMO 2019. LNCS, vol. 11411, pp. 191\u2013202. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12598-1_16"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Saxena, D.K., Mittal, S., Kapoor, S., Deb, K.: A localized high-fidelity-dominance based many-objective evolutionary algorithm. IEEE Trans. Evol. Comput. 1 (2022). https:\/\/doi.org\/10.1109\/TEVC.2022.3188064","DOI":"10.1109\/TEVC.2022.3188064"},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TEVC.2015.2420112","volume":"20","author":"Y Yuan","year":"2016","unstructured":"Yuan, Y., Xu, H., Wang, B., Yao, X.: A new dominance relation-based evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 20(1), 16\u201337 (2016). https:\/\/doi.org\/10.1109\/TEVC.2015.2420112","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"10_CR19","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E Zitzler","year":"2000","unstructured":"Zitzler, E., Deb, K., Thiele, L.: Comparison of multiobjective evolutionary algorithms: empirical results. Evol. Comput. 8(2), 173\u2013195 (2000). https:\/\/doi.org\/10.1162\/106365600568202","journal-title":"Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Multi-Criterion Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-27250-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T00:06:41Z","timestamp":1678320401000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27250-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031272493","9783031272509"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27250-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EMO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Evolutionary Multi-Criterion Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 March 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2023","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":"emo2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/emo2023.liacs.leidenuniv.nl\/","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":"equinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"65","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":"44","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":"68% - 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.42","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.49","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}