TIMBRE: Efficient Job Recommendation On Heterogeneous Graphs For Professional Recruiters

November 06, 2024 Β· Declared Dead Β· πŸ› 2024 IEEE/WIC International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Eric Behar, Julien Romero, Amel Bouzeghoub, Katarzyna Wegrzyn-Wolska arXiv ID 2411.15146 Category cs.IR: Information Retrieval Citations 2 Venue 2024 IEEE/WIC International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT) Last Checked 4 months ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Retrieval

Died the same way β€” πŸ‘» Ghosted