126 search results - page 11 / 26 » nips 2001 |
NIPS
2001
14 years 11 months ago
2001
We present a new approach to the supervised learning of lateral interactions for the competitive layer model (CLM) dynamic feature binding architecture. The method is based on con...
118
click to vote
NIPS
2001
14 years 11 months ago
2001
The support vector machine (SVM) is known for its good performance in binary classification, but its extension to multi-class classification is still an on-going research issue. I...
NIPS
2001
14 years 11 months ago
2001
In previous work on "transformed mixtures of Gaussians" and "transformed hidden Markov models", we showed how the EM algorithm in a discrete latent variable mo...
NIPS
2001
14 years 11 months ago
2001
We derive an equivalence between AdaBoost and the dual of a convex optimization problem, showing that the only difference between minimizing the exponential loss used by AdaBoost ...
NIPS
2001
14 years 11 months ago
2001
We describe the application of kernel methods to Natural Language Processing (NLP) problems. In many NLP tasks the objects being modeled are strings, trees, graphs or other discre...