scholarly journals Feature Selection in Hierarchical Feature Spaces

2014 ◽  
pp. 288-300 ◽  
Author(s):  
Petar Ristoski ◽  
Heiko Paulheim
Keyword(s):  
Feature Selection ◽  
Feature Spaces

Feature selection of the armature winding broken coils in synchronous motor using genetic algorithm and mahalanobis distance

2012 ◽  
Vol 57 (3) ◽  
pp. 829-835 ◽  
Author(s):  
Z. Głowacz ◽  
J. Kozik
Keyword(s):  
Genetic Algorithm ◽  
Feature Selection ◽  
Mahalanobis Distance ◽  
Distance Measure ◽  
Synchronous Motor ◽  
Medical Diagnostics ◽  
Motor Current ◽  
Feature Spaces ◽  
Multidimensional Feature Spaces ◽  
Selection Of

The paper describes a procedure for automatic selection of symptoms accompanying the break in the synchronous motor armature winding coils. This procedure, called the feature selection, leads to choosing from a full set of features describing the problem, such a subset that would allow the best distinguishing between healthy and damaged states. As the features the spectra components amplitudes of the motor current signals were used. The full spectra of current signals are considered as the multidimensional feature spaces and their subspaces are tested. Particular subspaces are chosen with the aid of genetic algorithm and their goodness is tested using Mahalanobis distance measure. The algorithm searches for such a subspaces for which this distance is the greatest. The algorithm is very efficient and, as it was confirmed by research, leads to good results. The proposed technique is successfully applied in many other fields of science and technology, including medical diagnostics.

scholarly journals Partial Classifier Chains with Feature Selection by Exploiting Label Correlation in Multi-Label Classification

Entropy ◽  
2020 ◽  
Vol 22 (10) ◽  
pp. 1143
Author(s):  
Zhenwu Wang ◽  
Tielin Wang ◽  
Benting Wan ◽  
Mengjie Han
Keyword(s):  
Feature Selection ◽  
State Of The Art ◽  
Predictive Performance ◽  
Chain Structure ◽  
Classification Performance ◽  
Learning Problem ◽  
Feature Spaces ◽  
Label Correlations ◽  
Classifier Chains ◽  
Label Correlation

Multi-label classification (MLC) is a supervised learning problem where an object is naturally associated with multiple concepts because it can be described from various dimensions. How to exploit the resulting label correlations is the key issue in MLC problems. The classifier chain (CC) is a well-known MLC approach that can learn complex coupling relationships between labels. CC suffers from two obvious drawbacks: (1) label ordering is decided at random although it usually has a strong effect on predictive performance; (2) all the labels are inserted into the chain, although some of them may carry irrelevant information that discriminates against the others. In this work, we propose a partial classifier chain method with feature selection (PCC-FS) that exploits the label correlation between label and feature spaces and thus solves the two previously mentioned problems simultaneously. In the PCC-FS algorithm, feature selection is performed by learning the covariance between feature set and label set, thus eliminating the irrelevant features that can diminish classification performance. Couplings in the label set are extracted, and the coupled labels of each label are inserted simultaneously into the chain structure to execute the training and prediction activities. The experimental results from five metrics demonstrate that, in comparison to eight state-of-the-art MLC algorithms, the proposed method is a significant improvement on existing multi-label classification.

scholarly journals An Effective Multi-Label Feature Selection Model Towards Eliminating Noisy Features

2020 ◽  
Vol 10 (22) ◽  
pp. 8093
Author(s):  
Jun Wang ◽  
Yuanyuan Xu ◽  
Hengpeng Xu ◽  
Zhe Sun ◽  
Zhenglu Yang ◽  
...  
Keyword(s):  
Machine Learning ◽  
Feature Selection ◽  
Learning Performance ◽  
Space Structures ◽  
Learning Tasks ◽  
Feature Spaces ◽  
Selection Approach ◽  
Label Correlations ◽  
Feature Selection Approach ◽  
Low Dimensional

