Query-Level Stability of Ranking SVM for Replacement Case
Procedia Engineering2011Vol. 15, pp. 2145–2149
Citations Over Time
Abstract
The quality of ranking determines the success or failure of information retrieval and the goal of ranking is to learn a real-valued ranking function that induces a ranking or ordering over an instance space. We focus on stability and generalization ability of ranking SVM for replacement case. The query-level stability of ranking SVM for replacement case and the generalization bounds for such ranking algorithm via query-level stability by changing one element in sample set are given.
Related Papers
- → QoRank: A query-dependent ranking model using LSE-based weighted multiple hyperplanes aggregation for information retrieval(2010)7 cited
- → Query-Level Stability of Ranking SVM for Replacement Case(2011)3 cited
- → Accelerated MM Algorithms for Inference of Ranking Scores from Comparison Data(2022)2 cited
- Analysis and Optimization on Search Engines' Relevance Ranking Algorithm(2006)