The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Optimizing search engines using clickthrough data
Abstract
This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system should present relevant documents high in the ranking, with less relevant documents following below. While previous approaches to learning retrieval functions from examples exist, they typically require training data generated from relevance judgments by experts. This makes them difficult and expensive to apply. The goal of this paper is to develop a method that utilizes clickthrough data for training, namely the query-log of the search engine in connection with the log of links the users clicked on in the presented ranking. Such clickthrough data is available in abundance and can be recorded at very low cost. Taking a Support Vector Machine (SVM) approach, this paper presents a method for learning retrieval functions. From a theoretical perspective, this method is shown to be well-founded in a risk minimization framework. Furthermore, it is shown to be feasible even for large sets of queries and features. The theoretical results are verified in a controlled experiment. It shows that the method can effectively adapt the retrieval function of a meta-search engine to a particular group of users, outperforming Google in terms of retrieval quality after only a couple of hundred training examples.
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
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
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 training algorithm for optimal margin classifiers
Boser, B. E., Guyon, I. M., & Vapnik, V. N. (1992) · Proceedings of the fifth annual workshop on Computational learning theory · doi:10.1145/130385.130401 · Cited by 11,992
Baeza-Yates, R. A., & Ribeiro-Neto, B. A. (1999) · Cited by 11,505
Term-weighting approaches in automatic text retrieval
Salton, G., & Buckley, C. (1988) · Information Processing & Management · doi:10.1016/0306-4573(88)90021-0 · Cited by 9,740
Kendall, M. G. (1957) · Biometrika · doi:10.2307/2333282 · Cited by 6,383
Advances in kernel methods: support vector learning
Schölkopf, B., Burges, C. J. C., & Smola, A. J. (1999) · doi:10.5555/299094 · Cited by 5,789
Making Large-Scale SVM Learning Practical
Joachims, T. (1998) · RePEc: Research Papers in Economics · doi:10.17877/de290r-14262 · Cited by 4,411
Self-citationAn Introduction to the Theory of Statistics
(1911) · Nature · doi:10.1038/087345a0 · Cited by 4,394
Cited by
Rendle, S. (2010) · 2010 IEEE International Conference on Data Mining · doi:10.1109/icdm.2010.127 · Cited by 3,189
Real-World Anomaly Detection in Surveillance Videos
Sultani, W., Chen, C., & Shah, M. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00678 · Cited by 2,140
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
“Second, the training instances of document pairs can be easily obtained in certain scenarios (Joachims, 2002).”
BackgroundMethodInfluentialTraining linear SVMs in linear time
Joachims, T. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150429 · Cited by 1,920
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
Zero-Shot Learning—A Comprehensive Evaluation of the Good, the Bad and the Ugly
Xian, Y., Lampert, C. H., Schiele, B., & Akata, Z. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2857768 · Cited by 1,678
Learning to Rank for Information Retrieval
Liu, T.-Y. (2009) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000016 · Cited by 1,568
Building Watson: An Overview of the DeepQA Project
Ferrucci, D., Brown, E., Chu‐Carroll, J., Fan, J., Gondek, D., Kalyanpur, A. A., Lally, A., Murdock, J. W., Nyberg, E., Prager, J., et al. (2010) · AI Magazine · doi:10.1609/aimag.v31i3.2303 · Cited by 1,497
Accurately interpreting clickthrough data as implicit feedback
Joachims, T., Granka, L., Pan, B., Hembrooke, H., & Gay, G. (2005) · Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1076034.1076063 · Cited by 1,408
Self-citationA Survey of Opinion Mining and Sentiment Analysis
Liu, B., & Zhang, L. (2012) · Mining Text Data · doi:10.1007/978-1-4614-3223-4_13 · Cited by 1,323
Foundations of Machine Learning
Mohri, M., Rostamizadeh, A., & Talwalkar, A. (2018) · doi:10.7551/mitpress/10290.001.0001 · Cited by 1,122
Improving web search ranking by incorporating user behavior information
Agichtein, E., Brill, E., & Dumais, S. (2006) · Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1148170.1148177 · Cited by 1,041
An experimental comparison of click position-bias models
Craswell, N., Zoeter, O., Taylor, M., & Ramsey, B. (2008) · Proceedings of the international conference on Web search and web data mining - WSDM '08 · doi:10.1145/1341531.1341545 · Cited by 942
Zero-Shot Learning — The Good, the Bad and the Ugly
Xian, Y., Schiele, B., & Akata, Z. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.328 · Cited by 891
Garcia, D. M., Baek, D., Shin, C., Bell, G. W., Grimson, A., & Bartel, D. P. (2011) · Nature Structural & Molecular Biology · doi:10.1038/nsmb.2115 · Cited by 864
Parikh, D., & Grauman, K. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126281 · Cited by 851
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
Sampling Matters in Deep Embedding Learning
Wu, C.-Y., Manmatha, R., Smola, A. J., & Krahenbuhl, P. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.309 · Cited by 836
Reciprocal rank fusion outperforms condorcet and individual rank learning methods
Cormack, G. V., Clarke, C. L. A., & Buettcher, S. (2009) · Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1571941.1572114 · Cited by 797
“Our final experiment used the sample learning results supplied with the LETOR 3 1 dataset, as well as a logis-1 .000 RankSVM [3] 0.5737 (0.55 - 0.60) 0.0314 (0.02 - 0.04) .000 RankBoost [2] 0.5622 (0.53 - 0.59) 0.0429 (0.03 - 0.06) .000 Table 3: Individual rankings and fusion for 583,850…”
InfluentialAdaRank: 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
Spotting fake reviewer groups in consumer reviews
Mukherjee, A., Liu, B., & Glance, N. (2012) · Proceedings of the 21st international conference on World Wide Web · doi:10.1145/2187836.2187863 · Cited by 773
“We ran two widely used learning to rank algorithms [26]: SVMRank [17] and RankBoost [11] .”
MethodEntity Linking with a Knowledge Base: Issues, Techniques, and Solutions
Shen, W., Wang, J., & Han, J. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2327028 · Cited by 761
SENTIMENT CLASSIFICATION of MOVIE REVIEWS USING CONTEXTUAL VALENCE SHIFTERS
Kennedy, A., & Inkpen, D. (2006) · Computational Intelligence · doi:10.1111/j.1467-8640.2006.00277.x · Cited by 751
In Google We Trust: Users’ Decisions on Rank, Position, and Relevance
Pan, B., Hembrooke, H., Joachims, T., Lorigo, L., Gay, G., & Granka, L. (2007) · Journal of Computer-Mediated Communication · doi:10.1111/j.1083-6101.2007.00351.x · Cited by 715
Self-citationEye-tracking analysis of user behavior in WWW search
Granka, L. A., Joachims, T., & Gay, G. (2004) · Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1008992.1009079 · Cited by 696
Self-citationEvaluating the accuracy of implicit feedback from clicks and query reformulations in Web search
Joachims, T., Granka, L., Pan, B., Hembrooke, H., Radlinski, F., & Gay, G. (2007) · ACM Transactions on Information Systems · doi:10.1145/1229179.1229181 · Cited by 677
Self-citationModeling Local Coherence: An Entity-Based Approach
Barzilay, R., & Lapata, M. (2008) · Computational Linguistics · doi:10.1162/coli.2008.34.1.1 · Cited by 671
Person Re-Identification by Support Vector Ranking
Prosser, B., Zheng, W.-S., Gong, S., & Xiang, T. (2010) · Procedings of the British Machine Vision Conference 2010 · doi:10.5244/c.24.21 · Cited by 657
Efficient grasping from RGBD images: Learning using a new rectangle representation
Jiang, Y., Moseson, S., & Saxena, A. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980145 · Cited by 657
Learning structural SVMs with latent variables
Yu, C.-N. J., & Joachims, T. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553523 · Cited by 610
Self-citationAggarwal, C. C. (2015) · Data Mining · doi:10.1007/978-3-319-14142-8_13 · Cited by 606
A Survey on Visual Content-Based Video Indexing and Retrieval
Hu, W., Xie, N., Li, L., Zeng, X., & Maybank, S. (2011) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2011.2109710 · Cited by 585
PubMed and beyond: a survey of web tools for searching biomedical literature
Lu, Z. (2011) · Database · doi:10.1093/database/baq036 · Cited by 571
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
Deep semantic ranking based hashing for multi-label image retrieval
Zhao, F., Huang, Y., Wang, L., & Tan, T. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7298763 · Cited by 564
Learning to summarize from human feedback
Stiennon, N., Ouyang, L., Wu, J., Ziegler, D. M., Lowe, R., Voss, C., Radford, A., Amodei, D., & Christiano, P. (2020) · arXiv · doi:10.48550/arxiv.2009.01325 · Cited by 550
Optimizing web search using social annotations
Bao, S., Xue, G., Wu, X., Yu, Y., Fei, B., & Su, Z. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242640 · Cited by 546
Ensembles for feature selection: A review and future trends
Bolón-Canedo, V., & Alonso-Betanzos, A. (2019) · Information Fusion · doi:10.1016/j.inffus.2018.11.008 · Cited by 541
A dynamic bayesian network click model for web search ranking
Chapelle, O., & Zhang, Y. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526711 · Cited by 537
Label ranking by learning pairwise preferences
Hüllermeier, E., Fürnkranz, J., Cheng, W., & Brinker, K. (2008) · Artificial Intelligence · doi:10.1016/j.artint.2008.08.002 · Cited by 536
Unbiased Learning-to-Rank with Biased Feedback
Joachims, T., Swaminathan, A., & Schnabel, T. (2017) · Proceedings of the Tenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3018661.3018699 · Cited by 531
“There are several LTR algorithms that follow this approach (see [15]), and we use SVM-Rank [9] as a representative algorithm in this paper.”
BackgroundMethodInfluentialSelf-citationIRGAN: 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
Link Prediction via Matrix Factorization
Menon, A. K., & Elkan, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-23783-6_28 · Cited by 520
Automatically assessing review helpfulness
Kim, S.-M., Pantel, P., Chklovski, T., & Pennacchiotti, M. (2006) · Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing - EMNLP '06 · doi:10.3115/1610075.1610135 · Cited by 518
Deep Learning the City: Quantifying Urban Perception at a Global Scale
Dubey, A., Naik, N., Parikh, D., Raskar, R., & Hidalgo, C. A. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46448-0_12 · Cited by 513
Learning diverse rankings with multi-armed bandits
Radlinski, F., Kleinberg, R., & Joachims, T. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390255 · Cited by 503
Self-citationEmbedding-based News Recommendation for Millions of Users
Okura, S., Tagami, Y., Ono, S., & Tajima, A. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098108 · Cited by 499
Test Collection Based Evaluation of Information Retrieval Systems
Sanderson, M. (2010) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000009 · Cited by 485
“Joachims implemented the idea using Kendall’s τ [153] to measure the correlation between the two ranks so as to obtain a measure of effectiveness [137].”
MethodOpinion Mining and Sentiment Analysis
Liu, B. (2011) · Web Data Mining · doi:10.1007/978-3-642-19460-3_11 · Cited by 482
Query chains: learning to rank from implicit feedback
Radlinski, F., & Joachims, T. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081899 · Cited by 476
Self-citationLearning user interaction models for predicting web search result preferences
Agichtein, E., Brill, E., Dumais, S., & Ragno, R. (2006) · Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1148170.1148175 · Cited by 462
LETOR: A benchmark collection for research on learning to rank for information retrieval
Qin, T., Liu, T.-Y., Xu, J., & Li, H. (2010) · Information Retrieval · doi:10.1007/s10791-009-9123-y · Cited by 461
Fine-Grained Visual Comparisons with Local Learning
Yu, A., & Grauman, K. (2014) · 2014 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2014.32 · Cited by 454
A user browsing model to predict search engine click data from past observations.
Dupret, G. E., & Piwowarski, B. (2008) · Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1390334.1390392 · Cited by 442
Random walks on the click graph
Craswell, N., & Szummer, M. (2007) · Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1277741.1277784 · Cited by 441
Context-sensitive information retrieval using implicit feedback
Shen, X., Tan, B., & Zhai, C. (2005) · Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1076034.1076045 · Cited by 436
Web page classification: Features and algorithms
Qi, X., & Davison, B. D. (2009) · ACM Computing Surveys · doi:10.1145/1459352.1459357 · Cited by 435
Spotting opinion spammers using behavioral footprints
Mukherjee, A., Kumar, A., Liu, B., Wang, J., Hsu, M., Castellanos, M., & Ghosh, R. (2013) · Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2487575.2487580 · Cited by 426
A survey of approaches and trends in person re-identification
Bedagkar-Gala, A., & Shah, S. K. (2014) · Image and Vision Computing · doi:10.1016/j.imavis.2014.02.001 · Cited by 420
Evaluating implicit measures to improve web search
Fox, S., Karnawat, K., Mydland, M., Dumais, S., & White, T. (2005) · ACM Transactions on Information Systems · doi:10.1145/1059981.1059982 · Cited by 412
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
TweetCred: Real-Time Credibility Assessment of Content on Twitter
Gupta, A., Kumaraguru, P., Castillo, C., & Meier, P. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-13734-6_16 · Cited by 371
A perceptually motivated online benchmark for image matting
Rhemann, C., Rother, C., Wang, J., Gelautz, M., Kohli, P., & Rott, P. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206503 · Cited by 367
Deep Multimodal Distance Metric Learning Using Click Constraints for Image Ranking
Yu, J., Yang, X., Gao, F., & Tao, D. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2591583 · Cited by 364
Fairness in Recommendation Ranking through Pairwise Comparisons
Beutel, A., Chen, J., Doshi, T., Qian, H., Wei, L., Wu, Y., Heldt, L., Zhao, Z., Hong, L., Chi, E. H., et al. (2019) · Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3292500.3330745 · Cited by 362
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
Learning Local Feature Descriptors Using Convex Optimisation
Simonyan, K., Vedaldi, A., & Zisserman, A. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2301163 · Cited by 352
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 Deep Look into neural ranking models for information retrieval
Guo, J., Fan, Y., Pang, L., Yang, L., Ai, Q., Zamani, H., Wu, C., Croft, W. B., & Cheng, X. (2020) · Information Processing & Management · doi:10.1016/j.ipm.2019.102067 · Cited by 349
Convolutional Neural Networks for Soft-Matching N-Grams in Ad-hoc Search
Dai, Z., Xiong, C., Callan, J., & Liu, Z. (2018) · Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining · doi:10.1145/3159652.3159659 · Cited by 341
CubeSVD: a novel approach to personalized Web search
Sun, J.-T., Zeng, H.-J., Liu, H., Lu, Y., & Chen, Z. (2005) · Proceedings of the 14th international conference on World Wide Web - WWW '05 · doi:10.1145/1060745.1060803 · Cited by 338
Krähenbühl, P., & Koltun, V. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-10602-1_47 · Cited by 336
Entity Disambiguation for Knowledge Base Population
Dredze, M. H., McNamee, P., Rao, D., Gerber, A., & Finin, T. (2010) · doi:10.13016/m29w0934d · Cited by 326
SoftRank: optimizing non-smooth rank metrics
Taylor, M., Guiver, J., Robertson, S., & Minka, T. (2008) · Proceedings of the international conference on Web search and web data mining - WSDM '08 · doi:10.1145/1341531.1341544 · Cited by 322
A Discriminative Kernel-Based Approach to Rank Images from Text Queries
Grangier, D., & Bengio, S. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.70791 · Cited by 318
Predicting breast tumor proliferation from whole-slide images: The TUPAC16 challenge
Veta, M., Heng, Y. J., Stathonikos, N., Bejnordi, B. E., Beca, F., Wollmann, T., Rohr, K., Shah, M. A., Wang, D., Rousson, M., et al. (2019) · Medical Image Analysis · doi:10.1016/j.media.2019.02.012 · Cited by 315
Image ranking and retrieval based on multi-attribute queries
Siddiquie, B., Feris, R. S., & Davis, L. S. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995329 · Cited by 313
Overlapping experiment infrastructure: more, better, faster experimentation
Tang, D., Agarwal, A., O'Brien, D., & Meyer, M. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835810 · Cited by 312
Explicit Semantic Ranking for Academic Search via Knowledge Graph Embedding
Xiong, C., Power, R., & Callan, J. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052558 · Cited by 301
Ensemble feature selection: Homogeneous and heterogeneous approaches
Seijo-Pardo, B., Porto-Díaz, I., Bolón-Canedo, V., & Alonso-Betanzos, A. (2017) · Knowledge-Based Systems · doi:10.1016/j.knosys.2016.11.017 · Cited by 300
Neural Ranking Models with Weak Supervision
Dehghani, M., Zamani, H., Severyn, A., Kamps, J., & Croft, W. B. (2017) · Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3077136.3080832 · Cited by 299
Learning to Branch in Mixed Integer Programming
Khalil, E., Le Bodic, P., Song, L., Nemhauser, G., & Dilkina, B. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10080 · Cited by 298
Credibility ranking of tweets during high impact events
Gupta, A., & Kumaraguru, P. (2012) · Proceedings of the 1st Workshop on Privacy and Security in Online Social Media · doi:10.1145/2185354.2185356 · Cited by 297
WhittleSearch: Image search with relative attribute feedback
Kovashka, A., Parikh, D., & Grauman, K. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6248026 · Cited by 296
Collaborative personalized tweet recommendation
Chen, K., Chen, T., Zheng, G., Jin, O., Yao, E., & Yu, Y. (2012) · Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/2348283.2348372 · Cited by 296
Learning, planning, and control for quadruped locomotion over challenging terrain
Kalakrishnan, M., Buchli, J., Pastor, P., Mistry, M., & Schaal, S. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364910388677 · Cited by 294
How does clickthrough data reflect retrieval quality?
Radlinski, F., Kurup, M., & Joachims, T. (2008) · Proceedings of the 17th ACM conference on Information and knowledge management · doi:10.1145/1458082.1458092 · Cited by 293
Self-citationStatistical Language Models for Information Retrieval A Critical Review
Zhai, C. (2007) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000008 · Cited by 291
Learning to rank relevant files for bug reports using domain knowledge
Ye, X., Bunescu, R., & Liu, C. (2014) · Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering · doi:10.1145/2635868.2635874 · Cited by 290
Learning to Rank with Selection Bias in Personal Search
Wang, X., Bendersky, M., Metzler, D., & Najork, M. (2016) · Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval · doi:10.1145/2911451.2911537 · Cited by 284
Spivak, M., Weston, J., Bottou, L., Käll, L., & Noble, W. S. (2009) · Journal of Proteome Research · doi:10.1021/pr801109k · Cited by 282
Ye, X., Shen, H., Ma, X., Bunescu, R., & Liu, C. (2016) · Proceedings of the 38th International Conference on Software Engineering · doi:10.1145/2884781.2884862 · Cited by 282
Analyzing and evaluating query reformulation strategies in web search logs
Huang, J., & Efthimiadis, E. N. (2009) · Proceedings of the 18th ACM conference on Information and knowledge management · doi:10.1145/1645953.1645966 · Cited by 277
Finding the right facts in the crowd: factoid question answering over social media
Bian, J., Liu, Y., Agichtein, E., & Zha, H. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367561 · Cited by 276
Efficient multiple-click models in web search
Guo, F., Liu, C., & Wang, Y. M. (2009) · Proceedings of the Second ACM International Conference on Web Search and Data Mining · doi:10.1145/1498759.1498818 · Cited by 275
Answering Natural Language Questions by Subgraph Matching over Knowledge Graphs
Hu, S., Zou, L., Yu, J. X., Wang, H., & Zhao, D. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2766634 · Cited by 271
Learning in a Large Function Space: Privacy-Preserving Mechanisms for SVM Learning
Rubinstein, B. I. P., Bartlett, P. L., Huang, L., & Taft, N. (2012) · Journal of Privacy and Confidentiality · doi:10.29012/jpc.v4i1.612 · Cited by 262
More Accurate Question Answering on Freebase
Bast, H., & Haussmann, E. (2015) · Proceedings of the 24th ACM International on Conference on Information and Knowledge Management · doi:10.1145/2806416.2806472 · Cited by 257
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
Metadata
- Authors
- Joachims, T.
- Venue
- Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2002-07-23
- Pages
- 133-142
- OpenAlex
- W2047221353
- Cited by
- 3,873
- References
- 34
- FWCI
- 27.56
- 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.