Feature selection has devoted a consistently great amount of effort to dimension reduction for various machine learning tasks. Existing feature selection models focus on selecting the most discriminative features for learning targets. However, this strategy is weak in handling two kinds of features, that is, the irrelevant and redundant ones, which are collectively referred to as noisy features. These features may hamper the construction of optimal low-dimensional subspaces and compromise the learning performance of downstream tasks. In this study, we propose a novel multi-label feature selection approach by embedding label correlations (dubbed ELC) to address these issues. Particularly, we extract label correlations for reliable label space structures and employ them to steer feature selection. In this way, label and feature spaces can be expected to be consistent and noisy features can be effectively eliminated. An extensive experimental evaluation on public benchmarks validated the superiority of ELC.

FIVE NEW FEATURE SELECTION METRICS IN TEXT CATEGORIZATION

2007 ◽  
Vol 21 (06) ◽  
pp. 1085-1101 ◽  
Author(s):  
FENGXI SONG ◽  
DAVID ZHANG ◽  
YONG XU ◽  
JIZHONG WANG
Keyword(s):  
Feature Selection ◽  
Text Categorization ◽  
Chi Square ◽  
Document Frequency ◽  
Feature Spaces ◽  
Text Feature ◽  
Statistical Pattern ◽  
Individual Features ◽  
New Feature ◽  
Data Collections

Feature selection has been extensively applied in statistical pattern recognition as a mechanism for cleaning up the set of features that are used to represent data and as a way of improving the performance of classifiers. Four schemes commonly used for feature selection are Exponential Searches, Stochastic Searches, Sequential Searches, and Best Individual Features. The most popular scheme used in text categorization is Best Individual Features as the extremely high dimensionality of text feature spaces render the other three feature selection schemes time prohibitive. This paper proposes five new metrics for selecting Best Individual Features for use in text categorization. Their effectiveness have been empirically tested on two well- known data collections, Reuters-21578 and 20 Newsgroups. Experimental results show that the performance of two of the five new metrics, Bayesian Rule and F-one Value, is not significantly below that of a good traditional text categorization selection metric, Document Frequency. The performance of another two of these five new metrics, Low Loss Dimensionality Reduction and Relative Frequency Difference, is equal to or better than that of conventional good feature selection metrics such as Mutual Information and Chi-square Statistic.

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.

scholarly journals Genetic Algorithm Based Feature Selection In a Recognition Scheme Using Adaptive Neuro Fuzzy Techniques

2010 ◽  
Vol 5 (4) ◽  
pp. 458 ◽  
Author(s):  
Mahua Bhattacharya ◽  
Arpita Das
Keyword(s):  
Genetic Algorithm ◽  
Feature Selection ◽  
Feature Space ◽  
Classification Performance ◽  
Significant Feature ◽  
Feature Subset ◽  
Neuro Fuzzy ◽  
Feature Spaces ◽  
Fuzzy Techniques

The problem of feature selection consists of finding a significant feature subset of input training as well as test patterns that enable to describe all information required to classify a particular pattern. In present paper we focus in this particular problem which plays a key role in machine learning problems. In fact, before building a model for feature selection, our goal is to identify and to reject the features that degrade the classification performance of a classifier. This is especially true when the available input feature space is very large, and need exists to develop an efficient searching algorithm to combine these features spaces to a few significant one which are capable to represent that particular class. Presently, authors have described two approaches for combining the large feature spaces to efficient numbers using Genetic Algorithm and Fuzzy Clustering techniques. Finally the classification of patterns has been achieved using adaptive neuro-fuzzy techniques. The aim of entire work is to implement the recognition scheme for classification of tumor lesions appearing in human brain as space occupying lesions identified by CT and MR images. A part of the work has been presented in this paper. The proposed model indicates a promising direction for adaptation in a changing environment.

Sign in / Sign up

Export Citation Format

Share Document