scholarly journals Feature Selection for Ridge Regression with Provable Guarantees

2016 ◽  
Vol 28 (4) ◽  
pp. 716-742 ◽  
Author(s):  
Saurabh Paul ◽  
Petros Drineas
Keyword(s):  
Feature Selection ◽  
Ridge Regression ◽  
Feature Selection Method ◽  
Feature Space ◽  
Data Sets ◽  
Real World Data ◽  
Feature Selection Technique ◽  
Worst Case ◽  
Single Set ◽  
Classification Function

We introduce single-set spectral sparsification as a deterministic sampling–based feature selection technique for regularized least-squares classification, which is the classification analog to ridge regression. The method is unsupervised and gives worst-case guarantees of the generalization power of the classification function after feature selection with respect to the classification function obtained using all features. We also introduce leverage-score sampling as an unsupervised randomized feature selection method for ridge regression. We provide risk bounds for both single-set spectral sparsification and leverage-score sampling on ridge regression in the fixed design setting and show that the risk in the sampled space is comparable to the risk in the full-feature space. We perform experiments on synthetic and real-world data sets; a subset of TechTC-300 data sets, to support our theory. Experimental results indicate that the proposed methods perform better than the existing feature selection methods.

scholarly journals Multi-Label Feature Selection Method Based on Dynamic Weight

2021 ◽  
Author(s):  
Ping Zhang ◽  
Jiyao Sheng ◽  
Wanfu Gao ◽  
Juncheng Hu ◽  
Yonghao Li
Keyword(s):  
Feature Selection ◽  
Dynamic Change ◽  
Feature Selection Method ◽  
Selection Method ◽  
Data Sets ◽  
Selection Methods ◽  
Real World Data ◽  
Amount Of Information ◽  
The Difference ◽  
Classification Information

Abstract Multi-label feature selection attracts considerable attention from multi-label learning. Information-theory based multi-label feature selection methods intend to select the most informative features and reduce the uncertain amount of information of labels. Previous methods regard the uncertain amount of information of labels as constant. In fact, as the classification information of the label set is captured by features, the remaining uncertainty of each label is changing dynamically. In this paper, we categorize labels into two groups: one contains the labels with few remaining uncertainty, which means that most of classification information with respect to the labels has been obtained by the already-selected features; another group contains the labels with extensive remaining uncertainty, which means that the classification information of these labels is neglected by already-selected features. Feature selection aims to select the new features with highly relevant to the labels in the second group. Existing methods do not distinguish the difference between two label groups and ignore the dynamic change amount of information of labels. To this end, a Relevancy Ratio is designed to clarify the dynamic change amount of information of each label under the condition of the already-selected features. Afterwards, a Weighted Feature Relevancy is defined to evaluate the candidate features. Finally, a new multi-label Feature Selection method based on Weighted Feature Relevancy (WFRFS) is proposed. The experiments obtain encouraging results of WFRFS in comparison to six multi-label feature selection methods on thirteen real-world data sets.

scholarly journals MODULAR FEATURE SELECTION USING RELATIVE IMPORTANCE FACTORS

2004 ◽  
Vol 04 (01) ◽  
pp. 57-75 ◽  
Author(s):  
SHENG-UEI GUAN ◽  
FANGMING ZHU ◽  
PENG LI
Keyword(s):  
Feature Selection ◽  
Classification Accuracy ◽  
Feature Space ◽  
Data Sets ◽  
Relative Importance ◽  
Classification Problems ◽  
Feature Selection Technique ◽  
Importance Factor ◽  
Rule Sets ◽  
New Feature

Feature selection plays an important role in finding relevant or irrelevant features in classification. Genetic algorithms (GAs) have been used as conventional methods for classifiers to adaptively evolve solutions for classification problems. In this paper, we explore the use of feature selection in modular GA-based classification. We propose a new feature selection technique, Relative Importance Factor (RIF), to find irrelevant features in the feature space of each module. By removing these features, we aim to improve classification accuracy and reduce the dimensionality of classification problems. Benchmark classification data sets are used to evaluate the proposed approaches. The experiment results show that RIF can be used to determine irrelevant features and help achieve higher classification accuracy with the feature space dimension reduced. The complexity of the resulting rule sets is also reduced which means the modular classifiers with irrelevant features removed will be able to classify data with a higher throughput.

