ICML
2003
IEEE
15 years 15 days ago
2003
IEEE
Over the past few years, a number of approximate inference algorithms for networked data have been put forth. We empirically compare the performance of three of the popular algori...
ICML
2003
IEEE
15 years 15 days ago
2003
IEEE
We examine the set covering machine when it uses data-dependent half-spaces for its set of features and bound its generalization error in terms of the number of training errors an...
ICML
2003
IEEE
15 years 15 days ago
2003
IEEE
We present a learning framework for Markovian decision processes that is based on optimization in the policy space. Instead of using relatively slow gradient-based optimization al...
ICML
2003
IEEE
15 years 15 days ago
2003
IEEE
ICML
2003
IEEE
15 years 15 days ago
2003
IEEE
ICML
2003
IEEE
15 years 15 days ago
2003
IEEE
The paper extends the notion of linear programming boosting to handle uneven datasets. Extensive experiments with text classification problem compare the performance of a number o...
ICML
2003
IEEE
15 years 15 days ago
2003
IEEE
The problem of learning with positive and unlabeled examples arises frequently in retrieval applications. We transform the problem into a problem of learning with noise by labelin...
ICML
2003
IEEE
15 years 15 days ago
2003
IEEE
ICML
2003
IEEE
15 years 15 days ago
2003
IEEE
In various application domains, including image recognition, it is natural to represent each example as a set of vectors. With a base kernel we can implicitly map these vectors to...
ICML
2003
IEEE
15 years 15 days ago
2003
IEEE
In this paper, we address the problem of finding the pre-image of a feature vector in the feature space induced by a kernel. This is of central importance in some kernel applicatio...