𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient algorithm for learning to rank from

✍ Scribed by Tapio Pahikkala; Evgeni Tsivtsivadze; Antti Airola; Jouni Järvinen; Jorma Boberg

Publisher
Springer
Year
2009
Tongue
English
Weight
770 KB
Volume
75
Category
Article
ISSN
0885-6125

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Efficient Membership-Query Algorithm
An Efficient Membership-Query Algorithm for Learning DNF with Respect to the Uniform Distribution
✍ Jeffrey C Jackson 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 566 KB

We present a membership-query algorithm for efficiently learning DNF with respect to the uniform distribution. In fact, the algorithm properly learns with respect to uniform the class TOP of Boolean functions expressed as a majority vote over parity functions. We also describe extensions of this alg

An algorithm for learning from erroneous
An algorithm for learning from erroneous and incorrigible examples
✍ Janusz Kacprzyk; Graz`yna Szkatuła 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 924 KB

An improved algorithm for inductive learning from erroneous examples is presented. It is assumed that the errors may occur in the attributes' values. However, their location (in which example, and in which attribute) is unknown. Moreover, the errors are assumed incorrigible as it is often the case i

Efficient algorithms for solving rank tw
Efficient algorithms for solving rank two and rank three bilinear programming problems
✍ Yasutoshi Yajima; Hiroshi Konno 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 866 KB

Finitely convergent algorithms for solving rank two and three bilinear programming problems are proposed. A rank k bilinear programming problem is a nonconvex quadratic programming problem with the following structure: minimize c& + df,y + i c;x-d;y(xEX, yEY , j=l I where XC R"' and Y C RnZ are non