Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3269206.3272012acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
research-article

In-Session Personalization for Talent Search

Published: 17 October 2018 Publication History

Abstract

Previous efforts in recommendation of candidates for talent search followed the general pattern of receiving an initial search criteria and generating a set of candidates utilizing a pre-trained model. Traditionally, the generated recommendations are final, that is, the list of potential candidates is not modified unless the user explicitly changes his/her search criteria. In this paper, we are proposing a candidate recommendation model which takes into account the immediate feedback of the user, and updates the candidate recommendations at each step. This setting also allows for very uninformative initial search queries, since we pinpoint the user's intent due to the feedback during the search session. To achieve our goal, we employ an intent clustering method based on topic modeling which separates the candidate space into meaningful, possibly overlapping, subsets (which we call intent clusters) for each position. On top of the candidate segments, we apply a multi-armed bandit approach to choose which intent cluster is more appropriate for the current session. We also present an online learning scheme which updates the intent clusters within the session, due to user feedback, to achieve further personalization. Our offline experiments as well as the results from the online deployment of our solution demonstrate the benefits of our proposed methodology.

References

[1]
S. Agrawal and N. Goyal. 2012. Analysis of Thompson Sampling for the Multi-armed Bandit Problem. JMLR, Vol. 23 (2012).
[2]
D. Aha. 1992. Generalizing from case studies: A case study. In ICML .
[3]
H. Akaike. 1974. A new look at the statistical model identification. IEEE Trans. Automatic Control, Vol. 19, 6 (1974), 716--723.
[4]
P. Auer, N. Cesa-Bianchi, and P. Fischer. 2002. Finite-time Analysis of the Multiarmed Bandit Problem. Machine Learning Journal, Vol. 47 (2002), 235--256.
[5]
David M. Blei, Andrew Y. Ng, and Michael I. Jordan. 2003. Latent Dirichlet Allocation. JMLR, Vol. 3 (2003), 993--1022.
[6]
D. Chakrabarti, R. Kumar, F. Radlinski, and E. Upfal. 2008. Mortal multi-armed bandits. In NIPS. 273--280.
[7]
T. M. Chang and W. Feng. 2013. LDA-based Personalized Document Recommendation. In Proc. of PACIS 2013 .
[8]
O. Fontenla-Romero, B. Guijarro-Berdinas, D. Martinez-Rego, B. Perez-Sanchez, and D. Peteiro-Barral. 2013. Online Machine Learning. Efficiency and Scalability Methods for Computational Intellect (2013), 27--54.
[9]
Yang Gao, Zhenlong Sun, Yi Wang, Xiaosheng Liu, Jianfeng Yan, and Jia Zeng. 2015. A comparative study on parallel lda algorithms in mapreduce framework. LNCS, Vol. 9078 (2015), 675--689.
[10]
J. Gemmell, A. Shepitsen, M. Mobasher, and R. Burke. 2008. Personalization in Folksonomies Based on Tag Clustering. In Proc. of the 6th Workshop on Intelligent Techniques for Web Personalization and Recommender Systems .
[11]
T. Griffiths, M. Jordan, and J. Tenenbaum. 2004. Hierarchical Topic Models and the Nested Chinese Restaurant Process. In NIPS .
[12]
Viet Ha-Thuc, Ganesh Venkataraman, Mario Rodriguez, Shakti Sinha, Senthil Sundaram, and Lin Guo. 2015. Personalized Expertise Search at LinkedIn. In Proc. of the 4th IEEE Int. Conf. Big Data .
[13]
Viet Ha-Thuc, Ye Xu, Satya Pradeep Kanduri, Xianren Wu, Vijay Dialani, Yan Yan, Abhishek Gupta, and Shakti Sinha. 2016. Search by Ideal Candidates: Next Generation of Talent Search at LinkedIn. In ACM WWW .
[14]
K. Hofmann, S. Whiteson, and M. de Rijke. 2011. Contextual Bandits for Information Retrieval. In NIPS .
[15]
K. Jarvelin and J. Kekalainen. 2002. Cumulated Gain-based Evaluation of IR Techniques. ACM Trans. on Information Systems (TOIS), Vol. 20, 4 (2002), 422--446.
[16]
M. Jordan. 1999. In Learning in Graphical Models . MIT Press.
[17]
Takuya Kitazawa. 2016. Incremental Factorization Machines for Persistently Cold-starting Online Item Recommendation. CoRR, Vol. abs/1607.02858 (2016). http://arxiv.org/abs/1607.02858
[18]
P. Kohli, M. Salek, and G. Stoddard. 2013. A Fast Bandit Algorithm for Recommendations to Users with Heterogeneous Tastes. In AAAI .
[19]
L. Kotthoff. 2014. Algorithm selection for combinatorial search problems: A survey. AI Magazine (2014).
[20]
John Langford and Tong the. 2008. The epoch-greedy algorithm for contextual multi-armed bandits. In NIPS .
[21]
A. Q. Li, A. Ahmed, S. Ravi, and A. J. Smola. 2014. Reducing the sampling complexity of topic models. In KDD .
[22]
Jing Lu, Steven C. H. Hoi, and Jialei Wang. 2013. Second Order Online Collaborative Filtering. In ACML. 325--340.
[23]
T. Luostarinen and O. Kohonen. 2013. Using Topic Models in Content-Based news Recommender Systems. In Proc. of the 19th Nordic Conf. of Computational Linguistics. 239--251.
[24]
Kevin P. Murphy. 2012. Online Learning and Stochastic Optimization. Machine Learning: A Probabilistic Perspective (2012), 264--270.
[25]
F. Radlinski, R. Kleinberg, and T. Joachims. 2008. Learning Diverse Rankings with Multi-Armed Bandits. In ICML .
[26]
Steffen Rendle. 2010. Factorization Machines. In ICDM (ICDM '10). IEEE Computer Society, Washington, DC, USA, 995--1000.
[27]
F. Rosenblatt. 1958. The Perceptron: A Probabilistic Model for Information Storage and Organization in the Brain. Psychological Review, Vol. 65, 6 (1958), 386--408.
[28]
Shai Shalev-Shwartz. 2011. Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, Vol. 4, 2 (2011), 107--194.
[29]
Kate A. Smith-Miles. 2008. Cross-Disciplinary Perspectives on Meta-Learning for Algorithm Selection. Comput. Surveys, Vol. 41, 1 (2008).
[30]
S. Sriram and A. Makhani. {n. d.}. LinkedIn's Galene Search engine, 2014, https://engineering.linkedin.com/search/did-you-mean-galene.
[31]
W. R. Thompson. 1933. On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika, Vol. 25, 3--4 (1933).
[32]
Chih-Chun Wang, Sanjeev R. Kulkarni, and H. Vincent Poor. 2005. Bandit problems with side observations. IEEE Trans. Automatic Control, Vol. 50, 3 (2005), 338--355.
[33]
H. Yin, Y. Sun, B. Cui, Z. Hu, and L. Chen. 2013. LCARS: A Location-Content-Aware Recommender System. In ACM KDD .
[34]
XianXing Zhang, Yitong Zhou, Yiming Ma, Bee-Chung Chen, Liang Zhang, and Deepak Agarwal. 2016. GLMix: Generalized Linear Mixed Models For Large-Scale Response Prediction. In ACM KDD . 363--372.
[35]
Y. Zhang, D. Sé aghdha, D Quercia, and T. Jambor. 2012. Auralist: Introducing serendipity into music recommendation. In ACM WSDM .

Cited By

View all
  • (2022)Multi-Armed Bandits in Recommendation SystemsExpert Systems with Applications: An International Journal10.1016/j.eswa.2022.116669197:COnline publication date: 18-May-2022
  • (2020)Enhancing Employer Brand Evaluation with Collaborative Topic Regression ModelsACM Transactions on Information Systems10.1145/339273438:4(1-33)Online publication date: 23-May-2020

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
CIKM '18: Proceedings of the 27th ACM International Conference on Information and Knowledge Management
October 2018
2362 pages
ISBN:9781450360142
DOI:10.1145/3269206
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: 17 October 2018

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. in session recommendations
  2. model selection
  3. online learning
  4. talent search

Qualifiers

  • Research-article

Conference

CIKM '18
Sponsor:

Acceptance Rates

CIKM '18 Paper Acceptance Rate 147 of 826 submissions, 18%;
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)11
  • Downloads (Last 6 weeks)3
Reflects downloads up to 01 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2022)Multi-Armed Bandits in Recommendation SystemsExpert Systems with Applications: An International Journal10.1016/j.eswa.2022.116669197:COnline publication date: 18-May-2022
  • (2020)Enhancing Employer Brand Evaluation with Collaborative Topic Regression ModelsACM Transactions on Information Systems10.1145/339273438:4(1-33)Online publication date: 23-May-2020

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media