skip to main content
10.1145/2396761.2396847acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
research-article

Metaphor: a system for related search recommendations

Published: 29 October 2012 Publication History

Abstract

Search plays an important role in online social networks as it provides an essential mechanism for discovering members and content on the network. Related search recommendation is one of several mechanisms used for improving members' search experience in finding relevant results to their queries. This paper describes the design, implementation, and deployment of Metaphor, the related search recommendation system on LinkedIn, a professional social networking site with over 175~million members worldwide. Metaphor builds on a number of signals and filters that capture several dimensions of relatedness across member search activity. The system, which has been in live operation for over a year, has gone through multiple iterations and evaluation cycles. This paper makes three contributions. First, we provide a discussion of a large-scale related search recommendation system. Second, we describe a mechanism for effectively combining several signals in building a unified dataset for related search recommendations. Third, we introduce a query length model for capturing bias in recommendation click behavior. We also discuss some of the practical concerns in deploying related search recommendations.

References

[1]
Gediminas Adomavicius and Alexander Tuzhilin. Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions. TKDE, 17 (6): 734--749, 2005.
[2]
James Allan, Ben Carterette, and Joshua Lewis. When will information retrieval be "good enough?". In Proceedings of the SIGIR, 2005.
[3]
Avi Arampatzis and Jaap Kamps. A study of query length. In Proceedings of the SIGIR, 2008.
[4]
Ricardo Baeza-Yates. Applications of web query mining. In Proceedings of the ECIR, 2005.
[5]
Ricardo Baeza-Yates. Graphs from search engine queries. LNCS, 4362: 1--8, 2007.
[6]
Ricardo Baeza-Yates and Berthier Ribeiro-Neto. Modern Information Retrieval. Addison Wesley, 1999.
[7]
Ricardo A. Baeza-Yates, Carlos A. Hurtado, and Marcelo Mendoza. Query recommendation using query logs in search engines. In Proceedings of the EDBT Workshops, 2004.
[8]
James Bennett and Stan Lanning. The Netflix prize. In KDD Cup and Workshop, 2007.
[9]
Sumit Bhatia, Debapriyo Majumdar, and Prasenjit Mitra. Query suggestions in the absence of query logs. In Proceedings of the SIGIR, 2011.
[10]
Paolo Boldi, Francesco Bonchi, Carlos Castillo, Debora Donato, Aristides Gionis, and Sebastiano Vigna. The query-flow graph: model and applications. In Proceedings of the CIKM, 2008.
[11]
Paolo Boldi, Francesco Bonchi, Carlos Castillo, Debora Donato, and Sebastiano Vigna. Query suggestions using query-flow graphs. In Proceedings of the WSDM, 2009.
[12]
Leo Breiman. Bagging predictors. Machine Learning, 24 (2): 123--140, 1996.
[13]
Peter D. Bruza and Simon Dennis. Query reformulation on the internet: Empirical data and the hyperindex search engine. In Proceedings of the RIAO, 1997.
[14]
Carlos Castillo, Claudio Corsi, Debora Donato, Paolo Ferragina, and Aristides Gionis. Query-log mining for detecting spam. In Proceedings of the AIRWeb, 2008.
[15]
Paul A. Chirita, Claudiu S. Firan, and Wolfgang Nejdl. Personalized query expansion for the web. In Proceedings of the SIGIR, 2007.
[16]
Paolo Cremonesi, Yehuda Koren, and Roberto Turrin. Performance of recommender algorithms on top-n recommendation tasks. In Proceedings of the RecSys, 2010.
[17]
Hang Cui, Ji-Rong Wen, Jian-Yun Nie, and Wei-Ying Ma. Query expansion by mining user logs. TKDD, 15 (4): 829--839, 2003.
[18]
Jeffrey Dean and Sanjay Ghemawat. MapReduce: simplified data processing on large clusters. In Proceedings of the OSDI, 2004.
[19]
Giuseppe DeCandia, Deniz Hastorun, Madan Jampani, Gunavardhan Kakulapati, Avinash Lakshman, Alex Pilchin, Swaminathan Sivasubramanian, Peter Vosshall, and Werner Vogels. Dynamo: Amazon's highly available key-value store. SIGOPS Oper. Syst. Rev., 41: 205--220, 2007.
[20]
Thomas G. Dietterich. Ensemble methods in machine learning. LNCS, 1857: 1--15, 2000.
[21]
Gideon Dror, Noam Koenigstein, Yehuda Koren, and Markus Weimer. Recommending music items based on the Yahoo! music dataset. In KDD-Cup, 2011.
[22]
Bruno M. Fonseca, Paulo B. Golgher, Edleno S. de Moura, and Nivio Ziviani. Using association rules to discover search engines related queries. In Proceedings of the LA-WEB, 2003.
[23]
Joao Gama and Pavel Brazdil. Cascade generalization. Machine Learning, 41: 315--343, 2000.
[24]
Mohammad Al Hasan, Nish Parikh, Byanit Singh, and Neel Sundaresan. Query suggestion for E-commerce sites. In Proceedings of the WSDM, 2011.
[25]
Rosie Jones, Benjamin Rey, Omid Madani, and Wiley Greiner. Generating query substitutions. In Proceedings of the WWW, 2006.
[26]
Reiner Kraft and Jason Zien. Mining anchor text for query refinement. In Proceedings of the WWW, 2004.
[27]
Jay Kreps, Neha Narkhede, and Jun Rao. Kafka: A distributed messaging system for log processing. In Proceedings of the NetDB, 2011.
[28]
Solomon Kullback and Richard A. Leibler. On information and sufficiency. Ann. Math. Statist., 22 (1): 79--86, 1951.
[29]
Qiaozhu Mei, Dengyong Zhou, and Kenneth Church. Query suggestion using hitting time. In Proceedings of the CIKM, 2008.
[30]
Christopher Olston, Benjamin Reed, Utkarsh Srivastava, Ravi Kumar, and Andrew Tomkins. Pig Latin: a not-so-foreign language for data processing. In Proceedings of the SIGMOD, 2008.
[31]
Stephen Robertson. Understanding inverse document frequency: On theoretical arguments for IDF. Journal of Documentation, 60 (5), 2004.
[32]
Robert E. Schapire. A brief introduction to boosting. In Proceedings of the IJCAI, 1999.
[33]
Joseph Sill, Gábor Takács, Lester Mackey, and David Lin. Feature-weighted linear stacking. CoRR, abs/0911.0460, 2009.
[34]
Yang Song, Dengyong Zhou, and Li-wei He. Query suggestion by constructing term-transition graphs. In Proceedings of the WSDM, 2012.
[35]
Amanda Spink, Dietmar Wolfram, Major B. J. Jansen, and Tefko Saracevic. Searching the web: The public and their queries. Journal of American Society for Information Science and Technology, 2001.
[36]
Xiaofei Su and Taghi M. Khoshgoftaar. A survey of collaborative filtering techniques. Advances in AI, 2009: 4:1--4:19, 2009.
[37]
Roshan Sumbaly, Jay Kreps, Lei Gao, Alex Feinberg, Chinmay Soman, and Sam Shah. Serving Large-scale Batch Computed Data with Project Voldemort. In Proceedings of the FAST, 2012.
[38]
Ellen M. Voorhees. Query expansion using lexical-semantic relations. In Proceedings of the SIGIR, 1994.
[39]
David H. Wolpert. Stacked generalization. Neural Networks, 5: 241--259, 1992.
[40]
Jinxi Xu and W. Bruce Croft. Query expansion using local and global document analysis. In Proceedings of the SIGIR, 1996.
[41]
Zhiyong Zhang and Olfa Nasraoui. Mining search engine query logs for query recommendation. In Proceedings of the WWW, 2006.

