Sciweavers

3718 search results - page 22 / 744
» On learning with dissimilarity functions
Sort
View
ICML
2004
IEEE
15 years 7 months ago
Active learning of label ranking functions
The effort necessary to construct labeled sets of examples in a supervised learning scenario is often disregarded, though in many applications, it is a time-consuming and expensi...
Klaus Brinker
ICML
2009
IEEE
16 years 2 months ago
A simpler unified analysis of budget perceptrons
The kernel Perceptron is an appealing online learning algorithm that has a drawback: whenever it makes an error it must increase its support set, which slows training and testing ...
Ilya Sutskever
97
Voted
CANDC
2002
ACM
15 years 1 months ago
A model for information technologies that can be creative
To contribute to HCI investigation and interface design that develops interactive systems for creative solutions, I attempt to formulate a model of the human capability to combine...
Johan F. Hoorn
115
Voted
ICML
2009
IEEE
16 years 2 months ago
Geometry-aware metric learning
In this paper, we introduce a generic framework for semi-supervised kernel learning. Given pairwise (dis-)similarity constraints, we learn a kernel matrix over the data that respe...
Zhengdong Lu, Prateek Jain, Inderjit S. Dhillon
101
Voted
ICML
2007
IEEE
16 years 2 months ago
Constructing basis functions from directed graphs for value function approximation
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
Jeffrey Johns, Sridhar Mahadevan