Affiliations: Department of Computer Science, Aberystwyth University, Wales, UK | [x] Department of Computer Science and Artificial Intelligence, CITIC-UGR, Universidad de Granada, Granada, Spain | [y] Department of Mathematics and Computer Science, University of Salerno, Salerno, Italy | [z] Department of Information Engineering, University of Pisa, Pisa, Italy
Abstract: For supervised learning, feature selection algorithms attempt to maximise a given function of predictive accuracy. This function usually considers the ability of feature vectors to reflect decision class labels. It is therefore intuitive to retain only those features that are related to or lead to these decision classes. However, in unsupervised learning, decision class labels are not provided, which poses questions such as; which features should be retained? and, why not use all of the information? The problem is that not all features are important. Some of the features may be redundant, and others may be irrelevant and noisy. In this paper, some new fuzzy-rough set-based approaches to unsupervised feature selection are proposed. These approaches require no thresholding or domain information, can operate on real-valued data, and result in a significant reduction in dimensionality whilst retaining the semantics of the data.
