4591 search results - page 576 / 919 » Learning from Dyadic Data |
131
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
An intuitive approach to utilizing unlabeled data in kernel-based classification algorithms is to simply treat unknown labels as additional optimization variables. For marginbased...
128
Voted
CHI
2007
ACM
16 years 6 months ago
2007
ACM
The increasing integration of education and technology has led to the development of a range of note-taking applications. Our project's goal is to provide empirical data to g...
181
click to vote
NIPS
2003
15 years 7 months ago
2003
Label ranking is the task of inferring a total order over a predefined set of labels for each given instance. We present a general framework for batch learning of label ranking f...
178
click to vote
KES
2006
Springer
15 years 6 months ago
2006
Springer
The issue of Automatic Relevance Determination (ARD) has attracted attention over the last decade for the sake of efficiency and accuracy of classifiers, and also to extract knowle...
192
click to vote
JMLR
2010
15 years 4 months ago
2010
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...