The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Subset Ranking Using Regression
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
Learning to rank using gradient descent
Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., & Hullender, G. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102363 · Cited by 2,836
Cited by
Learning to rank: from pairwise approach to listwise approach
Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F., & Li, H. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273513 · Cited by 1,960
Learning to rank for information retrieval
Liu, T.-Y. (2010) · Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1835449.1835676 · Cited by 1,856
Learning to Rank for Information Retrieval
Liu, T.-Y. (2009) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000016 · Cited by 1,568
AdaRank: a boosting algorithm for information retrieval
Xu, J., & Li, H. (2007) · Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1277741.1277809 · Cited by 775
Listwise approach to learning to rank: theory and algorithm
Xia, F., Liu, T.-Y., Wang, J., Zhang, W., & Li, H. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390306 · Cited by 702
dipIQ: Blind Image Quality Assessment by Learning-to-Rank Discriminable Image Pairs
Ma, K., Liu, W., Liu, T., Wang, Z., & Tao, D. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2708503 · Cited by 353
A Short Introduction to Learning to Rank
LI, H. (2011) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.e94.d.1854 · Cited by 348
Ordinal hyperplanes ranker with cost sensitivities for age estimation
Chang, K.-Y., Chen, C.-S., & Hung, Y.-P. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995437 · Cited by 342
Gulwani, S., Polozov, O., & Singh, R. (2017) · Foundations and Trends in Programming Languages · doi:10.1561/2500000010 · Cited by 319
Ranking and Empirical Minimization of U-statistics
Clémençon, S., Lugosi, G., & Vayatis, N. (2008) · The Annals of Statistics · doi:10.1214/009052607000000910 · Cited by 275
Automatic Chinese Factual Question Generation
Liu, M., Rus, V., & Liu, L. (2017) · IEEE Transactions on Learning Technologies · doi:10.1109/tlt.2016.2565477 · Cited by 52
Learning to Rank in Generative Retrieval
Li, Y., Yang, N., Wang, L., Wei, F., & Li, W. (2023) · arXiv · doi:10.48550/arxiv.2306.15222 · Cited by 27
Learning to Rank in Generative Retrieval
Li, Y., Yang, N., Wang, L., Wei, F., & Li, W. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i8.28717 · Cited by 27
Uncertainty quantification in the Bradley–Terry–Luce model
Gao, C., Shen, Y., & Zhang, A. Y. (2023) · Information and Inference: A Journal of the IMA · doi:10.1093/imaiai/iaac032 · Cited by 71
Metadata
- Authors
- Cossock, D., & Zhang, T.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 605-619
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1708221419
- Cited by
- 236
- References
- 2
- FWCI
- 8.21
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.