Feature Extraction for Kernel Minimum Squared Error by Sparsity Shrinkage

2014 ◽  
Vol 536-537 ◽  
pp. 450-453 ◽  
Author(s):  
Jiang Jiang ◽  
Xi Chen ◽  
Hai Tao Gan
Keyword(s):  
Feature Extraction ◽  
Feature Selection ◽  
Optimization Problem ◽  
Subset Selection ◽  
Experimental Results ◽  
Computational Burden ◽  
Squared Error ◽  
Kernel Minimum Squared Error ◽  
Benchmark Datasets ◽  
Training Examples

In this paper, a sparsity based model is proposed for feature selection in kernel minimum squared error (KMSE). By imposing a sparsity shrinkage term, we formulate the procedure of subset selection as an optimization problem. With the chosen small portion of training examples, the computational burden of feature extraction is largely alleviated. Experimental results conducted on several benchmark datasets indicate the effectivity and efficiency of our method.

scholarly journals PredAmyl-MLP: Prediction of Amyloid Proteins Using Multilayer Perceptron

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Yanjuan Li ◽  
Zitong Zhang ◽  
Zhixia Teng ◽  
Xiaoyan Liu
Keyword(s):  
Feature Extraction ◽  
Feature Selection ◽  
Prediction Model ◽  
Multilayer Perceptron ◽  
Type Ii Diabetes ◽  
Cross Validation ◽  
Experimental Results ◽  
Type Ii ◽  
Fold Cross Validation ◽  
Better Than

Amyloid is generally an aggregate of insoluble fibrin; its abnormal deposition is the pathogenic mechanism of various diseases, such as Alzheimer’s disease and type II diabetes. Therefore, accurately identifying amyloid is necessary to understand its role in pathology. We proposed a machine learning-based prediction model called PredAmyl-MLP, which consists of the following three steps: feature extraction, feature selection, and classification. In the step of feature extraction, seven feature extraction algorithms and different combinations of them are investigated, and the combination of SVMProt-188D and tripeptide composition (TPC) is selected according to the experimental results. In the step of feature selection, maximum relevant maximum distance (MRMD) and binomial distribution (BD) are, respectively, used to remove the redundant or noise features, and the appropriate features are selected according to the experimental results. In the step of classification, we employed multilayer perceptron (MLP) to train the prediction model. The 10-fold cross-validation results show that the overall accuracy of PredAmyl-MLP reached 91.59%, and the performance was better than the existing methods.

scholarly journals GSPL: A Succinct Kernel Model for Group-Sparse Projections Learning of Multiview Data

2021 ◽  
Author(s):  
Danyang Wu ◽  
Jin Xu ◽  
Xia Dong ◽  
Meng Liao ◽  
Rong Wang ◽  
...  
Keyword(s):  
Feature Selection ◽  
Iterative Algorithm ◽  
Optimization Problem ◽  
Selection Task ◽  
Experimental Results ◽  
Multiple Views ◽  
Intrinsic Parameters ◽  
Norm Constraint ◽  
Kernel Model

This paper explores a succinct kernel model for Group-Sparse Projections Learning (GSPL), to handle multiview feature selection task completely. Compared to previous works, our model has the following useful properties: 1) Strictness: GSPL innovatively learns group-sparse projections strictly on multiview data via ‘2;0-norm constraint, which is different with previous works that encourage group-sparse projections softly. 2) Adaptivity: In GSPL model, when the total number of selected features is given, the numbers of selected features of different views can be determined adaptively, which avoids artificial settings. Besides, GSPL can capture the differences among multiple views adaptively, which handles the inconsistent problem among different views. 3) Succinctness: Except for the intrinsic parameters of projection-based feature selection task, GSPL does not bring extra parameters, which guarantees the applicability in practice. To solve the optimization problem involved in GSPL, a novel iterative algorithm is proposed with rigorously theoretical guarantees. Experimental results demonstrate the superb performance of GSPL on synthetic and real datasets.

scholarly journals Adaptive Hypergraph Learning for Unsupervised Feature Selection

