Sciweavers

1126 search results - page 7 / 226
» Strong Feature Sets from Small Samples
Sort
View
ICML
1998
IEEE
14 years 8 months ago
A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
Michael J. Kearns, Yishay Mansour
IJIT
2004
13 years 9 months ago
Genetic Algorithm for Feature Subset Selection with Exploitation of Feature Correlations from Continuous Wavelet Transform: a re
A genetic algorithm (GA) based feature subset selection algorithm is proposed in which the correlation structure of the features is exploited. The subset of features is validated a...
Gert Van Dijck, Marc M. Van Hulle, M. Wevers
BIOINFORMATICS
2005
109views more  BIOINFORMATICS 2005»
13 years 7 months ago
Prediction error estimation: a comparison of resampling methods
In genomic studies, thousands of features are collected on relatively few samples. One of the goals of these studies is to build classifiers to predict the outcome of future obser...
Annette M. Molinaro, Richard Simon, Ruth M. Pfeiff...
MICCAI
2000
Springer
13 years 11 months ago
Small Sample Size Learning for Shape Analysis of Anatomical Structures
We present a novel approach to statistical shape analysis of anatomical structures based on small sample size learning techniques. The high complexity of shape models used in medic...
Polina Golland, W. Eric L. Grimson, Martha Elizabe...
IEE
2002
72views more  IEE 2002»
13 years 7 months ago
Making inferences with small numbers of training sets
This paper discusses a potential methodological problem with empirical studies assessing project effort prediction systems. Frequently a hold-out strategy is deployed so that the ...
Colin Kirsopp, Martin J. Shepperd