Learning Rankings via Convex Hull Separation
Citations
2 citations
1 citations
Cites methods from "Learning Rankings via Convex Hull S..."
...[10] proposed reduction methods from RankSVMs or 2-norm soft margin optimization over pairs to 2-norm soft margin optimization over instances....
[...]
1 citations
Cites methods from "Learning Rankings via Convex Hull S..."
...This task were cast in the framework of SVMs as in [31, 17, 25]....
[...]
1 citations
References
40,147 citations
"Learning Rankings via Convex Hull S..." refers background in this paper
...Note that enforcing the constraints defined above indeed implies the desired ordering, since we have: Aw + y ≥ −γ ≥ γ̂ + 1 ≥ γ̂ ≥ Aw − y It is also important to note the connection with Support Vector Machines (SVM) formulation [10, 14] for the binary case....
[...]
23,215 citations
"Learning Rankings via Convex Hull S..." refers methods in this paper
...Ordinal regression and methods for handling structured output classes: For a classic description of generalized linear models for ordinal regre ssion, see [11]....
[...]
5,933 citations
"Learning Rankings via Convex Hull S..." refers background in this paper
...B′u− w′[A− ′ − A+ ′ ] = 0, b′u ≤ −1, u ≥ 0, (7) Where the second equivalent form of the constraints was obtained by negation (as before), and the third equivalent form results from ourthird key insight: the application of Farka’s theorem of alternatives[9]....
[...]
4,453 citations
2,146 citations
"Learning Rankings via Convex Hull S..." refers background in this paper
...Bu− w[A ′ − A ′ ] = 0, bu ≤ −1, u ≥ 0, (7) Where the second equivalent form of the constraints was obtai ned by negation (as before), and the third equivalent form results from our third key insight: the application of Farka’s theorem of alternatives[9]....
[...]