Feature selection for computer-aided polyp detection using genetic algorithms

2003 ◽  
Author(s):  
Meghan T. Miller ◽  
Anna K. Jerebko ◽  
James D. Malley ◽  
Ronald M. Summers
Keyword(s):  
Genetic Algorithms ◽  
Feature Selection ◽  
Polyp Detection ◽  
Computer Aided ◽  
Selection For

scholarly journals Feature selection for computer-aided polyp detection using MRMR

2010 ◽  
Author(s):  
Xiaoyun Yang ◽  
Boray Tek ◽  
Gareth Beddoe ◽  
Greg Slabaugh
Keyword(s):  
Feature Selection ◽  
Polyp Detection ◽  
Computer Aided ◽  
Selection For

FEATURE SELECTION FOR SUPPORT VECTOR MACHINES USING GENETIC ALGORITHMS

2004 ◽  
Vol 13 (04) ◽  
pp. 791-800 ◽  
Author(s):  
HOLGER FRÖHLICH ◽  
OLIVIER CHAPELLE ◽  
BERNHARD SCHÖLKOPF
Keyword(s):  
Genetic Algorithms ◽  
Feature Selection ◽  
Support Vector Machines ◽  
Cross Validation ◽  
Support Vector ◽  
Generalization Error ◽  
New Approach ◽  
Vector Machines ◽  
Selection For ◽  
Natural Way

The problem of feature selection is a difficult combinatorial task in Machine Learning and of high practical relevance, e.g. in bioinformatics. Genetic Algorithms (GAs) offer a natural way to solve this problem. In this paper we present a special Genetic Algorithm, which especially takes into account the existing bounds on the generalization error for Support Vector Machines (SVMs). This new approach is compared to the traditional method of performing cross-validation and to other existing algorithms for feature selection.

AN EFFICIENT FEATURE SELECTION ALGORITHM FOR COMPUTER-AIDED POLYP DETECTION

2006 ◽  
Vol 15 (06) ◽  
pp. 893-915 ◽  
Author(s):  
JIANG LI ◽  
JIANHUA YAO ◽  
RONALD M. SUMMERS ◽  
NICHOLAS PETRICK ◽  
MICHAEL T. MANRY ◽  
...  
Keyword(s):  
Feature Selection ◽  
Cross Validation ◽  
Search Algorithm ◽  
Piecewise Linear ◽  
Least Square ◽  
Support Vector ◽  
Selection Algorithm ◽  
Feature Selection Algorithm ◽  
Polyp Detection ◽  
Computer Aided

We present an efficient feature selection algorithm for computer aided detection (CAD) computed tomographic (CT) colonography. The algorithm (1) determines an appropriate piecewise linear network (PLN) model by cross validation, (2) applies the orthonormal least square (OLS) procedure to the PLN model utilizing a Modified Schmidt procedure, and (3) uses a floating search algorithm to select features that minimize the output variance. The undesirable "nesting effect" is prevented by the floating search approach, and the piecewise linear OLS procedure makes this algorithm very computationally efficient because the Modified Schmidt procedure only requires one data pass during the whole searching process. The selected features are compared to those obtained by other methods, through cross validation with support vector machines (SVMs).

Feature Selection for Computer-Aided Angle Closure Glaucoma Mechanism Detection

2012 ◽  
Vol 2 (4) ◽  
pp. 438-444 ◽  
Author(s):  
Adrianto Wirawan ◽  
Chee Keong Kwoh ◽  
Paul Tec Kuan Chew ◽  
Maria Cecilia D. Aquino ◽  
Seng Chee Loon ◽  
...  
Keyword(s):  
Feature Selection ◽  
Angle Closure Glaucoma ◽  
Angle Closure ◽  
Computer Aided ◽  
Selection For

Genetic Algorithms for Feature Selection for Brain–Computer Interface

2015 ◽  
Vol 29 (05) ◽  
pp. 1559008 ◽  
Author(s):  
Izabela Rejer
Keyword(s):  
Genetic Algorithms ◽  
Feature Selection ◽  
Brain Computer Interface ◽  
Computer Interface ◽  
Eeg Signals ◽  
Crucial Problem ◽  
Left And Right ◽  
Selection For ◽  
First Time

The crucial problem that has to be solved when designing an effective brain–computer interface (BCI) is: how to reduce the huge space of features extracted from raw electroencephalography (EEG) signals. One of the strategies for feature selection that is often applied by BCI researchers is based on genetic algorithms (GAs). The two types of GAs that are most commonly used in BCI research are the classic algorithm and the Culling algorithm. This paper presents both algorithms and their application for selecting features crucial for the correct classification of EEG signals recorded during imagery movements of the left and right hand. The results returned by both algorithms are compared to those returned by an algorithm with aggressive mutation and an algorithm with melting individuals, both of which have been proposed by the author of this paper. While the aggressive mutation algorithm has been published previously, the melting individuals algorithm is presented here for the first time.

Sign in / Sign up

Export Citation Format

Share Document