A NEW SUPERVISED FEATURE SELECTION METHOD FOR PATTERN CLASSIFICATION. (7th September 2012)

• Record Type: Journal Article
• Authors: Liu, Huawen; Wu, Xindong; Zhang, Shichao
• Is Part Of: Computational intelligence. Volume 30:Number 2(2014:May)
• Page Start: 342
• Page End: 361
• Publication Date: 2012-09-07
• Subjects: Artificial intelligence -- Periodicals; Computational linguistics -- Periodicals; 006.3
• DOI: 10.1111/j.1467-8640.2012.00465.x
• Languages: English
• ISSNs: 0824-7935

Abstract

<abstract abstract-type="main" xml:lang="en"> <title> <x xml:space="preserve">Abstract</x> </title> <p>With the rapid development of information techniques, the dimensionality of data in many application domains, such as text categorization and bioinformatics, is getting higher and higher. The high‐dimensionality data may bring many adverse situations, such as overfitting, poor performance, and low efficiency, to traditional learning algorithms in pattern classification. Feature selection aims at reducing the dimensionality of data and providing discriminative features for pattern learning algorithms. Due to its effectiveness, feature selection is now gaining increasing attentions from a variety of disciplines and currently many efforts have been attempted in this field. In this paper, we propose a new supervised feature selection method to pick important features by using information criteria. Unlike other selection methods, the main characteristic of our method is that it not only takes both maximal relevance to the class labels and minimal redundancy to the selected features into account, but also works like feature clustering in an agglomerative way. To measure the relevance and redundancy of feature exactly, two different information criteria, i.e., mutual information and coefficient of relevance, have been adopted in our method. The performance evaluations on 12 benchmark data sets show that the proposed method can achieve better performance than other popular feature selection methods in most cases.</p> </abstract>