Cited By

View all
  • (2021)Class-Based Order-Independent Models of Natural Language for Bayesian Auto-Complete InferenceProceedings of the First International Conference on AI-ML Systems10.1145/3486001.3486240(1-7)Online publication date: 21-Oct-2021
  • (2018)Measuring Influence on InstagramThe 41st International ACM SIGIR Conference on Research & Development in Information Retrieval10.1145/3209978.3210134(1009-1012)Online publication date: 27-Jun-2018
  • (2016)Past, Present, and Future of Recommender SystemsProceedings of the 10th ACM Conference on Recommender Systems10.1145/2959100.2959144(211-214)Online publication date: 7-Sep-2016
  • Show More Cited By

Index Terms

  1. Metaphor: a system for related search recommendations

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    CIKM '12: Proceedings of the 21st ACM international conference on Information and knowledge management
    October 2012
    2840 pages
    ISBN:9781450311564
    DOI:10.1145/2396761
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 29 October 2012

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. log analysis
    2. query suggestions
    3. recommender system

    Qualifiers

    • Research-article

    Conference

    CIKM'12
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

    Upcoming Conference

    CIKM '25

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)5
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 08 Mar 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2021)Class-Based Order-Independent Models of Natural Language for Bayesian Auto-Complete InferenceProceedings of the First International Conference on AI-ML Systems10.1145/3486001.3486240(1-7)Online publication date: 21-Oct-2021
    • (2018)Measuring Influence on InstagramThe 41st International ACM SIGIR Conference on Research & Development in Information Retrieval10.1145/3209978.3210134(1009-1012)Online publication date: 27-Jun-2018
    • (2016)Past, Present, and Future of Recommender SystemsProceedings of the 10th ACM Conference on Recommender Systems10.1145/2959100.2959144(211-214)Online publication date: 7-Sep-2016
    • (2016)User interaction analysis to recommend suitable jobs in career-oriented social networking sites2016 International Conference on Data and Software Engineering (ICoDSE)10.1109/ICODSE.2016.7936143(1-6)Online publication date: Oct-2016
    • (2015)FaBRiQ: Leveraging Distributed Hash Tables towards Distributed Publish-Subscribe Message Queues2015 IEEE/ACM 2nd International Symposium on Big Data Computing (BDC)10.1109/BDC.2015.42(11-20)Online publication date: Dec-2015
    • (2015)Recommender Systems in Industry: A Netflix Case StudyRecommender Systems Handbook10.1007/978-1-4899-7637-6_11(385-419)Online publication date: 2015
    • (2014)Modeling professional similarity by mining professional career trajectoriesProceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining10.1145/2623330.2623368(1945-1954)Online publication date: 24-Aug-2014
    • (2013)Large-scale social recommender systemsProceedings of the 22nd International Conference on World Wide Web10.1145/2487788.2488086(939-940)Online publication date: 13-May-2013
    • (2013)Learning to personalize query auto-completionProceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval10.1145/2484028.2484076(103-112)Online publication date: 28-Jul-2013
    • (2013)The big data ecosystem at LinkedInProceedings of the 2013 ACM SIGMOD International Conference on Management of Data10.1145/2463676.2463707(1125-1134)Online publication date: 22-Jun-2013

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media