The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Adapting ranking SVM to document retrieval
Abstract
The paper is concerned with applying learning to rank to document retrieval. Ranking SVM is a typical method of learning to rank. We point out that there are two factors one must consider when applying Ranking SVM, in general a "learning to rank" method, to document retrieval. First, correctly ranking documents on the top of the result list is crucial for an Information Retrieval system. One must conduct training in a way that such ranked results are accurate. Second, the number of relevant documents can vary from query to query. One must avoid training a model biased toward queries with a large number of relevant documents. Previously, when existing methods that include Ranking SVM were applied to document retrieval, none of the two factors was taken into consideration. We show it is possible to make modifications in conventional Ranking SVM, so it can be better used for document retrieval. Specifically, we modify the "Hinge Loss" function in Ranking SVM to deal with the problems described above. We employ two methods to conduct optimization on the loss function: gradient descent and quadratic programming. Experimental results show that our method, referred to as Ranking SVM for IR, can outperform the conventional Ranking SVM and other existing methods for document retrieval on two datasets.
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
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Proceedings of the 24th international conference on Machine learning
(2007) · doi:10.1145/1273496 · Cited by 11,630
Optimizing search engines using clickthrough data
Joachims, T. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775067 · Cited by 3,873
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
A Language Modeling Approach to Information Retrieval
Ponte, J. M., & Croft, W. B. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130368 · Cited by 2,503
The SMART Retrieval System—Experiments in Automatic Document Processing
Salton, G. (1971) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,252
A language modeling approach to information retrieval
Ponte, J. M., & Croft, W. B. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.291008 · Cited by 1,821
IR evaluation methods for retrieving highly relevant documents
Järvelin, K., & Kekäläinen, J. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130374 · Cited by 1,444
Searching the web: The public and their queries
Spink, A., Wolfram, D., Jansen, M. B. J., & Saracevic, T. (2001) · Journal of the American Society for Information Science and Technology · doi:10.1002/1097-4571(2000)9999:9999<::aid-asi1591>3.0.co;2-r · Cited by 1,084
Large Margin Rank Boundaries for Ordinal Regression
Herbrich, R., Graepel, T., & Obermayer, K. (2000) · Advances in Large-Margin Classifiers · doi:10.7551/mitpress/1113.003.0010 · Cited by 1,074
IR evaluation methods for retrieving highly relevant documents
Järvelin, K., & Kekäläinen, J. (2000) · Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/345508.345545 · Cited by 967
Document Language Models, Query Models, and Risk Minimization for Information Retrieval
Lafferty, J., & Zhai, C. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130375 · Cited by 754
Crammer, K., & Singer, Y. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0087 · Cited by 538
Document language models, query models, and risk minimization for information retrieval
Lafferty, J., & Zhai, C. (2001) · Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/383952.383970 · Cited by 530
From e-sex to e-commerce: Web search changes
Spink, A., Jansen, B. J., Wolfram, D., & Saracevic, T. (2002) · Computer · doi:10.1109/2.989940 · Cited by 469
Morik, K. J., Brockhausen, P., & Joachims, T. (1999) · RePEc: Research Papers in Economics · Cited by 350
Discriminative models for information retrieval
Nallapati, R. (2004) · Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1008992.1009006 · Cited by 285
New approaches to support vector ordinal regression
Chu, W., & Keerthi, S. S. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102370 · Cited by 277
The TREC-9 Filtering Track Final Report.
Robertson, S. E., & Hull, D. A. (2000) · Cited by 168
Linear discriminant model for information retrieval
Gao, J., Qi, H., Xia, X., & Nie, J. (2005) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1076034.1076085 · Cited by 96
Online ranking/collaborative filtering using the perceptron algorithm
Harrington, E. (2003) · Cited by 89
Collaborative ordinal regression
Yu, S., Yu, K., Volker Tresp, C., & Kriegel, H. (2006) · International Conference on Machine Learning · doi:10.1145/1143844.1143981 · Cited by 61
Taxonomy of Large Margin Principle Algorithms for Ordinal Regression Problems
Shashua, A., & Levin, A. (2002) · Cited by 53
Extensions of Gaussian processes for ranking: semi-supervised and active learning
Chu, W., & Ghahramani, Z. (2005) · Cited by 46
Ranking with Unlabeled Data: A First Study
Usunier, N., Truong, V., Amini, M.-R., Gallinari, P., & Curie, M. (2005) · Cited by 11
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
Self-citationLearning 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
Self-citationLearning to Rank for Information Retrieval
Liu, T.-Y. (2009) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000016 · Cited by 1,568
Self-citationAdaRank: 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
Self-citationA support vector method for optimizing average precision
Yue, Y., Finley, T., Radlinski, F., & Joachims, T. (2007) · Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1277741.1277790 · Cited by 704
Metadata
- Authors
- Cao, Y., Xu, J., Liu, T.-Y., Li, H., Huang, Y., & Hon, H.-W.
- Venue
- Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
- Publisher
- ACM
- Published
- 2006-08-06
- Pages
- 186-193
- OpenAlex
- W2125398996
- Cited by
- 569
- References
- 26
- FWCI
- 24.36
- 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.