4591 search results - page 263 / 919 » Learning from Dyadic Data |
166
Voted
PKDD
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. When faced with the task of building accurate classifiers, active learning is often a beneficial tool for minimizing the requisite costs of human annotation. Traditional ...
163
click to vote
EMMCVPR
1999
Springer
15 years 9 months ago
1999
Springer
This paper considers the use of the EM-algorithm, combined with mean field theory, for parameter estimation in Markov random field models from unlabelled data. Special attention ...
160
click to vote
UAI
2008
15 years 6 months ago
2008
An efficient policy search algorithm should estimate the local gradient of the objective function, with respect to the policy parameters, from as few trials as possible. Whereas m...
133
click to vote
ICML
2002
IEEE
16 years 5 months ago
2002
IEEE
This paper addresses cost-sensitive classification in the setting where there are costs for measuring each attribute as well as costs for misclassification errors. We show how to ...
144
click to vote
ICML
2007
IEEE
16 years 5 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...