Sciweavers

775 search results - page 36 / 155
» Memetic Algorithms for Feature Selection on Microarray Data
Sort
View
SGAI
2004
Springer
14 years 27 days ago
Overfitting in Wrapper-Based Feature Subset Selection: The Harder You Try the Worse it Gets
In Wrapper based feature selection, the more states that are visited during the search phase of the algorithm the greater the likelihood of finding a feature subset that has a high...
John Loughrey, Padraig Cunningham
ADMA
2006
Springer
127views Data Mining» more  ADMA 2006»
14 years 1 months ago
Feature Selection for Complex Patterns
Feature selection is an important data preprocessing step in data mining and pattern recognition. Many algorithms have been proposed in the past for simple patterns that can be cha...
Peter Schenkel, Wanqing Li, Wanquan Liu
ICDM
2005
IEEE
153views Data Mining» more  ICDM 2005»
14 years 1 months ago
Speculative Markov Blanket Discovery for Optimal Feature Selection
In this paper we address the problem of learning the Markov blanket of a quantity from data in an efficient manner. Markov blanket discovery can be used in the feature selection ...
Sandeep Yaramakala, Dimitris Margaritis
CIARP
2006
Springer
13 years 11 months ago
Oscillating Feature Subset Search Algorithm for Text Categorization
Abstract. A major characteristic of text document categorization problems is the extremely high dimensionality of text data. In this paper we explore the usability of the Oscillati...
Jana Novovicová, Petr Somol, Pavel Pudil
PAKDD
2000
ACM
124views Data Mining» more  PAKDD 2000»
13 years 11 months ago
Feature Selection for Clustering
In clustering, global feature selection algorithms attempt to select a common feature subset that is relevant to all clusters. Consequently, they are not able to identify individu...
Manoranjan Dash, Huan Liu