Share Email Print

Proceedings Paper

Strong and weak stability of bipartite ranking algorithms
Author(s): Wei Gao; Yungang Zhang; Yun Gao; Li Liang; Youming Xia
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Ranking is an important problem in information retrieval and other applications, a good ranking algorithm should have good stability, which means for a wild change of samples, the ranking function doesn’t change too much. Among the existent ranking algorithms, the bipartite ranking is a special kind of ranking method, the goal of bipartite ranking is to learn a score function from positive and negative training samples that induces a ranking for an instance space. In this paper, the ‘almost everywhere’ stability of bipartite ranking algorithms is investigated, notions of strong stability and weak stability for bipartite ranking algorithms are defined, and the generalization bounds of stable bipartite ranking algorithms are obtained. In particular, the relationship between strong (weak) loss stability and strong (weak) score stability is also discussed.

Paper Details

Date Published: 19 July 2013
PDF: 7 pages
Proc. SPIE 8878, Fifth International Conference on Digital Image Processing (ICDIP 2013), 88783W (19 July 2013); doi: 10.1117/12.2030493
Show Author Affiliations
Wei Gao, Soochow Univ. (China)
Yungang Zhang, Yunnan Normal Univ. (China)
Univ. of Liverpool (United Kingdom)
Yun Gao, Yunnan Normal Univ. (China)
Li Liang, Yunnan Normal Univ. (China)
Youming Xia, Yunnan Normal Univ. (China)

Published in SPIE Proceedings Vol. 8878:
Fifth International Conference on Digital Image Processing (ICDIP 2013)
Yulin Wang; Xie Yi, Editor(s)

© SPIE. Terms of Use
Back to Top