scholarly journals An Incremental Classification Algorithm for Mining Data with Feature Space Heterogeneity

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Yu Wang
Keyword(s):  
Feature Space ◽  
Classification Problem ◽  
Classification Algorithm ◽  
Data Sets ◽  
Real World Data ◽  
Supervised Clustering ◽  
Online Classification ◽  
Efficiency And Effectiveness ◽  
Feature Relevance ◽  
Incremental Classification

Feature space heterogeneity often exists in many real world data sets so that some features are of different importance for classification over different subsets. Moreover, the pattern of feature space heterogeneity might dynamically change over time as more and more data are accumulated. In this paper, we develop an incremental classification algorithm, Supervised Clustering for Classification with Feature Space Heterogeneity (SCCFSH), to address this problem. In our approach, supervised clustering is implemented to obtain a number of clusters such that samples in each cluster are from the same class. After the removal of outliers, relevance of features in each cluster is calculated based on their variations in this cluster. The feature relevance is incorporated into distance calculation for classification. The main advantage of SCCFSH lies in the fact that it is capable of solving a classification problem with feature space heterogeneity in an incremental way, which is favorable for online classification tasks with continuously changing data. Experimental results on a series of data sets and application to a database marketing problem show the efficiency and effectiveness of the proposed approach.

scholarly journals A New Feature Selection Method for Text Classification Based on Independent Feature Space Search

2020 ◽  
Vol 2020 ◽  
pp. 1-14 ◽  
Author(s):  
Yong Liu ◽  
Shenggen Ju ◽  
Junfeng Wang ◽  
Chong Su
Keyword(s):  
Feature Selection ◽  
Text Classification ◽  
Predictive Accuracy ◽  
Feature Selection Method ◽  
Feature Space ◽  
Selection Method ◽  
The Other ◽  
Feature Subset ◽  
Search Range ◽  
Text Documents

Feature selection method is designed to select the representative feature subsets from the original feature set by different evaluation of feature relevance, which focuses on reducing the dimension of the features while maintaining the predictive accuracy of a classifier. In this study, we propose a feature selection method for text classification based on independent feature space search. Firstly, a relative document-term frequency difference (RDTFD) method is proposed to divide the features in all text documents into two independent feature sets according to the features’ ability to discriminate the positive and negative samples, which has two important functions: one is to improve the high class correlation of the features and reduce the correlation between the features and the other is to reduce the search range of feature space and maintain appropriate feature redundancy. Secondly, the feature search strategy is used to search the optimal feature subset in independent feature space, which can improve the performance of text classification. Finally, we evaluate several experiments conduced on six benchmark corpora, the experimental results show the RDTFD method based on independent feature space search is more robust than the other feature selection methods.

A NEW FEATURE SELECTION METHOD FOR TEXT CLASSIFICATION

2007 ◽  
Vol 21 (02) ◽  
pp. 423-438 ◽  
Author(s):  
GULDEN UCHYIGIT ◽  
KEITH CLARK
Keyword(s):  
Feature Selection ◽  
Text Classification ◽  
Information Gain ◽  
Feature Selection Method ◽  
Feature Space ◽  
Selection Method ◽  
Computational Time ◽  
Small Subset ◽  
Selection Methods ◽  
New Feature

Text classification is the problem of classifying a set of documents into a pre-defined set of classes. A major problem with text classification problems is the high dimensionality of the feature space. Only a small subset of these words are feature words which can be used in determining a document's class, while the rest adds noise and can make the results unreliable and significantly increase computational time. A common approach in dealing with this problem is feature selection where the number of words in the feature space are significantly reduced. In this paper we present the experiments of a comparative study of feature selection methods used for text classification. Ten feature selection methods were evaluated in this study including the new feature selection method, called the GU metric. The other feature selection methods evaluated in this study are: Chi-Squared (χ2) statistic, NGL coefficient, GSS coefficient, Mutual Information, Information Gain, Odds Ratio, Term Frequency, Fisher Criterion, BSS/WSS coefficient. The experimental evaluations show that the GU metric obtained the best F1 and F2 scores. The experiments were performed on the 20 Newsgroups data sets with the Naive Bayesian Probabilistic Classifier.

Simultaneous instance and feature selection for improving prediction in special education data

