dc.contributor.author | Walker, David J. | |
dc.contributor.author | Everson, Richard M. | |
dc.contributor.author | Fieldsend, Jonathan E. | |
dc.date.accessioned | 2013-07-17T15:15:43Z | |
dc.date.issued | 2011-07-12 | |
dc.description.abstract | Interpreting individuals described by a set of criteria can be a difficult task when the number of criteria is large. Such individuals can be ranked, for instance in terms of their average rank across criteria as well as by each distinct criterion. We therefore investigate criteria selection methods which aim to preserve the average rank of individuals but with fewer criteria. Our experiments show that these methods perform effectively, identifying and removing redundancies within the data, and that they are best incorporated into a multi-objective algorithm. | en_GB |
dc.identifier.citation | 13th annual conference on Genetic and Evolutionary Computation (GECCO '11), Dublin, Ireland, 12-16 July 2011, pp. 107-108 | en_GB |
dc.identifier.doi | 10.1145/2001858.2001919 | |
dc.identifier.uri | http://hdl.handle.net/10871/11792 | |
dc.language.iso | en | en_GB |
dc.publisher | Association for Computing Machinery (ACM) | en_GB |
dc.subject | Algorithms | en_GB |
dc.subject | Feature selection | en_GB |
dc.subject | multi-criteria decision making | en_GB |
dc.subject | Visualisation | en_GB |
dc.title | Rank-based dimension reduction for many-criteria populations | en_GB |
dc.type | Conference paper | en_GB |
dc.date.available | 2013-07-17T15:15:43Z | |
dc.contributor.editor | Krasnogor, N | |
dc.contributor.editor | Lanzi, PL | |
dc.identifier.isbn | 9781450306904 | |
dc.description | Copyright © 2011 ACM | en_GB |