A Constrained Genetic Algorithm for Efficient Dimensionality Reduction for Pattern Classification

2007 ◽  
Author(s):  
Rajesh Chandrasekhara Panicker ◽  
Sadasivan Puthusserypady
Keyword(s):  
Genetic Algorithm ◽  
Dimensionality Reduction ◽  
Pattern Classification

Dimensionality Reduction and Classification of Hyperspectral Images using Genetic Algorithm

2016 ◽  
Vol 3 (3) ◽  
pp. 503 ◽  
Author(s):  
R. Kiran Kumar ◽  
B. Saichandana ◽  
K. Srinivas
Keyword(s):  
Genetic Algorithm ◽  
Dimensionality Reduction ◽  
Hyperspectral Image ◽  
Image Data ◽  
Unsupervised Classification ◽  
Hyperspectral Data ◽  
Band Selection ◽  
Data Set ◽  
Mode Decomposition ◽  
Fused Image

<p>This paper presents genetic algorithm based band selection and classification on hyperspectral image data set. Hyperspectral remote sensors collect image data for a large number of narrow, adjacent spectral bands. Every pixel in hyperspectral image involves a continuous spectrum that is used to classify the objects with great detail and precision. In this paper, first filtering based on 2-D Empirical mode decomposition method is used to remove any noisy components in each band of the hyperspectral data. After filtering, band selection is done using genetic algorithm in-order to remove bands that convey less information. This dimensionality reduction minimizes many requirements such as storage space, computational load, communication bandwidth etc which is imposed on the unsupervised classification algorithms. Next image fusion is performed on the selected hyperspectral bands to selectively merge the maximum possible features from the selected images to form a single image. This fused image is classified using genetic algorithm. Three different indices, such as K-means Index (KMI) and Jm measure are used as objective functions. This method increases classification accuracy and performance of hyperspectral image than without dimensionality reduction.</p>

INVESTIGATING LONG-TERM EFFECTS OF FEATURE EXTRACTION METHODS FOR CONTINUOUS EMG PATTERN CLASSIFICATION

2012 ◽  
Vol 11 (04) ◽  
pp. 1250028 ◽  
Author(s):  
ANGKOON PHINYOMARK ◽  
PORNCHAI PHUKPATTARANONT ◽  
CHUSAK LIMSAKUL
Keyword(s):  
Feature Extraction ◽  
Dimensionality Reduction ◽  
Pattern Classification ◽  
Time Domain ◽  
Time Scale ◽  
Extraction Methods ◽  
Feature Sets ◽  
Scale Feature ◽  
Multiple Feature

Based on recent advances in modern multifunction myoelectric control devices, a combination of effective feature extraction and classification methods is required to enhance the high classification performance, especially in accuracy viewpoint. However, for realizing practical applications of myoelectric control, the effect of long-term usage or reusability is one of the challenging issues that should be more carefully considered, whereas only a few works have investigated this effect in recent. In this study, the behavior of the state-of-the-art multiple feature extraction methods was investigated with the fluctuating electromyography (EMG) signals recorded during four different days with a large number of trials and subjects. To this end, seven multiple feature sets were compared consisting features based on time domain and time-scale representation. Two major points were emphasized: (1) the optimal robust feature set for continuous (both transient and steady-state signals) EMG pattern classification and (2) the effect of fluctuating EMG signals with feature extraction methods for long-term usage. From the classification results, time domain feature sets yielded better performance than time-scale feature sets. The classification accuracies of the time-domain-feature sets had always achieved above 80% by using linear discriminant analysis (LDA) as a classifier and uncorrelated LDA (ULDA) as a dimensionality reduction, whereas the classification accuracies of the time-scale-feature sets were lower than 70% for the fluctuating EMG signals. The effect of dimensionality reduction for the classification of fluctuating EMG signals was also discussed.

A NEW ENSEMBLE METHOD FOR FEATURE RANKING IN TEXT MINING

