DC Field | Value | Language |
---|---|---|
dc.contributor.author | Matijević, Luka | en_US |
dc.date.accessioned | 2022-11-28T13:54:44Z | - |
dc.date.available | 2022-11-28T13:54:44Z | - |
dc.date.issued | 2022 | - |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/4872 | - |
dc.description.abstract | In this paper, we consider the problem of feature selection for multi-label data. Multi-label feature selection is a process of finding the appropriate subset of features that allows multi-label classifiers to find better solutions in a shorter amount of time. For this purpose, we developed the Bee Colony Optimization algorithm based on mutual information and compared it with other metaheuristics from literature, i.e. Ant Colony Optimization and Memetic Algorithm. After testing it on several benchmark instances, we concluded that our approach outperforms the other two methods. | en_US |
dc.publisher | Faculty of Economics and Business, University of Belgrade | en_US |
dc.rights | CC0 1.0 Universal | * |
dc.rights.uri | http://creativecommons.org/publicdomain/zero/1.0/ | * |
dc.subject | Combinatorial optimization | Metaheuristics | Mutual information | Classification | en_US |
dc.title | Bee Colony Optimization for Multi-Label Feature Selection | en_US |
dc.type | Conference Paper | en_US |
dc.relation.conference | XLIX International Symposium on Operational Research SYM-OP-IS 2022, Vrnjačka Banja, 19-22.09.2022. | en_US |
dc.identifier.url | https://www.mi.sanu.ac.rs/~luka/resources/papers/BEE%20COLONY%20OPTIMIZATION%20FOR%20MULTI-LABEL%20FEATURE%20SELECTION.pdf | - |
dc.contributor.affiliation | Computer Science | en_US |
dc.relation.firstpage | 243 | - |
dc.relation.lastpage | 248 | - |
dc.description.rank | M33 | - |
item.grantfulltext | none | - |
item.openairetype | Conference Paper | - |
item.cerifentitytype | Publications | - |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
crisitem.author.orcid | 0000-0002-4575-6720 | - |
This item is licensed under a Creative Commons License