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
The SMART Retrieval System—Experiments in Automatic Document Processing
Salton, G. (1971) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,252
Relevance weighting of search terms
Robertson, S. E., & Jones, K. S. (1976) · Journal of the American Society for Information Science · doi:10.1002/asi.4630270302 · Cited by 2,081
(2001) · Cited by 1,932
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
A Study of Smoothing Methods for Language Models Applied to Ad Hoc Information Retrieval
Zhai, C., & Lafferty, J. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130377 · Cited by 1,537
A Maximum Entropy Model for Part-Of-Speech Tagging
Ratnaparkhi, A. (1996) · Cited by 1,317
A study of smoothing methods for language models applied to Ad Hoc information retrieval
Zhai, C., & Lafferty, J. (2001) · Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/383952.384019 · Cited by 889
Using Maximum Entropy for Text Classification
Nigam, K., Lafferty, J., & McCallum, A. (1999) · Cited by 781
KNN approach to unbalanced data distributions: a case study involving information extraction
Ziang, J. (2003) · International Conference on Machine Learning · Cited by 772
A comparison of algorithms for maximum entropy parameter estimation
Malouf, R. (2002) · proceeding of the 6th conference on Natural language learning - COLING-02 · doi:10.3115/1118853.1118871 · Cited by 655
Probabilistic models of indexing and searching
Robertson, S. E., van Rijsbergen, C. J., & Porter, M. (1980) · doi:10.5555/636669.636673 · Cited by 314
The Importance of Prior Probabilities for Entry Page Search
Kraaij, W., Westerveld, T., & Hiemstra, D. (2002) · Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/564376.564383 · Cited by 268
Combining document representations for known-item search
Ogilvie, P., & Callan, J. (2003) · Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval · doi:10.1145/860435.860463 · Cited by 231
Probabilistic Relevance Models Based on Document and Query Generation
Lafferty, J., & Zhai, C. (2003) · Language Modeling for Information Retrieval · doi:10.1007/978-94-017-0171-6_1 · Cited by 210
Harter, S. P. (1975) · Journal of the American Society for Information Science · doi:10.1002/asi.4630260402 · Cited by 195
Probabilistic retrieval based on staged logistic regression
Cooper, W. S., Gey, F. C., & Dabney, D. P. (1992) · Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '92 · doi:10.1145/133160.133199 · Cited by 167
A probabilistic approach to automatic keyword indexing
Harter, S. P. (1974) · Journal of the American Society for Information Science and Technology · Cited by 147
Inferring probability of relevance using the method of logistic regression
Gey, F. C. (1994) · doi:10.5555/188490.188560 · Cited by 108
Capturing term dependencies using a language model based on sentence trees
Nallapati, R. M., & Allan, J. (2002) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/584792.584855 · Cited by 79
Self-citationInferring Probability of Relevance Using the Method of Logistic Regression
Gey, F. C. (1994) · Springer eBooks · doi:10.1007/978-1-4471-2099-5_23 · Cited by 46
Exploiting the maximum entropy principle to increase retrieval effectiveness
Cooper, W. S. (1983) · Journal of the American Society for Information Science · doi:10.1002/asi.4630340106 · Cited by 45
The maximum entropy approach and probabilistic IR models
Greiff, W. R., & Ponte, J. M. (2000) · ACM Transactions on Information Systems · doi:10.1145/352595.352597 · Cited by 25
Teevan, J. B., & Karger, D. R. (2003) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/860435.860441 · Cited by 19
Workshop on language modeling and information retrieval
Croft, B. W., Callan, J., & Lafferty, J. (2001) · ACM SIGIR Forum · doi:10.1145/948716.948719 · Cited by 9
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
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.