{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T11:26:46Z","timestamp":1750332406414,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031302282"},{"type":"electronic","value":"9783031302299"}],"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-30229-9_40","type":"book-chapter","created":{"date-parts":[[2023,4,8]],"date-time":"2023-04-08T19:02:39Z","timestamp":1680980559000},"page":"623-639","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["AMTEA-Based Multi-task Optimisation for\u00a0Multi-objective Feature Selection in\u00a0Classification"],"prefix":"10.1007","author":[{"given":"Jiabin","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bing","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,9]]},"reference":[{"issue":"3","key":"40_CR1","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10994-007-5040-8","volume":"73","author":"A Argyriou","year":"2008","unstructured":"Argyriou, A., Evgeniou, T., Pontil, M.: Convex multi-task feature learning. Mach. Learn. 73(3), 243\u2013272 (2008)","journal-title":"Mach. Learn."},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Cao, B., Pan, S.J., Zhang, Y., Yeung, D.Y., Yang, Q.: Adaptive transfer learning. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 24, pp. 407\u2013412 (2010)","DOI":"10.1609\/aaai.v24i1.7682"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Chandra, A.: Comparison of feature selection for imbalance text datasets. In: 2019 International Conference on Information Management and Technology (ICIMTech), vol. 1, pp. 68\u201372. IEEE (2019)","DOI":"10.1109\/ICIMTech.2019.8843773"},{"key":"40_CR4","doi-asserted-by":"publisher","first-page":"7172","DOI":"10.1109\/TCYB.2020.3042243","volume":"52","author":"K Chen","year":"2020","unstructured":"Chen, K., Xue, B., Zhang, M., Zhou, F.: An evolutionary multitasking-based feature selection method for high-dimensional classification. IEEE Trans. Cybern. 52, 7172\u20137186 (2020)","journal-title":"IEEE Trans. Cybern."},{"key":"40_CR5","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1109\/TEVC.2021.3100056","volume":"26","author":"K Chen","year":"2021","unstructured":"Chen, K., Xue, B., Zhang, M., Zhou, F.: Evolutionary multitasking for feature selection in high-dimensional classification via particle swarm optimisation. IEEE Trans. Evol. Comput. 26, 446\u2013460 (2021)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"12","key":"40_CR6","doi-asserted-by":"publisher","first-page":"4365","DOI":"10.1109\/TCYB.2018.2864345","volume":"49","author":"B Da","year":"2018","unstructured":"Da, B., Gupta, A., Ong, Y.S.: Curbing negative influences online for seamless transfer evolutionary optimization. IEEE Trans. cybern. 49(12), 4365\u20134378 (2018)","journal-title":"IEEE Trans. cybern."},{"issue":"2","key":"40_CR7","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":"6","key":"40_CR8","doi-asserted-by":"publisher","first-page":"3143","DOI":"10.1109\/TCYB.2019.2962865","volume":"51","author":"L Feng","year":"2020","unstructured":"Feng, L., et al.: Explicit evolutionary multitasking for combinatorial optimization: a case study on capacitated vehicle routing problem. IEEE Trans. Cybern. 51(6), 3143\u20133156 (2020)","journal-title":"IEEE Trans. Cybern."},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves, A.R., Das, P., Chatterjee, S., Sivakumar, V., Von Zuben, F.J., Banerjee, A.: Multi-task sparse structure learning. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, pp. 451\u2013460 (2014)","DOI":"10.1145\/2661829.2662091"},{"key":"40_CR10","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.neucom.2019.01.017","volume":"333","author":"J Gonz\u00e1lez","year":"2019","unstructured":"Gonz\u00e1lez, J., Ortega, J., Damas, M., Mart\u00edn-Smith, P., Gan, J.Q.: A new multi-objective wrapper method for feature selection-accuracy and stability analysis for bci. Neurocomputing 333, 407\u2013418 (2019)","journal-title":"Neurocomputing"},{"issue":"5","key":"40_CR11","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/TEVC.2019.2962747","volume":"24","author":"J Lin","year":"2019","unstructured":"Lin, J., Liu, H.L., Xue, B., Zhang, M., Gu, F.: Multiobjective multitasking optimization based on incremental learning. IEEE Trans. Evol. Comput. 24(5), 824\u2013838 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"40_CR12","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1109\/TEVC.2019.2913831","volume":"24","author":"BH Nguyen","year":"2019","unstructured":"Nguyen, B.H., Xue, B., Andreae, P., Ishibuchi, H., Zhang, M.: Multiple reference points-based decomposition for multiobjective feature selection in classification: static and dynamic mechanisms. IEEE Trans. Evol. Comput. 24(1), 170\u2013184 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"40_CR13","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3197427","author":"BH Nguyen","year":"2022","unstructured":"Nguyen, B.H., Xue, B., Zhang, M.: A constrained competitive swarm optimiser with an SVM-based surrogate model for feature selection. IEEE Trans. Evol. Comput. (2022). https:\/\/doi.org\/10.1109\/TEVC.2022.3197427","journal-title":"IEEE Trans. Evol. Comput."},{"key":"40_CR14","doi-asserted-by":"crossref","unstructured":"Osaba, E., Del Ser, J., Martinez, A.D., Lobo, J.L., Nebro, A.J., Yang, X.S.: MO-MFCGA: multiobjective multifactorial cellular genetic algorithm for evolutionary multitasking. In: 2021 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 1\u20138. IEEE (2021)","DOI":"10.1109\/SSCI50451.2021.9660024"},{"issue":"9","key":"40_CR15","doi-asserted-by":"publisher","first-page":"1811","DOI":"10.1109\/TPAMI.2016.2618118","volume":"39","author":"N Segev","year":"2016","unstructured":"Segev, N., Harel, M., Mannor, S., Crammer, K., El-Yaniv, R.: Learn on source, refine on target: a model transfer learning framework with random forests. IEEE Trans. Pattern Anal. Mach. Intell. 39(9), 1811\u20131824 (2016)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"Shi, Y., Lan, Z., Liu, W., Bi, W.: Extending semi-supervised learning methods for inductive transfer learning. In: 2009 Ninth IEEE International Conference on Data Mining, pp. 483\u2013492. IEEE (2009)","DOI":"10.1109\/ICDM.2009.75"},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"Wang, X.H., Zhang, Y., Sun, X.Y., Wang, Y.L., Du, C.H.: Multi-objective feature selection based on artificial bee colony: an acceleration approach with variable sample size. Appl. Soft Comput. 88, 106041 (2020)","DOI":"10.1016\/j.asoc.2019.106041"},{"issue":"1","key":"40_CR18","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/TEVC.2005.851275","volume":"10","author":"L While","year":"2006","unstructured":"While, L., Hingston, P., Barone, L., Huband, S.: A faster algorithm for calculating hypervolume. IEEE Trans. Evol. Comput. 10(1), 29\u201338 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"40_CR19","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1109\/TEVC.2020.3016049","volume":"25","author":"H Xu","year":"2020","unstructured":"Xu, H., Xue, B., Zhang, M.: A duplication analysis-based evolutionary algorithm for biobjective feature selection. IEEE Trans. Evol. Comput. 25(2), 205\u2013218 (2020)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"8","key":"40_CR20","doi-asserted-by":"publisher","first-page":"864","DOI":"10.3390\/math9080864","volume":"9","author":"Q Xu","year":"2021","unstructured":"Xu, Q., Wang, N., Wang, L., Li, W., Sun, Q.: Multi-task optimization and multi-task evolutionary computation in the past five years: a brief review. Mathematics 9(8), 864 (2021)","journal-title":"Mathematics"},{"key":"40_CR21","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2022.3196887","author":"F Zhang","year":"2022","unstructured":"Zhang, F., Mei, Y., Nguyen, S., Zhang, M.: Multitask multiobjective genetic programming for automated scheduling heuristic learning in dynamic flexible job-shop scheduling. IEEE Transactions on Cybernetics (2022). https:\/\/doi.org\/10.1109\/TCYB.2022.3196887","journal-title":"IEEE Transactions on Cybernetics"},{"key":"40_CR22","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3065707","author":"F Zhang","year":"2021","unstructured":"Zhang, F., Mei, Y., Nguyen, S., Zhang, M., Tan, K.C.: Surrogate-assisted evolutionary multitask genetic programming for dynamic flexible job shop scheduling. IEEE Trans. Evol. Comput. (2021). https:\/\/doi.org\/10.1109\/TEVC.2021.3065707","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"40_CR23","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."},{"key":"40_CR24","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: Spea 2: improving the strength pareto evolutionary algorithm. TIK-report 103 (2001)"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30229-9_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,9]],"date-time":"2023-04-09T23:11:14Z","timestamp":1681081874000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30229-9_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031302282","9783031302299"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30229-9_40","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 April 2023","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":"Brno","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","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":"12 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2023\/evoapps\/","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":"78","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":"37","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":"14","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":"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":"3","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)"}}]}}