Feature analysis through information granulation and fuzzy sets

Pattern RecognitionPublished 1 April 2002

Witold Pedrycz, George Vukovich

DOI10.1016/s0031-3203(01)00102-9

Source URL

Citations85

SJR quartileQ1

SJR score2.06

SNIP2.67

TL;DR

This study revisits and generalizes an issue of feature selection by introducing a mechanism of soft (fuzzy) feature selection and reveals how such feature intervalization helps approximate fuzzy sets described by any type of membership function.

Abstract

Feature analysis and feature selection are fundamental pursuits in pattern recognition. We revisit and generalize an issue of feature selection by introducing a mechanism of soft (fuzzy) feature selection. The underlying idea is to consider features to be granular rather than numeric. By varying the level of granularity, we modify the level of contribution of the specific feature to the overall feature space. We admit an interval model of the features meaning that their values assume a form of numeric intervals. The intervalization of the features exhibits a clear-cut interpretation. Moreover a contribution of the features to the formation of the feature space can be easily controlled: the broader the interval, the less essential contribution of the feature to the entire feature space. In limit, when the intervals get broad enough, one may view the feature to be completely eliminated (dropped) from the feature space. The quantification of the features in terms of their importance is realized in the setting of the clustering FCM model (namely, a process of the binary or fuzzy feature selection is carried out and numerically quantified in the space of membership values generated by fuzzy clusters). As the focal point of this study concerns an interval-like form of information granules, we reveal how such feature intervalization helps approximate fuzzy sets described by any type of membership function. Detailed computations give rise to a detailed quantification of such granular features. Numerical experiments provide a comprehensive numerical illustration of the problem.

Keywords

Computer ScienceMathematics

Pattern Recognition LettersFloating search methods in feature selection

3,070 Citations1994Pavel Pudil, Jana Novovičová +1 more

IEEE Transactions on Pattern Analysis and Machine IntelligenceFeature selection: evaluation, application, and small sample performance

2,167 Citations1997Anil K. Jain, Douglas E. Zongker

This work studies the problem of choosing an optimal feature set for land use classification based on SAR satellite images using four different texture models and shows that pooling features derived from different texture Models, followed by a feature selection results in a substantial improvement in the classification accuracy.

IEEE Transactions on Neural NetworksArtificial neural networks for feature extraction and multivariate data projection

659 Citations1995Jianchang Mao, Anil K. Jain

The SAMANN network offers the generalization ability of projecting new data, which is not present in the original Sammon's projection algorithm; the NDA method and NP-SOM network provide new powerful approaches for visualizing high dimensional data.

Journal of Mathematical Analysis and ApplicationsAbstraction and pattern classification

424 Citations1966Richard Bellman, Robert E. Kalaba +1 more

A general framework for the treatment of pattern-recognition problems is discussed, including the notion of a 'fuzzy' set and how this may be employed in a sequential experimental procedure to ascertain whether a symbol is a member of a particular set or not.

IEEE Transactions on Neural NetworksNeural-network feature selector

375 Citations1997Rudy Setiono, Huan Liu

This paper proposes the use of a three-layer feedforward neural network to select those input attributes that are most useful for discriminating classes in a given set of input patterns.

Pattern RecognitionFuzzy sets in pattern recognition: Methodology and methods

360 Citations1990Witold Pedrycz

A state-of-the-art of methodology and algorithms of fuzzy sets in the field of pattern recognition and clustering techniques are discussed and a problem of cluster validity expressed in terms of clustering indices is addressed.

IEEE Transactions on Systems Man and CyberneticsPrototype classification and feature selection with fuzzy sets

139 Citations1977James C. Bezdek, Patrick F. Castelaz

The fuzzy ISODATA algorithms are used to address two problems: first, the question of feature selection for binary valued data sets is investigated; and second, the same method is applied to the design of a fuzzy one-nearest prototype classifier.

IEEE Transactions on Fuzzy SystemsA parametric model for fusing heterogeneous fuzzy data

127 Citations1996Richard J. Hathaway, James C. Bezdek +1 more

This work uses a small set of artificial data to illustrate how problems as diverse as feature analysis, clustering, cluster validity, and prototype classifier design can all be formulated and attacked with standard methods once the data are converted to the generalized coordinates of the model.

Pattern RecognitionA more efficient branch and bound algorithm for feature selection

120 Citations1993Bin Yu, Baozong Yuan

This algorithm dynamically searches for the globally optimal solution on a minimum solution tree which is a subtree of the solution tree used in the traditional branch and bound algorithm.

IEEE Transactions on Systems Man and CyberneticsFuzzy Set Theoretic Measure for Automatic Feature Evaluation

103 Citations1986Sankar K. Pal, Basabi Chakraborty