36 search results - page 6 / 8 » A Polynomial-Time Algorithm for Learning Noisy Linear Thresh... |
133
Voted
JMLR
2008
15 years 2 months ago
2008
The max-sum classifier predicts n-tuple of labels from n-tuple of observable variables by maximizing a sum of quality functions defined over neighbouring pairs of labels and obser...
136
Voted
NIPS
2001
15 years 4 months ago
2001
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...
146
click to vote
COLT
2000
Springer
15 years 7 months ago
2000
Springer
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
139
Voted
ML
2008
ACM
15 years 2 months ago
2008
ACM
Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new cond...
106
click to vote
CIKM
2008
Springer
15 years 4 months ago
2008
Springer
Many of the recently proposed algorithms for learning feature-based ranking functions are based on the pairwise preference framework, in which instead of taking documents in isola...