Sciweavers

1772 search results - page 24 / 355
» Classifying Problems into Complexity Classes
Sort
View
COLT
2008
Springer
13 years 9 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
ICLP
1997
Springer
13 years 12 months ago
Hybrid Probabilistic Programs
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...
Alex Dekhtyar, V. S. Subrahmanian
SDM
2010
SIAM
165views Data Mining» more  SDM 2010»
13 years 9 months ago
Exact Passive-Aggressive Algorithm for Multiclass Classification Using Support Class
The Passive Aggressive framework [1] is a principled approach to online linear classification that advocates minimal weight updates i.e., the least required so that the current tr...
Shin Matsushima, Nobuyuki Shimizu, Kazuhiro Yoshid...
CORR
2011
Springer
183views Education» more  CORR 2011»
12 years 11 months ago
Learning When Training Data are Costly: The Effect of Class Distribution on Tree Induction
For large, real-world inductive learning problems, the number of training examples often must be limited due to the costs associated with procuring, preparing, and storing the tra...
Foster J. Provost, Gary M. Weiss
IPMI
2001
Springer
14 years 8 months ago
Deformation Analysis for Shape Based Classification
Statistical analysis of anatomical shape differences between two different populations can be reduced to a classification problem, i.e., learning a classifier function for assignin...
Polina Golland, W. Eric L. Grimson, Martha Elizabe...