Abstract
In this paper we present a model to distributed feature selection problem (DFSP) based on ACO and RST. The algorithm looks for reducts by using a multi-colony ACO as search method and RST offers the heuristic function to measure the quality of one feature subset. General results of using this approach are shown and formers results of apply ACO and RST to the feature selection problem are referenced. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Gómez, Y., Bello, R., Nowé, A., Casanovas, E., & Taminau, J. (2009). Multi-colony ACO and rough set theory to distributed feature selection problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5518 LNCS, pp. 458–461). https://doi.org/10.1007/978-3-642-02481-8_65
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
