Mostrar o rexistro simple do ítem
Feature selection for domain adaptation using complexity measures and swarm intelligence
dc.contributor.author | Castillo-García, G. | |
dc.contributor.author | Morán-Fernández, Laura | |
dc.contributor.author | Bolón-Canedo, Verónica | |
dc.date.accessioned | 2024-07-02T10:53:51Z | |
dc.date.available | 2024-07-02T10:53:51Z | |
dc.date.issued | 2023-09-01 | |
dc.identifier.citation | G. Castillo-García, L. Morán-Fernández, and V. Bolón-Canedo, "Feature selection for domain adaptation using complexity measures and swarm intelligence", Neurocomputing, Vol. 548, 1 Sept. 2023, 126422, doi: 10.1016/j.neucom.2023.126422 | es_ES |
dc.identifier.uri | http://hdl.handle.net/2183/37632 | |
dc.description.abstract | [Abstract]: Particle Swarm Optimization is an optimization algorithm that mimics the behaviour of a flock of birds, setting multiple particles that explore the search space guided by a fitness function in order to find the best possible solution. We apply the Sticky Binary Particle Swarm Optimization algorithm to perform feature selection for domain adaptation, a specific type of transfer learning in which the source and the target domain have a common feature space, a common task, but different distributions. When applying Particle Swarm Optimization, classification error is usually employed in the fitness function to evaluate the goodness of subsets of features. In this paper, we aim to compare this approach with using complexity metrics instead, under the assumption that reducing the complexity of the problem will lead to results that are independent from the classifier used for testing while being less computationally demanding. Therefore, we carried out experiments to compare the performance of both approaches in terms of classification accuracy, speed and number of features selected. We found out that our proposal, although in some cases incurs in a slight degradation of classification performance, it is indeed faster and selects fewer features, making it a feasible trade-off. | es_ES |
dc.description.sponsorship | This work was supported by CITIC, as Research Center accredited by Galician University System, which is funded by “Consellería de Cultura, Educación e Universidade from Xunta de Galicia”, supported in an 80% through ERDF Funds, ERDF Operational Programme Galicia 2014–2020, and the remaining 20% by “Secretaría Xeral de Universidades” (Grant ED431G 2019/01). It was also partially funded by Xunta de Galicia/FEDER-UE under Grant ED431C 2022/44; Ministerio de Ciencia e Innovación MCIN/AEI/10.13039/501100011033 and “NextGenerationEU”/PRTR under Grants [PID2019-109238GB-C22; TED2021-130599A-I00]. | es_ES |
dc.description.sponsorship | Xunta de Galicia; ED431G 2019/01 | es_ES |
dc.description.sponsorship | Xunta de Galicia; ED431C 2022/44 | es_ES |
dc.language.iso | eng | es_ES |
dc.publisher | Elsevier B.V. | es_ES |
dc.relation | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-109238GB-C22/ES/APRENDIZAJE AUTOMATICO ESCALABLE Y EXPLICABLE | es_ES |
dc.relation | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2021-2024/TED2021-130599A-I00/ES/ALGORITMOS DE SELECCIÓN DE CARACTERÍSTICAS VERDES Y RÁPIDOS | es_ES |
dc.relation.uri | https://doi.org/10.1016/j.neucom.2023.126422 | es_ES |
dc.rights | Attribution-NonCommercial_NoDerivs 4.0 International (CC-NC-ND) | es_ES |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ | * |
dc.subject | Data complexity | es_ES |
dc.subject | Domain adaptation | es_ES |
dc.subject | Feature selection | es_ES |
dc.subject | Particle swarm optimization | es_ES |
dc.subject | Sticky binary particle swarm optimization | es_ES |
dc.subject | Transfer learning | es_ES |
dc.title | Feature selection for domain adaptation using complexity measures and swarm intelligence | es_ES |
dc.type | info:eu-repo/semantics/article | es_ES |
dc.rights.access | info:eu-repo/semantics/openAccess | es_ES |
UDC.journalTitle | Neurocomputing | es_ES |
UDC.volume | 548 | es_ES |
UDC.startPage | 126422 | es_ES |
dc.identifier.doi | 10.1016/j.neucom.2023.126422 |
Ficheiros no ítem
Este ítem aparece na(s) seguinte(s) colección(s)
-
GI-LIDIA - Artigos [63]