2017 ◽  
Author(s):  
Xiaofeng Zhu ◽  
Yonghua Zhu ◽  
Shichao Zhang ◽  
Rongyao Hu ◽  
Wei He
Keyword(s):  
Feature Selection ◽  
Original Data ◽  
Subspace Learning ◽  
Simple Graph ◽  
Experimental Results ◽  
Similarity Matrix ◽  
Unsupervised Feature Selection ◽  
Feature Spaces ◽  
Hypergraph Learning ◽  
Benchmark Datasets

Current unsupervised feature selection (UFS) methods learn the similarity matrix by using a simple graph which is learnt from the original data as well as is independent from the process of feature selection, and thus unable to efficiently remove the redundant/irrelevant features. To address these issues, we propose a new UFS method to jointly learn the similarity matrix and conduct both subspace learning (via learning a dynamic hypergraph) and feature selection (via a sparsity constraint). As a result, we reduce the feature dimensions using different methods (i.e., subspace learning and feature selection) from different feature spaces, and thus makes our method select the informative features effectively and robustly. We tested our method using benchmark datasets to conduct the clustering tasks using the selected features, and the experimental results show that our proposed method outperforms all the comparison methods.

The effects of globalisation techniques on feature selection for text classification

2020 ◽  
pp. 016555152093089
Author(s):  
Bekir Parlak ◽  
Alper Kursat Uysal
Keyword(s):  
Feature Selection ◽  
Text Classification ◽  
High Volume ◽  
Experimental Results ◽  
Support Vector ◽  
Svm Classifier ◽  
Chi Square ◽  
Discriminative Feature ◽  
Benchmark Datasets ◽  
Different Characteristics

Text classification (TC) is very important and critical task in the 21th century as there exist high volume of electronic data on the Internet. In TC, textual data are characterised by a huge number of highly sparse features/terms. A typical TC consists of many steps and one of the most important steps is undoubtedly feature selection (FS). In this study, we have comprehensively investigated the effects of various globalisation techniques on local feature selection (LFS) methods using datasets with different characteristics such as multi-class unbalanced (MCU), multi-class balanced (MCB), binary-class unbalanced (BCU) and binary-class balanced (BCB). The globalisation techniques used in this study are summation (SUM), weighted-sum (AVG), and maximum (MAX). To investigate the effect of globalisation techniques, we used three LFS methods named as Discriminative Feature Selection (DFSS), odds ratio (OR) and chi-square (CHI2). In the experiments, we have utilised four different benchmark datasets named as Reuters-21578, 20Newsgroup., Enron1, and Polarity in addition to Support Vector Machines (SVM) and Decision Tree (DT) classifiers. According to the experimental results, the most successful globalisation technique is AVG while all situations are taken into account. The experimental results indicate that DFSS method is more successful than OR and CHI2 methods on datasets with MCU and MCB characteristics. However, CHI2 method seems more accurate than OR and DFSS methods on datasets with BCU and BCB characteristics. Also, SVM classifier performed better than DT classifier in most cases.

scholarly journals A Novel Fixed Low-Rank Constrained EEG Spatial Filter Estimation with Application to Movie-Induced Emotion Recognition

2016 ◽  
Vol 2016 ◽  
pp. 1-12 ◽  
Author(s):  
Ken Yano ◽  
Takayuki Suyama
Keyword(s):  
Feature Extraction ◽  
Feature Selection ◽  
Optimization Problem ◽  
Brain Computer Interface ◽  
Spatial Filter ◽  
Low Rank ◽  
Computer Interface ◽  
Emotional States ◽  
Loss Minimization ◽  
Spatial Filters

This paper proposes a novel fixed low-rank spatial filter estimation for brain computer interface (BCI) systems with an application that recognizes emotions elicited by movies. The proposed approach unifies such tasks as feature extraction, feature selection, and classification, which are often independently tackled in a “bottom-up” manner, under a regularized loss minimization problem. The loss function is explicitly derived from the conventional BCI approach and solves its minimization by optimization with a nonconvex fixed low-rank constraint. For evaluation, an experiment was conducted to induce emotions by movies for dozens of young adult subjects and estimated the emotional states using the proposed method. The advantage of the proposed method is that it combines feature selection, feature extraction, and classification into a monolithic optimization problem with a fixed low-rank regularization, which implicitly estimates optimal spatial filters. The proposed method shows competitive performance against the best CSP-based alternatives.

Sign in / Sign up

Export Citation Format

Share Document