Sciweavers

495 search results - page 60 / 99
» Learning to generalize for complex selection tasks
Sort
View
ICML
2005
IEEE
14 years 8 months ago
An efficient method for simplifying support vector machines
In this paper we describe a new method to reduce the complexity of support vector machines by reducing the number of necessary support vectors included in their solutions. The red...
DucDung Nguyen, Tu Bao Ho
SIGDIAL
2010
13 years 5 months ago
Sparse Approximate Dynamic Programming for Dialog Management
Spoken dialogue management strategy optimization by means of Reinforcement Learning (RL) is now part of the state of the art. Yet, there is still a clear mismatch between the comp...
Senthilkumar Chandramohan, Matthieu Geist, Olivier...
ICML
2008
IEEE
14 years 8 months ago
Expectation-maximization for sparse and non-negative PCA
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
Christian D. Sigg, Joachim M. Buhmann
ICML
2005
IEEE
14 years 8 months ago
Computational aspects of Bayesian partition models
The conditional distribution of a discrete variable y, given another discrete variable x, is often specified by assigning one multinomial distribution to each state of x. The cost...
Mikko Koivisto, Kismat Sood
CIKM
2008
Springer
13 years 9 months ago
Kernel methods, syntax and semantics for relational text categorization
Previous work on Natural Language Processing for Information Retrieval has shown the inadequateness of semantic and syntactic structures for both document retrieval and categoriza...
Alessandro Moschitti