The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Discriminative models for information retrieval
Abstract
Discriminative models have been preferred over generative models in many machine learning problems in the recent past owing to some of their attractive theoretical properties. In this paper, we explore the applicability of discriminative classifiers for IR. We have compared the performance of two popular discriminative models, namely the maximum entropy model and support vector machines with that of language modeling, the state-of-the-art generative model for IR. Our experiments on ad-hoc retrieval indicate that although maximum entropy is significantly worse than language models, support vector machines are on par with language models. We argue that the main reason to prefer SVMs over language models is their ability to learn arbitrary features automatically as demonstrated by our experiments on the home-page finding task of TREC-10.
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 Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
A Tutorial on Support Vector Machines for Pattern Recognition
Burges, C. J. C. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009715923555 · Cited by 16,429
(1999) · Cited by 12,854
Text categorization with Support Vector Machines: Learning with many relevant features
Joachims, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0026683 · Cited by 7,999
Making Large-Scale SVM Learning Practical
Joachims, T. (1998) · RePEc: Research Papers in Economics · doi:10.17877/de290r-14262 · Cited by 4,411
Neural Information Processing Systems
(2018) · The Deep Learning Revolution · doi:10.7551/mitpress/11474.003.0014 · Cited by 3,730
A TUTORIAL ON SUPPORT VECTOR MACHINES FOR PATTERN RECOGNITION, DATA MINING AND KNOWLEDGE DISCOVERY
Burger, C. J. C. (1998) · Cited by 3,313
A maximum entropy approach to natural language processing
Berger, A. L., Pietra, V. J. D., & Pietra, S. A. D. (1996) · doi:10.5555/234285.234289 · Cited by 3,065
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
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
“The standard features in document retrieval (Nallapati, 2004) are extracted for each query-document pair.”
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
A Markov random field model for term dependencies
Metzler, D., & Croft, W. B. (2005) · Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1076034.1076115 · Cited by 843
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
Adapting ranking SVM to document retrieval
Cao, Y., Xu, J., Liu, T.-Y., Li, H., Huang, Y., & Hon, H.-W. (2006) · Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1148170.1148205 · Cited by 569
IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Models
Wang, J., Yu, L., Zhang, W., Gong, Y., Xu, Y., Wang, B., Zhang, P., & Zhang, D. (2017) · Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3077136.3080786 · Cited by 567
IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Models
Wang, Y.-X., Yu, L., Zhang, W., Gong, Y., Xu, Y., Wang, B., Zhang, P., & Zhang, D. (2017) · BIROn (Birkbeck, University of London) · doi:10.48550/arxiv.1705.10513 · Cited by 526
Linear feature-based models for information retrieval
Metzler, D., & Bruce Croft, W. (2007) · Information Retrieval · doi:10.1007/s10791-006-9019-z · Cited by 372
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 Theoretical Analysis of NDCG Type Ranking Measures
Wang, Y., Wang, L., Li, Y., He, D., Liu, T.-Y., & Chen, W. (2013) · arXiv · doi:10.48550/arxiv.1304.6480 · Cited by 351
A discriminative model approach for accurate duplicate bug report retrieval
Sun, C., Lo, D., Wang, X., Jiang, J., & Khoo, S.-C. (2010) · Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1 · doi:10.1145/1806799.1806811 · Cited by 336
UMass at TREC 2004: Novelty and HARD
Abdul-Jaleel, N., Allan, J., Croft, W. B., Diaz, F., Larkey, L., Li, X., Smucker, M. D., & Wade, C. (2004) · doi:10.21236/ada460118 · Cited by 274
Geng, X., Liu, T.-Y., Qin, T., & Li, H. (2007) · Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1277741.1277811 · Cited by 255
Multilayer SOM With Tree-Structured Data for Efficient Document Retrieval and Plagiarism Detection
Chow, T. W. S., & Rahman, M. K. M. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2009.2023394 · Cited by 67
Combining psycho-linguistic, content-based and chat-based features to detect predation in chatrooms
Barreiro, A., Losada, D. E., & Parapar, J. (2014) · Verlag der Technischen Universität Graz · doi:10.3217/jucs-020-02-0213 · Cited by 16
Metadata
- Authors
- Nallapati, R.
- Venue
- Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
- Publisher
- ACM
- Published
- 2004-07-25
- Pages
- 64-71
- OpenAlex
- W2067802667
- Cited by
- 285
- References
- 34
- FWCI
- 11.06
- 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.