Learning to Select Features using their Properties Export

@article{krupka_08_feature, abstract = {Feature selection is the task of choosing a small subset of features that is sufficient to predict the target labels well. Here, instead of trying to directly determine which features are better, we attempt to learn the properties of good features. For this purpose we assume that each feature is represented by a set of properties, referred to as meta-features. This approach enables prediction of the quality of features without measuring their value on the training instances. We use this ability to devise new selection algorithms that can efficiently search for new good features in the presence of a huge number of features, and to dramatically reduce the number of feature measurements needed. We demonstrate our algorithms on a handwritten digit recognition problem and a visual object category recognition problem. In addition, we show how this novel viewpoint enables derivation of better generalization bounds for the joint learning problem of selection and classification, and how it contributes to a better understanding of the problem. Specifically, in the context of object recognition, previous works showed that it is possible to find one set of features which fits most object categories (aka a universal dictionary). Here we use our framework to analyze one such universal dictionary and find that the quality of features in this dictionary can be predicted accurately by its meta-features.}, author = {Krupka, Eyal and Navot, Amir and Tishby, Naftali}, citeulike-article-id = {3474225}, citeulike-linkout-0 = {http://www.jmlr.org/papers/volume9/krupka08b/krupka08b.pdf}, journal = {Journal of Machine Learning Research}, keywords = {algorithm, classification, feature\_selection}, month = {October}, pages = {2349--2376}, posted-at = {2008-11-03 08:25:14}, priority = {2}, title = {Learning to Select Features using their Properties}, url = {http://www.jmlr.org/papers/volume9/krupka08b/krupka08b.pdf}, volume = {9}, year = {2008} }

TY - JOUR ID - krupka_08_feature L3 - citeulike-article-id:3474225 N2 - Feature selection is the task of choosing a small subset of features that is sufficient to predict the target labels well. Here, instead of trying to directly determine which features are better, we attempt to learn the properties of good features. For this purpose we assume that each feature is represented by a set of properties, referred to as meta-features. This approach enables prediction of the quality of features without measuring their value on the training instances. We use this ability to devise new selection algorithms that can efficiently search for new good features in the presence of a huge number of features, and to dramatically reduce the number of feature measurements needed. We demonstrate our algorithms on a handwritten digit recognition problem and a visual object category recognition problem. In addition, we show how this novel viewpoint enables derivation of better generalization bounds for the joint learning problem of selection and classification, and how it contributes to a better understanding of the problem. Specifically, in the context of object recognition, previous works showed that it is possible to find one set of features which fits most object categories (aka a universal dictionary). Here we use our framework to analyze one such universal dictionary and find that the quality of features in this dictionary can be predicted accurately by its meta-features. JF - Journal of Machine Learning Research EP - 2376 TI - Learning to Select Features using their Properties VL - 9 SP - 2349 KW - algorithm KW - classification KW - feature_selection AU - Krupka, Eyal AU - Navot, Amir AU - Tishby, Naftali PY - 2008/10// UR - http://www.jmlr.org/papers/volume9/krupka08b/krupka08b.pdf ER -