TIMBRE: Efficient Job Recommendation On Heterogeneous Graphs For Professional Recruiters
원문 초록
Job recommendation gathers many challenges well-known in recommender systems. First, it suffers from the cold start problem, with the user (the candidate) and the item (the job) having a very limited lifespan. It makes the learning of good user and item representations hard. Second, the temporal aspect is crucial: We cannot recommend an item in the future or too much in the past. Therefore, using solely collaborative filtering barely works. Finally, it is essential to integrate information about the users and the items, as we cannot rely only on previous interactions. This paper proposes a temporal graph-based method for job recommendation: TIMBRE (Temporal Integrated Model for Better REcommendations). TIMBRE integrates user and item information into a heterogeneous graph. This graph is adapted to allow efficient temporal recommendation and evaluation, which is later done using a graph neural network. Finally, we evaluate our approach with recommender system metrics, rarely computed on graph-based recommender systems.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
NLGCL: Naturally Existing Neighbor Layers Graph Contrastive Learning for Recommendation
RAG-VisualRec: An Open Resource for Vision- and Text-Enhanced Retrieval-Augmented Generation in Recommendation
Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust Recommendation
Discrete Scale-invariant Metric Learning for Efficient Collaborative Filtering
SGCL: Unifying Self-Supervised and Supervised Learning for Graph Recommendation
CORONA: A Coarse-to-Fine Framework for Graph-based Recommendation with Large Language Models
토론
이 논문과 연결된 포럼 글이 아직 없습니다.