On Supervised Feature Selection from High Dimensional Feature Spaces
The application of machine learning to image and video data often yields a high dimensional feature space. Effective feature selection techniques identify a discriminant feature subspace that lowers computational and modeling costs with little performance degradation. A novel supervised feature selection methodology is proposed for machine learning decisions in this work. The resulting tests are called the discriminant feature test (DFT) and the relevant feature test (RFT) for the classification and regression problems, respectively. The DFT and RFT procedures are described in detail. Furthermore, we compare the effectiveness of DFT and RFT with several classic feature selection methods. To this end, we use deep features obtained by LeNet-5 for MNIST and Fashion-MNIST datasets as illustrative examples. Other datasets with handcrafted and gene expressions features are also included for performance evaluation. It is shown by experimental results that DFT and RFT can select a lower dimensional feature subspace distinctly and robustly while maintaining high decision performance.
Code (0)
등록된 구현이 없습니다.
Tasks
BIG-bench Machine Learningfeature selectionVocal Bursts Intensity PredictionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
K-means Derived Unsupervised Feature Selection using Improved ADMM
Feature selection is important for high-dimensional data analysis and is non-trivial in unsupervised learning problems such as dimensionality reduction and clustering. The goal of unsupervised feature selection is findin…
ClusteringDimensionality Reductionfeature selectionAutoEncoder Inspired Unsupervised Feature Selection
High-dimensional data in many areas such as computer vision and machine learning tasks brings in computational and analytical difficulty. Feature selection which selects a subset from observed features is a widely used a…
BIG-bench Machine Learningfeature selectionUnsupervised Feature Selection Algorithm Based on Dual Manifold Re-ranking
High-dimensional data is commonly encountered in numerous data analysis tasks. Feature selection techniques aim to identify the most representative features from the original high-dimensional data. Due to the absence of …
feature selectionRe-RankingGOLFS: Feature Selection via Combining Both Global and Local Information for High Dimensional Clustering
It is important to identify the discriminative features for high dimensional clustering. However, due to the lack of cluster labels, the regularization methods developed for supervised feature selection can not be direct…
Automatically Redundant Features Removal for Unsupervised Feature Selection via Sparse Feature Graph
The redundant features existing in high dimensional datasets always affect the performance of learning and mining algorithms. How to detect and remove them is an important research topic in machine learning and data mini…
feature selectionSparse Learning