CaSMoS: A Framework for Learning Candidate Selection Models over Structured Queries and Documents

ABSTRACT

User experience at social media and web platforms such as LinkedIn is heavily dependent on the performance and scalability of its products. Applications such as personalized search and recommendations require real-time scoring of millions of structured candidate documents associated with each query, with strict latency constraints. In such applications, the query incorporates the context of the user (in addition to search keywords if present), and hence can become very large, comprising of thousands of Boolean clauses over hundreds of document attributes. Consequently, candidate selection techniques need to be applied since it is infeasible to retrieve and score all matching documents from the underlying inverted index. We propose CaSMoS, a machine learned candidate selection framework that makes use of Weighted AND (WAND) query. Our framework is designed to prune irrelevant documents and retrieve documents that are likely to be part of the top-k results for the query. We apply a constrained feature selection algorithm to learn positive weights for feature combinations that are used as part of the weighted candidate selection query. We have implemented and deployed this system to be executed in real time using LinkedIn's Galene search platform. We perform extensive evaluation with different training data approaches and parameter settings, and investigate the scalability of the proposed candidate selection model. Our deployment of this system as part of LinkedIn's job recommendation engine has resulted in significant reduction in latency (up to 25%) without sacrificing the quality of the retrieved results, thereby paving the way for more sophisticated scoring models.

References

1. Apache Kafka. http://kafka.apache.org/.
2. G. Adomavicius and A. Tuzhilin. Context-aware recommender systems. In Recommender systems handbook. Springer, 2015.
3. E. Al Mashagba, F. Al Mashagba, and M. O. Nassar. Query optimization using genetic algorithms in the vector space model. International Journal of Computer Science Issues (IJCSI), 8(5), 2011.
4. A. Anagnostopoulos, A. Z. Broder, and K. Punera. Effective and efficient classification on a search-engine model. In CIKM, 2006.
5. Y. Aphinyanaphongs and C. Aliferis. Learning Boolean queries for article quality filtering. In MEDINFO, 2004.
6. N. Asadi and J. Lin. Effectiveness/efficiency tradeoffs for candidate generation in multi-stage retrieval architectures. In SIGIR, 2013.
7. M. Bazire and P. Brézillon. Understanding context before using it. In CONTEXT, 2005.
8. M. Bilenko, B. Kamath, and R. J. Mooney. Adaptive blocking: Learning to scale up record linkage. In ICDM, 2006.
9. A. Z. Broder, D. Carmel, M. Herscovici, A. Soffer, and J. Zien. Efficient query evaluation using a two-level retrieval process. In CIKM, 2003.
10. S. Chaudhuri. An overview of query optimization in relational systems. In PODS, 1998.
11. P. Dourish. What we talk about when we talk about context. Personal and ubiquitous computing, 8(1), 2004.
12. G. W. Flake, E. J. Glover, S. Lawrence, and C. L. Giles. Extracting query modifications from nonlinear SVMs. In WWW, 2002.
13. J.-T. Horng and C.-C. Yeh. Applying genetic algorithms to query optimization in document retrieval. Information processing & management, 36(5), 2000.
14. N. McNeill, H. Kardes, and A. Borthwick. Dynamic record blocking: Efficient linking of massive databases in MapReduce. In QDB, 2012.
15. S. Sriram and A. Makhani. LinkedIn's Galene Search engine, 2014. https://engineering.linkedin.com/search/did-you-mean-galene.
16. N. Tonellotto, C. Macdonald, and I. Ounis. Efficient and effective retrieval using selective pruning. In WSDM, 2013.
17. Y. Xu, N. Chen, A. Fernandez, O. Sinno, and A. Bhasin. From infrastructure to culture: A/B testing challenges in large scale social networks. In KDD, 2015.

Index Terms

• Information systems

  • Information retrieval

    • Retrieval tasks and goals

      • Document filtering

      • Recommender systems

• Theory of computation

  • Theory and algorithms for application domains

    • Machine learning theory

      • Query learning