Slotta, Douglas J.Vergara, John Paul C.Ramakrishnan, NarenHeath, Lenwood S.2013-06-192013-06-192005http://hdl.handle.net/10919/20191The problem of feature selection in supervised learning situations is considered, where all features are drawn from a common domain and are best interpreted via ordinal comparisons with other features, rather than as numerical values. In particular, each instance is a member of a space of ranked features. This problem is pertinent in electoral, financial, and bioinformatics contexts, where features denote assessments in terms of counts, ratings, or rankings. Four algorithms for feature selection in such rank-order spaces are presented; two are information-theoretic, and two are order-theoretic. These algorithms are empirically evaluated against both synthetic and real world datasets. The main results of this paper are (i) characterization of relationships and equivalences between different feature selection strategies with respect to the spaces in which they operate, and the distributions they seek to approximate; (ii) identification of computationally simple and efficient strategies that perform surprisingly well; and (iii) a feasibility study of order-theoretic feature selection for large scale datasets.application/pdfenIn CopyrightBioinformaticsAlgorithmsData structuresTechnical reportTR-05-08http://eprints.cs.vt.edu/archive/00000714/01/tech_report.pdf