Sciweavers

502 search results - page 38 / 101
» Learning from General Label Constraints
Sort
View
JMLR
2006
99views more  JMLR 2006»
13 years 8 months ago
Worst-Case Analysis of Selective Sampling for Linear Classification
A selective sampling algorithm is a learning algorithm for classification that, based on the past observed data, decides whether to ask the label of each new instance to be classi...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...
NIPS
2004
13 years 10 months ago
Nonparametric Transforms of Graph Kernels for Semi-Supervised Learning
We present an algorithm based on convex optimization for constructing kernels for semi-supervised learning. The kernel matrices are derived from the spectral decomposition of grap...
Xiaojin Zhu, Jaz S. Kandola, Zoubin Ghahramani, Jo...
COLT
2005
Springer
13 years 10 months ago
Loss Bounds for Online Category Ranking
Category ranking is the task of ordering labels with respect to their relevance to an input instance. In this paper we describe and analyze several algorithms for online category r...
Koby Crammer, Yoram Singer
CCR
2010
156views more  CCR 2010»
13 years 8 months ago
Evolvable network architectures: what can we learn from biology?
There is significant research interest recently to understand the evolution of the current Internet, as well as to design clean-slate Future Internet architectures. Clearly, even ...
Constantine Dovrolis, J. Todd Streelman
MM
2004
ACM
151views Multimedia» more  MM 2004»
14 years 2 months ago
Multimodal concept-dependent active learning for image retrieval
It has been established that active learning is effective for learning complex, subjective query concepts for image retrieval. However, active learning has been applied in a conc...
Kingshy Goh, Edward Y. Chang, Wei-Cheng Lai