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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.