{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:07:45Z","timestamp":1743095265537,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031149023"},{"type":"electronic","value":"9783031149030"}],"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-031-14903-0_13","type":"book-chapter","created":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T23:03:00Z","timestamp":1666134180000},"page":"121-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Directed Search Many Objective Optimization Algorithm Embodied with\u00a0Kernel Clustering Strategy"],"prefix":"10.1007","author":[{"given":"Michael Aggrey","family":"Okoth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronghua","family":"Shang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weitong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Licheng","family":"Jiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,19]]},"reference":[{"issue":"5","key":"13_CR1","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1109\/TEVC.2016.2519378","volume":"20","author":"R Cheng","year":"2016","unstructured":"Cheng, R., Jin, Y., Olhofer, M., Sendhoff, B.: A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 20(5), 773\u2013791 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/3468.650319","volume":"28","author":"CM Fonseca","year":"1998","unstructured":"Fonseca, C.M., Fleming, P.J.: Multiobjective optimization and multiple constraint handling with evolutionary algorithms. i. unified formulation. IEEE Trans. Syst. Man Cybern. Part A: Syst. Humans 28(1), 26\u201337 (1998)","journal-title":"IEEE Trans. Syst. Man Cybern. Part A: Syst. Humans"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-36970-8_10","volume-title":"Evolutionary Multi-Criterion Optimization","author":"RC Purshouse","year":"2003","unstructured":"Purshouse, R.C., Fleming, P.J.: An adaptive divide-and-conquer methodology for evolutionary multi-criterion optimisation. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds.) EMO 2003. LNCS, vol. 2632, pp. 133\u2013147. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36970-8_10"},{"issue":"3","key":"13_CR4","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1109\/TCYB.2018.2789422","volume":"49","author":"Z Gong","year":"2018","unstructured":"Gong, Z., Chen, H., Yuan, B., Yao, X.: Multiobjective learning in the model space for time series classification. IEEE Trans. Cybern. 49(3), 918\u2013932 (2018)","journal-title":"IEEE Trans. Cybern."},{"issue":"4","key":"13_CR5","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1109\/TEVC.2013.2281534","volume":"18","author":"H Jain","year":"2013","unstructured":"Jain, H., Deb, K.: An evolutionary many-objective optimization algorithm using reference-point based nondominated sorting approach, part ii: Handling constraints and extending to an adaptive approach. IEEE Trans. Evol. Comput. 18(4), 602\u2013622 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1109\/TEVC.2016.2592479","volume":"21","author":"S Jiang","year":"2017","unstructured":"Jiang, S., Yang, S.: A strength pareto evolutionary algorithm based on reference direction for multiobjective and many-objective optimization. IEEE Trans. Evol. Comput. 21(3), 329\u2013346 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2792984","volume":"48","author":"B Li","year":"2015","unstructured":"Li, B., Li, J., Tang, K., Yao, X.: Many-objective evolutionary algorithms: a survey. ACM Comput. Surv. (CSUR) 48(1), 1\u201335 (2015)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.swevo.2018.12.007","volume":"45","author":"H Li","year":"2019","unstructured":"Li, H., Deng, J., Zhang, Q., Sun, J.: Adaptive epsilon dominance in decomposition-based multiobjective evolutionary algorithm. Swarm Evol. Comput. 45, 52\u201367 (2019)","journal-title":"Swarm Evol. Comput."},{"issue":"5","key":"13_CR9","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1109\/TEVC.2018.2883094","volume":"23","author":"HK Singh","year":"2018","unstructured":"Singh, H.K., Bhattacharjee, K.S., Ray, T.: Distance-based subset selection for benchmarking in evolutionary multi\/many-objective optimization. IEEE Trans. Evol. Comput. 23(5), 904\u2013912 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"13_CR10","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: Moea\/d: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"13_CR11","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1109\/TEVC.2014.2378512","volume":"19","author":"X Zhang","year":"2014","unstructured":"Zhang, X., Tian, Y., Jin, Y.: A knee point-driven evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 19(6), 761\u2013776 (2014)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["IFIP Advances in Information and Communication Technology","Intelligence Science IV"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14903-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T07:05:00Z","timestamp":1672383900000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14903-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031149023","9783031149030"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14903-0_13","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"19 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligence Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icis2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.intsci.ac.cn\/icis2022\/home\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"85","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":"5","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":"52% - 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":"5","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)"}}]}}