Sciweavers

1403 search results - page 26 / 281
» Sampling Techniques for Kernel Methods
Sort
View
FLAIRS
2004
14 years 11 months ago
Gene Expression Data Classification with Revised Kernel Partial Least Squares Algorithm
One important feature of the gene expression data is that the number of genes M far exceeds the number of samples N. Standard statistical methods do not work well when N < M. D...
ZhenQiu Liu, Dechang Chen
IJON
2007
94views more  IJON 2007»
14 years 9 months ago
A method for speeding up feature extraction based on KPCA
Kernel principal component analysis (KPCA) extracts features of samples with an efficiency in inverse proportion to the size of the training sample set. In this paper, we develop...
Yong Xu, David Zhang, Fengxi Song, Jing-Yu Yang, Z...
PAA
2002
14 years 9 months ago
Bagging, Boosting and the Random Subspace Method for Linear Classifiers
: Recently bagging, boosting and the random subspace method have become popular combining techniques for improving weak classifiers. These techniques are designed for, and usually ...
Marina Skurichina, Robert P. W. Duin
VISAPP
2008
14 years 11 months ago
Continuous Learning of Simple Visual Concepts Using Incremental Kernel Density Estimation
In this paper we propose a method for continuous learning of simple visual concepts. The method continuously associates words describing observed scenes with automatically extracte...
Danijel Skocaj, Matej Kristan, Ales Leonardis
ICCAD
1998
IEEE
75views Hardware» more  ICCAD 1998»
15 years 2 months ago
A fast, accurate, and non-statistical method for fault coverage estimation
We present a fast, dynamic fault coverage estimation technique for sequential circuits that achieves high degrees of accuracy by signi cantly reducing the number of injected fault...
Michael S. Hsiao