BiMuF: A Bi-directional Recommender System with Multi-semantic Filter for Online Recruitment

preprint OA: closed CC-BY-4.0
📄 Open PDF View at publisher

Abstract

Most existing recommendation research has been concentrated on unidirectional recommendation, i.e. only recommending items to users. However, the platform needs to achieve bi-directional recommendation in many real-world scenarios. For example, in an online recruitment scenario, the recommender system not only needs to recommend positions to candidates, but also recommend candidates to enterprises. In this paper, we develop a new bi-directional recommendation model for online recruitment termed BiMuF (Bi-directional recommendation with Multi-semantic Filter). In BiMuF, an encoder component is utilized to learn the text embeddings, a multi-semantic filter component is designed to capture important graph representation, and a graph learning component is designed to learn the graph embeddings. In addition, a multi-task learning framework is designed to achieve bi-directional recommendations. In the multi-task learning framework, we share text embeddings and graph embeddings to alleviate the problems of data sparsity, data asymmetry, and feature generalization in online recruitment. Extensive experiments in a real-world task show that BiMuF outperforms the state-of-the-art methods, verifying the effectiveness of the designs of our model.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-05-20T11:00:21.680559+00:00
License: CC-BY-4.0