1055 search results - page 92 / 211 » Convex Factorization Machines |
87
Voted
ECML
2007
Springer
15 years 6 months ago
2007
Springer
Given a binary classification task, a ranker sorts a set of instances from highest to lowest expectation that the instance is positive. We propose a lexicographic ranker, LexRank,...
110
click to vote
COLT
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
119
Voted
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
105
click to vote
JMLR
2002
15 years 9 days ago
2002
Approximate Bayesian Gaussian process (GP) classification techniques are powerful nonparametric learning methods, similar in appearance and performance to support vector machines....
109
Voted
ICMLA
2009
14 years 10 months ago
2009
This article proposes an algorithm to automatically learn useful transformations of data to improve accuracy in supervised classification tasks. These transformations take the for...