FEATURE SELECTION BASED ON COMPACTNESS AND SEPARABILITY: COMPARISON WITH FILTER‐BASED METHODS. (20th March 2013)

• Record Type: Journal Article
• Authors: Chen, Chien‐Hsing
• Is Part Of: Computational intelligence. Volume 30:Number 3(2014:Aug.)
• Page Start: 636
• Page End: 656
• Publication Date: 2013-03-20
• Subjects: Artificial intelligence -- Periodicals; Computational linguistics -- Periodicals; 006.3
• DOI: 10.1111/coin.12010
• Languages: English
• ISSNs: 0824-7935

Abstract

<abstract abstract-type="main" id="coin12010-abs-0001"> <title> <x xml:space="preserve">Abstract</x> </title> <p id="coin12010-para-0001">Selecting a subset of salient features for performing clustering using a clustering learning algorithm has been explored extensively in many real‐world applications. To select salient features during training, the filter model evaluates the intrinsic characteristics of each individual feature but is not permitted to use a clustering learning algorithm that provides clustered information to train the features. In particular, the filter model aims to predict <italic>unobservable</italic> clusters and measure how the features help provide satisfactory within‐cluster and between‐cluster scatters to achieve a good clustering quality. However, it is generally difficult to achieve both scatters in the filter model. For example, a random variable with a large variance may raise only the between‐cluster scatter, whereas another variable following a uniform distribution may raise only the within‐cluster scatter. In this paper, we present a new filter‐based method to quantify features that consider feature compactness and separability to ensure that both scatters are raised. Moreover, our method adopts a new search strategy to locate the best feature salience vector instead of visiting the space of all the possible feature subsets. After the benchmark data sets are tested, the experimental results indicate that our method performs better than many benchmark filter‐based methods at selecting a feature subset to perform clustering.</p> </abstract>