Sciweavers

899 search results - page 90 / 180
» Is an ordinal class structure useful in classifier learning
Sort
View
COLT
2008
Springer
13 years 10 months ago
An Efficient Reduction of Ranking to Classification
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
Nir Ailon, Mehryar Mohri
VIP
2003
13 years 10 months ago
Using Dual Cascading Learning Frameworks for Image Indexing
To bridge the semantic gap in content-based image retrieval, detecting meaningful visual entities (e.g. faces, sky, foliage, buildings etc) in image content and classifying images...
Joo-Hwee Lim, Jesse S. Jin
SIGIR
2008
ACM
13 years 8 months ago
Learning from labeled features using generalized expectation criteria
It is difficult to apply machine learning to new domains because often we lack labeled problem instances. In this paper, we provide a solution to this problem that leverages domai...
Gregory Druck, Gideon S. Mann, Andrew McCallum
JMLR
2006
118views more  JMLR 2006»
13 years 8 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
CORR
2006
Springer
127views Education» more  CORR 2006»
13 years 8 months ago
Semi-Supervised Learning -- A Statistical Physics Approach
We present a novel approach to semisupervised learning which is based on statistical physics. Most of the former work in the field of semi-supervised learning classifies the point...
Gad Getz, Noam Shental, Eytan Domany