2017 ◽  
Vol 51 (3) ◽  
pp. 278-297 ◽  
Author(s):  
Yenny Villuendas-Rey ◽  
Carmen Rey-Benguría ◽  
Miltiadis Lytras ◽  
Cornelio Yáñez-Márquez ◽  
Oscar Camacho-Nieto
Keyword(s):  
Feature Selection ◽  
Data Sets ◽  
Feature Selection Technique ◽  
Similarity Functions ◽  
Content Type ◽  
Education Data ◽  
Multiple Feature ◽  
The Family ◽  
Selection For

Purpose The purpose of this paper is to improve the classification of families having children with affective-behavioral maladies, and thus giving the families a suitable orientation. Design/methodology/approach The proposed methodology includes three steps. Step 1 addresses initial data preprocessing, by noise filtering or data condensation. Step 2 performs a multiple feature sets selection, by using genetic algorithms and rough sets. Finally, Step 3 merges the candidate solutions and obtains the selected features and instances. Findings The new proposal show very good results on the family data (with 100 percent of correct classifications). It also obtained accurate results over a variety of repository data sets. The proposed approach is suitable for dealing with non-symmetric similarity functions, as well as with high-dimensionality mixed and incomplete data. Originality/value Previous work in the state of the art only considers instance selection to preprocess the schools for children with affective-behavioral maladies data. This paper explores using a new combined instance and feature selection technique to select relevant instances and features, leading to better classification, and to a simplification of the data.

scholarly journals Effect on speech emotion classification of a feature selection approach using a convolutional neural network

2021 ◽  
Vol 7 ◽  
pp. e766
Author(s):  
Ammar Amjad ◽  
Lal Khan ◽  
Hsien-Tsung Chang
Keyword(s):  
Neural Network ◽  
Feature Selection ◽  
Convolutional Neural Network ◽  
Feature Selection Method ◽  
Classification Problem ◽  
Speech Emotion Recognition ◽  
Support Vector ◽  
Emotion Classification ◽  
K Nearest Neighbors ◽  
Feature Selection Technique

Speech emotion recognition (SER) is a challenging issue because it is not clear which features are effective for classification. Emotionally related features are always extracted from speech signals for emotional classification. Handcrafted features are mainly used for emotional identification from audio signals. However, these features are not sufficient to correctly identify the emotional state of the speaker. The advantages of a deep convolutional neural network (DCNN) are investigated in the proposed work. A pretrained framework is used to extract the features from speech emotion databases. In this work, we adopt the feature selection (FS) approach to find the discriminative and most important features for SER. Many algorithms are used for the emotion classification problem. We use the random forest (RF), decision tree (DT), support vector machine (SVM), multilayer perceptron classifier (MLP), and k-nearest neighbors (KNN) to classify seven emotions. All experiments are performed by utilizing four different publicly accessible databases. Our method obtains accuracies of 92.02%, 88.77%, 93.61%, and 77.23% for Emo-DB, SAVEE, RAVDESS, and IEMOCAP, respectively, for speaker-dependent (SD) recognition with the feature selection method. Furthermore, compared to current handcrafted feature-based SER methods, the proposed method shows the best results for speaker-independent SER. For EMO-DB, all classifiers attain an accuracy of more than 80% with or without the feature selection technique.

scholarly journals Preventing Disparate Treatment in Sequential Decision Making

2018 ◽  
Author(s):  
Hoda Heidari ◽  
Andreas Krause
Keyword(s):  
Decision Making ◽  
Learning Algorithm ◽  
Feature Space ◽  
Sequential Decision Making ◽  
Data Sets ◽  
Sequential Decision ◽  
Real World Data ◽  
Time Step ◽  
Job Application ◽  
Disparate Treatment

We study fairness in sequential decision making environments, where at each time step a learning algorithm receives data corresponding to a new individual (e.g. a new job application) and must make an irrevocable decision about him/her (e.g. whether to hire the applicant) based on observations made so far. In order to prevent cases of disparate treatment, our time-dependent notion of fairness requires algorithmic decisions to be consistent: if two individuals are similar in the feature space and arrive during the same time epoch, the algorithm must assign them to similar outcomes. We propose a general framework for post-processing predictions made by a black-box learning model, that guarantees the resulting sequence of outcomes is consistent. We show theoretically that imposing consistency will not significantly slow down learning. Our experiments on two real-world data sets illustrate and confirm this finding in practice.

Sign in / Sign up

Export Citation Format

Share Document