ICML
2007
IEEE
15 years 1 months ago
2007
IEEE
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...
ICML
2007
IEEE
15 years 1 months ago
2007
IEEE
This paper introduces a new problem for which machine-learning tools may make an impact. The problem considered is termed "compressive sensing", in which a real signal o...
ICML
2007
IEEE
15 years 1 months ago
2007
IEEE
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
ICML
2007
IEEE
15 years 1 months ago
2007
IEEE
This paper presents a novel Gaussian process (GP) approach to regression with inputdependent noise rates. We follow Goldberg et al.'s approach and model the noise variance us...
ICML
2007
IEEE
15 years 1 months ago
2007
IEEE
Linear Discriminant Analysis (LDA) is a well-known method for dimensionality reduction and classification. LDA in the binaryclass case has been shown to be equivalent to linear re...
ICML
2007
IEEE
15 years 1 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
ICML
2007
IEEE
15 years 1 months ago
2007
IEEE
In multi-task learning our goal is to design regression or classification models for each of the tasks and appropriately share information between tasks. A Dirichlet process (DP) ...
ICML
2007
IEEE
15 years 1 months ago
2007
IEEE
We address the problem of feature selection in a kernel space to select the most discriminative and informative features for classification and data analysis. This is a difficult ...
ICML
2007
IEEE
15 years 1 months ago
2007
IEEE
In this paper we investigate the regularization property of Kernel Principal Component Analysis (KPCA), by studying its application as a preprocessing step to supervised learning ...
ICML
2007
IEEE
15 years 1 months ago
2007
IEEE
In this paper we present a novel algorithm, CarpeDiem. It significantly improves on the time complexity of Viterbi algorithm, preserving the optimality of the result. This fact ha...