2013 ◽  
Vol 22 (03) ◽  
pp. 1350010 ◽  
Author(s):  
SABEREH SADEGHI ◽  
HAMID BEIGY
Keyword(s):  
Genetic Algorithm ◽  
Feature Selection ◽  
Dimensionality Reduction ◽  
Ensemble Methods ◽  
Ease Of Use ◽  
Convergence Time ◽  
Feature Ranking ◽  
Initial Population ◽  
Feature Subset ◽  
Ranking Methods

Dimensionality reduction is a necessary task in data mining when working with high dimensional data. A type of dimensionality reduction is feature selection. Feature selection based on feature ranking has received much attention by researchers. The major reasons are its scalability, ease of use, and fast computation. Feature ranking methods can be divided into different categories and may use different measures for ranking features. Recently, ensemble methods have entered in the field of ranking and achieved more accuracy among others. Accordingly, in this paper a Heterogeneous ensemble based algorithm for feature ranking is proposed. The base ranking methods in this ensemble structure are chosen from different categories like information theoretic, distance based, and statistical methods. The results of the base ranking methods are then fused into a final feature subset by means of genetic algorithm. The diversity of the base methods improves the quality of initial population of the genetic algorithm and thus reducing the convergence time of the genetic algorithm. In most of ranking methods, it's the user's task to determine the threshold for choosing the appropriate subset of features. It is a problem, which may cause the user to try many different values to select a good one. In the proposed algorithm, the difficulty of determining a proper threshold by the user is decreased. The performance of the algorithm is evaluated on four different text datasets and the experimental results show that the proposed method outperforms all other five feature ranking methods used for comparison. One advantage of the proposed method is that it is independent to the classification method used for classification.

scholarly journals Deriving Rules for Forecasting Air Carrier Financial Stress and Insolvency: A Genetic Algorithm Approach

2010 ◽  
Author(s):  
Sergio Davalos ◽  
Richard Gritta ◽  
Bahram Adrangi
Keyword(s):  
Neural Network ◽  
Artificial Intelligence ◽  
Genetic Algorithm ◽  
Artificial Neural Network ◽  
Feature Selection ◽  
Dimensionality Reduction ◽  
Local Optima ◽  
Air Carrier ◽  
Genetic Algorithm Approach ◽  
Genetic Algorithm Model

Statistical and artificial intelligence methods have successfully classified organizational solvency, but are limited in terms of generalization, knowledge on how a conclusion was reached, convergence to a local optima, or inconsistent results. Issues such as dimensionality reduction and feature selection can also affect a model's performance. This research explores the use of the genetic algorithm that has the advantages of the artificial neural network but without its limitations. The genetic algorithm model resulted in a set of easy to understand, if-then rules that were used to assess U.S. air carrier solvency with a 94% accuracy.

Image Dimensionality Reduction Based on the Intrinsic Dimension and Parallel Genetic Algorithm

2011 ◽  
Vol 5 (2) ◽  
pp. 97-112 ◽  
Author(s):  
Liang Lei ◽  
TongQing Wang ◽  
Jun Peng ◽  
Bo Yang
Keyword(s):  
Genetic Algorithm ◽  
Dimensionality Reduction ◽  
Image Features ◽  
Similarity Function ◽  
Nonlinear Dimensionality Reduction ◽  
General Covariance ◽  
Parallel Genetic Algorithm ◽  
Web Content ◽  
Genetic Operators ◽  
Intrinsic Dimension

In the research of Web content-based image retrieval, how to reduce more of the image dimensions without losing the main features of the image is highlighted. Many features of dimensional reduction schemes are determined by the breaking of higher dimensional general covariance associated with the selection of a particular subset of coordinates. This paper starts with analysis of commonly used methods for the dimension reduction of Web images, followed by a new algorithm for nonlinear dimensionality reduction based on the HSV image features. The approach obtains intrinsic dimension estimation by similarity calculation of two images. Finally, some improvements were made on the Parallel Genetic Algorithm (APGA) by use of the image similarity function as the self-adaptive judgment function to improve the genetic operators, thus achieving a Web image dimensionality reduction and similarity retrieval. Experimental results illustrate the validity of the algorithm.

Sign in / Sign up

Export Citation Format

Share Document