Sciweavers

1416 search results - page 118 / 284
» Optimal feature selection for support vector machines
Sort
View
ICCS
2001
Springer
14 years 11 days ago
Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
Eun-Jin Im, Katherine A. Yelick
CVPR
2005
IEEE
14 years 1 months ago
Nonlinear Face Recognition Based on Maximum Average Margin Criterion
This paper proposes a novel nonlinear discriminant analysis method named by Kernerlized Maximum Average Margin Criterion (KMAMC), which has combined the idea of Support Vector Mac...
Baochang Zhang, Xilin Chen, Shiguang Shan, Wen Gao
ISBI
2009
IEEE
14 years 2 months ago
Probabilistic Branching Node Detection Using Hybrid Local Features
Probabilistic branching node inference is an important step for analyzing branching patterns involved in many anatomic structures. We propose combining machine learning techniques...
Haibin Ling, Michael Barnathan, Vasileios Megalooi...
IJCNN
2006
IEEE
14 years 1 months ago
P-SVM Variable Selection for Discovering Dependencies Between Genetic and Brain Imaging Data
— The joint analysis of genetic and brain imaging data is the key to understand the genetic underpinnings of brain dysfunctions in several psychiatric diseases known to have a st...
Johannes Mohr, Imke Puis, Jana Wrase, Sepp Hochrei...
ICANN
2007
Springer
13 years 11 months ago
Resilient Approximation of Kernel Classifiers
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
Thorsten Suttorp, Christian Igel