Sciweavers

811 search results - page 50 / 163
» Minimal Kernel Classifiers
Sort
View
JMLR
2002
106views more  JMLR 2002»
14 years 9 months ago
Some Greedy Learning Algorithms for Sparse Regression and Classification with Mercer Kernels
We present some greedy learning algorithms for building sparse nonlinear regression and classification models from observational data using Mercer kernels. Our objective is to dev...
Prasanth B. Nair, Arindam Choudhury 0002, Andy J. ...
NIPS
2004
14 years 11 months ago
An Application of Boosting to Graph Classification
This paper presents an application of Boosting for classifying labeled graphs, general structures for modeling a number of real-world data, such as chemical compounds, natural lan...
Taku Kudo, Eisaku Maeda, Yuji Matsumoto
PRL
2008
118views more  PRL 2008»
14 years 9 months ago
A large margin approach for writer independent online handwriting classification
This paper proposes a new approach for classifying multivariate time-series with applications to the problem of writer independent online handwritten character recognition. Each t...
Karthik Kumara, Rahul Agrawal, Chiranjib Bhattacha...
JCB
2000
107views more  JCB 2000»
14 years 9 months ago
A Discriminative Framework for Detecting Remote Protein Homologies
A new method for detecting remote protein homologies is introduced and shown to perform well in classifying protein domains by SCOP superfamily. The method is a variant of support...
Tommi Jaakkola, Mark Diekhans, David Haussler
CORR
2010
Springer
53views Education» more  CORR 2010»
14 years 9 months ago
Parametric polynomial minimal surfaces of arbitrary degree
Weierstrass representation is a classical parameterization of minimal surfaces. However, two functions should be specified to construct the parametric form in Weierestrass represe...
Gang Xu, Guozhao Wang