Abstract
The purpose of this paper is to investigate the properties of partitioning scoring rules in the bipartite ranking setup. We focus on ranking rules based on scoring functions. General sufficient conditions for the AUC consistency of scoring functions that are constant on cells of a partition of the feature space are provided. Rate bounds are obtained for cubic histogram scoring rules under mild smoothness assumptions on the regression function. In this setup, it is shown how to penalize the empirical AUC criterion in order to select a scoring rule nearly as good as the one that can be built when the degree of smoothness of the regression function is known.
| Original language | English |
|---|---|
| Pages (from-to) | 97-104 |
| Number of pages | 8 |
| Journal | Journal of Machine Learning Research |
| Volume | 5 |
| Publication status | Published - 1 Jan 2009 |
| Externally published | Yes |
| Event | 12th International Conference on Artificial Intelligence and Statistics, AISTATS 2009 - Clearwater, FL, United States Duration: 16 Apr 2009 → 18 Apr 2009 |
Fingerprint
Dive into the research topics of 'On partitioning rules for bipartite ranking'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver