OrdRank: Learning to Rank with Ordered Multiple Hyperplanes
Explore this paper's citation graph
- Type
- article
- Published
- 2009-09-15
- Cited by
- 0
- References
- 14
- OpenAlex
- https://openalex.org/W2138488530
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:3223120
Keywords
Ranking (information retrieval), Learning to rank, Hyperplane, Ranking SVM, Rank (graph theory)
References
- An Efficient Boosting Algorithm for Combining Preferences
- Learning to rank at query-time using association rules
- Listwise approach to learning to rank: theory and algorithm
- Ranking with multiple hyperplanes
- Learning to rank: from pairwise approach to listwise approach
- Learning to rank relational objects and its application to web search
- Query dependent ranking using K-nearest neighbor
- AdaRank: a boosting algorithm for information retrieval
- Learning to rank using gradient descent
- LIBSVM: A library for support vector machines
- IR evaluation methods for retrieving highly relevant documents
- Modern Information Retrieval
- Libsvm : A library for support vector machines
- OHSUMED: an interactive retrieval evaluation and new large test collection for research
- Large Margin Rank Boundaries for Ordinal Regression
Cited by
No citing papers recorded for this paper.
Related papers
- Bi-Rank: A New Bi-Directional Ranking Method for Goods Selection
- Querywise Fair Learning to Rank through Multi-Objective Optimization
- Survey of information retrieval ranking algorithm
- QoRank: A query‐dependent ranking model using LSE‐based weighted multiple hyperplanes aggregation for information retrieval
- Algorithm of Active Learning to Rank Based on PRank Algorithm
- Survey of Web Page-ranking Algorithms
- The LambdaLoss Framework for Ranking Metric Optimization
- Query dependent ranking using K-nearest neighbor
- A learning to rank approach based on ranking positions