2011 | OriginalPaper | Buchkapitel
Generalization Bounds of Ranking via Query-Level Stability I
verfasst von : Xiangguang He, Wei Gao, Zhiyang Jia
Erschienen in: Information and Management Engineering
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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 generalization ability of learning to rank algorithms for information retrieval (IR). The contribution of this paper is to give generalization bounds for such ranking algorithm via uniform (strong and weak) query-level stability by deleting one element from sample set or change one element in sample set. Only we define the corresponding definitions and list all the lemmas we need. All results will show in “Generalization Bounds of Ranking via Query-Level Stability II”.