Rohan Ramanath
Krishnaram Kenthapadi
ABSTRACT
Talent search and recommendation systems at LinkedIn strive to match the potential candidates to the hiring needs of a recruiter or a hiring manager expressed in terms of a search query or a job posting. Recent work in this domain has mainly focused on linear models, which do not take complex relationships between features into account, as well as ensemble tree models, which introduce non-linearity but are still insufficient for exploring all the potential feature interactions, and strictly separate feature generation from modeling. In this paper, we present the results of our application of deep and representation learning models on LinkedIn Recruiter. Our key contributions include: (i) Learning semantic representations of sparse entities within the talent search domain, such as recruiter ids, candidate ids, and skill entity ids, for which we utilize neural network models that take advantage of LinkedIn Economic Graph, and (ii) Deep models for learning recruiter engagement and candidate response in talent search applications. We also explore learning to rank approaches applied to deep models, and show the benefits for the talent search use case. Finally, we present offline and online evaluation results for LinkedIn talent search and recommendation systems, and discuss potential challenges along the path to a fully deep model architecture. The challenges and approaches discussed generalize to any multi-faceted search engine.
- M. Abadi et al. TensorFlow: A system for large-scale machine learning. In OSDI, 2016. Google Scholar
Digital Library
- A. Ahmed, N. Shervashidze, S. Narayanamurthy, V. Josifovski, and A. J. Smola. Distributed large-scale natural graph factorization. In WWW, 2013. Google ScholarDigital Library
- M. Belkin and P. Niyogi. Laplacian eigenmaps and spectral techniques for embedding and clustering. In NIPS, 2002. Google ScholarDigital Library
- C. Burges et al. Learning to rank using gradient descent. In ICML, 2005. Google ScholarDigital Library
- R. Caruana, S. Baluja, and T. Mitchell. Using the future to “sort out” the present: Rankprop and multitask learning for medical risk evaluation. In NIPS, 1996. Google ScholarDigital Library
- T. Chen and C. Guestrin. XGBoost: A scalable tree boosting system. In KDD, 2016. Google ScholarDigital Library
- H.-T. Cheng et al. Wide & deep learning for recommender systems. In Workshop on Deep Learning for Recommender Systems, 2016. Google ScholarDigital Library
- T. F. Cox and M. A. Cox. Multidimensional scaling. CRC press, 2000.Google ScholarCross Ref
- J. H. Friedman. Greedy function approximation: a gradient boosting machine. Annals of Statistics, 2001.Google ScholarCross Ref
- W. Gao and Z.-H. Zhou. On the consistency of auc pairwise optimization. Int. Conf. on Artifical Intelligence, 2015. Google ScholarDigital Library
- J. Guo, Y. Fan, Q. Ai, and W. B. Croft. A deep relevance matching model for ad-hoc retrieval. In CIKM, 2016. Google ScholarDigital Library
- V. Ha-Thuc et al. Personalized expertise search at LinkedIn. In Big Data, 2015. Google ScholarDigital Library
- V. Ha-Thuc et al. Search by ideal candidates: Next generation of talent search at LinkedIn. In WWW Companion, 2016. Google ScholarDigital Library
- B. Hu, Z. Lu, H. Li, and Q. Chen. Convolutional neural network architectures for matching natural language sentences. In NIPS, 2014. Google ScholarDigital Library
- P.-S. Huang et al. Learning deep structured semantic models for web search using clickthrough data. In CIKM, 2013. Google ScholarDigital Library
- K. Jarvelin and J. Kekalainen. Cumulated gain-based evaluation of IR techniques. ACM TOIS, 20(4), 2002. Google ScholarDigital Library
- T. Joachims. Optimizing search engines using clickthrough data. In KDD, 2002. Google ScholarDigital Library
- T. Joachims, L. Granka, B. Pan, H. Hembrooke, and G. Gay. Accurately interpreting clickthrough data as implicit feedback. In SIGIR, 2005. Google ScholarDigital Library
- T. Y. Liu. Learning to rank for information retrieval. Foundations and Trends in Information Retrieval, 3(3), 2009.Google Scholar
- T. Mikolov, I. Sutskever, K. Chen, G. S. Corrado, and J. Dean. Distributed representations of words and phrases and their compositionality. In NIPS, 2013. Google ScholarDigital Library
- B. Perozzi, R. Al-Rfou, and S. Skiena. DeepWalk: Online learning of social representations. In KDD, 2014. Google ScholarDigital Library
- J. Qiu et al. Network embedding as matrix factorization: Unifying DeepWalk, LINE, PTE, and node2vec. In WSDM, 2018. Google ScholarDigital Library
- S. T. Roweis and L. K. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500), 2000.Google Scholar
- Y. Shan et al. Deep Crossing: Web-scale modeling without manually crafted combinatorial features. In CIKM, 2016.Google Scholar
- Y. Shen, X. He, J. Gao, L. Deng, and G. Mesnil. Learning semantic representations using convolutional neural networks for web search. In WWW, 2014. Google ScholarDigital Library
- S. Sriram and A. Makhani. LinkedIn's Galene search engine, https://engineering.linkedin.com/search/did-you-mean-galene. 2014.Google Scholar
- N. Srivastava, G. Hinton, A. Krizhevsky, I. Sutskever, and R. Salakhutdinov. Dropout: A simple way to prevent neural networks from overfitting. JMLR, 15(1), 2014. Google ScholarDigital Library
- J. Tang et al. LINE: Large-scale information network embedding. In WWW, 2015. Google ScholarDigital Library
- J. B. Tenenbaum, V. De Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500), 2000.Google Scholar
- J. Weiner. The future of LinkedIn and the Economic Graph. LinkedIn Pulse, 2012.Google Scholar
Index Terms
- Towards Deep and Representation Learning for Talent Search at LinkedIn
Recommendations
Cascaded Deep Neural Ranking Models in LinkedIn People Search
CIKM '21: Proceedings of the 30th ACM International Conference on Information & Knowledge ManagementLinkedIn connects the world's professionals to make them more productive and successful. People Search plays an important role in fulfilling this goal by helping members find the most relevant and personalized results through a broad range of queries ...
Explore click models for search ranking
CIKM '10: Proceedings of the 19th ACM international conference on Information and knowledge managementRecent advances in click model have positioned it as an effective approach to estimate document relevance based on user behavior in web search. Yet, few works have been conducted to explore the use of click model to help web search ranking. In this ...
Perspective-driven IT talent acquisition
SIGMIS CPR '07: Proceedings of the 2007 ACM SIGMIS CPR conference on Computer personnel research: The global information technology workforceThis paper presents a theoretical framework based on exploratory research so IT managers can plan and procure their organization's IT skills more effectively. Open-ended interviews revealed that IT managers have difficulty in describing specific ...
Comments