On the Complexity of Discrete Feature Selection for Optimal Classification
2010 (English)In: IEEE Transaction on Pattern Analysis and Machine Intelligence, ISSN 0162-8828, Vol. 32, no 8, 1517-U1522 p.Article in journal (Refereed) Published
Consider a classification problem involving only discrete features that are represented as random variables with some prescribed discrete sample space. In this paper, we study the complexity of two feature selection problems. The first problem consists in finding a feature subset of a given size k that has minimal Bayes risk. We show that for any increasing ordering of the Bayes risks of the feature subsets (consistent with an obvious monotonicity constraint), there exists a probability distribution that exhibits that ordering. This implies that solving the first problem requires an exhaustive search over the feature subsets of size k. The second problem consists of finding the minimal feature subset that has minimal Bayes risk. In the light of the complexity of the first problem, one may think that solving the second problem requires an exhaustive search over all of the feature subsets. We show that, under mild assumptions, this is not true. We also study the practical implications of our solutions to the second problem.
Place, publisher, year, edition, pages
IEEE Institute of Electrical and Electronics , 2010. Vol. 32, no 8, 1517-U1522 p.
Feature evaluation and selection; classifier design and evaluation; machine learning
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-58348DOI: 10.1109/TPAMI.2010.84ISI: 000278858600012OAI: oai:DiVA.org:liu-58348DiVA: diva2:343352
©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Jose M Pena and Roland Nilsson, On the Complexity of Discrete Feature Selection for Optimal Classification, 2010, IEEE Transaction on Pattern Analysis and Machine Intelligence, (32), 8, 1517-U1522.