Toward an efficient and accurate unsupervised feature selection

Toward an efficient and accurate unsupervised feature selection

For access to this article, please select a purchase option:

Buy chapter PDF
(plus tax if applicable)
Buy Knowledge Pack
10 chapters for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Network Classification for Traffic Management: Anomaly detection, feature selection, clustering and classification — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Both redundant and nonrepresentative features result in large-volume and high-dimensional data, which degrade the accuracy and performance of classification as well as clustering algorithms. Most of the existing feature selection (FS) methods have limitations when dealing with high-dimensional data, as they search different subsets of features to find accurate representations of all features. Obviously, searching for different combinations of features is computationally very expensive, which makes existing work not efficient for high-dimensional data. The work carried out in this chapter, which relates to the design of an efficient and accurate similarity-based unsupervised feature selection (AUFS) method, tackles mainly the high-dimensionality issue of data by selecting a reduced set of representative and nonredundant features without the need for data class labels.

Chapter Contents:

  • 5.1 Introduction
  • 5.2 Related work
  • 5.2.1 Supervised feature selection methods
  • 5.2.2 Unsupervised feature selection methods
  • 5.3 Similarity measures
  • 5.4 The proposed feature selection method
  • 5.4.1 More details about the AUFS method
  • 5.4.2 An illustrative example
  • 5.5 Experimental setup
  • 5.5.1 Datasets
  • 5.5.2 Evaluation metrics
  • 5.6 Experimental results
  • 5.7 Conclusion

Inspec keywords: feature extraction; feature selection; pattern clustering; pattern classification; unsupervised learning

Other keywords: nonrepresentative features; existing feature selection methods; nonredundant features; accurate unsupervised feature selection; representative features; accurate representations; data class labels; redundant features; high-dimensional data; efficient feature selection

Subjects: Knowledge engineering techniques; Data handling techniques; Other topics in statistics; Computer vision and image processing techniques

Preview this chapter:
Zoom in

Toward an efficient and accurate unsupervised feature selection, Page 1 of 2

| /docserver/preview/fulltext/books/pc/pbpc032e/PBPC032E_ch5-1.gif /docserver/preview/fulltext/books/pc/pbpc032e/PBPC032E_ch5-2.gif

Related content

This is a required field
Please enter a valid email address