By Topic

Feature selection by analyzing class regions approximated by ellipsoids

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Abe, S. ; Dept. of Electr. & Electron. Eng., Kobe Univ., Japan ; Thawonmas, R. ; Kobayashi, Y.

In their previous work, the authors have developed a method for selecting features based on the analysis of class regions approximated by hyperboxes. They select features analyzing class regions approximated by ellipsoids. First, for a given set of features, each class region is approximated by an ellipsoid with the center and the covariance matrix calculated by the data belonging to the class. Then, similar to their previous work, the exception ratio is defined to represent the degree of overlaps in the class regions approximated by ellipsoids. From the given set of features, they temporally delete each feature, one at a time, and calculate the exception ratio. Then, the feature whose associated exception ratio is the minimum is deleted permanently. They iterate this procedure while the exception ratio or its increase is within a specified value by feature deletion. The simulation results show that the current method is better than the principal component analysis (PCA) and performs better than the previous method, especially when the distributions of class data are not parallel to the feature axes

Published in:

Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on  (Volume:28 ,  Issue: 2 )