Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Shanshan Gao 0005

dblp:43/5926-5 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2024
0009-0001-8912-4004ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Recommender systems · 67% Web and social media mining · 17% Graph data management · 17%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems › representation learning for recommendation
contrastive learning for recommendation
0.812024
Bilateral Multi-Behavior Modeling for Reciprocal Recommendation in Online Recruitment · IEEE Trans. Knowl. Data Eng. 2024
Graph data management › heterogeneous graph
heterogeneous graph learning
0.812024
Bilateral Multi-Behavior Modeling for Reciprocal Recommendation in Online Recruitment · IEEE Trans. Knowl. Data Eng. 2024
Recommender systems › implicit feedback learning
multi-behavior recommendation
0.812024
Bilateral Multi-Behavior Modeling for Reciprocal Recommendation in Online Recruitment · IEEE Trans. Knowl. Data Eng. 2024
Web and social media mining
online recruitment
0.812024
MIRROR: A Multi-View Reciprocal Recommender System for Online Recruitment · SIGIR 2024
Recommender systems › user recommendation
reciprocal recommendation
0.812024
Bilateral Multi-Behavior Modeling for Reciprocal Recommendation in Online Recruitment · IEEE Trans. Knowl. Data Eng. 2024
Recommender systems
sequential recommendation
0.812024
MIRROR: A Multi-View Reciprocal Recommender System for Online Recruitment · SIGIR 2024

Methods — techniques the papers use, named apart from their topics

transformer · 1.5multi-task learning · 1.5multi-stage output layer · 0.8heterogeneous graph transformer · 0.8contrastive learning · 0.8
YearPublicationVenuePosition
2024 MIRROR: A Multi-View Reciprocal Recommender System for Online Recruitment
abstract
Reciprocal Recommender Systems (RRSs) which aim to satisfy the preferences of both service providers and seekers simultaneously has attracted significant research interest in recent years. Existing studies on RRSs mainly focus on modeling the bilateral interactions between the users on both sides to capture the user preferences. However, due to the presence of exposure bias, modeling user preferences solely based on bilateral interactions often lacks precision. Additionally, in RRSs, users may exhibit varying preferences when acting in different roles, and how to effectively model users from multiple perspectives remains a substantial problem. To solve the above challenges, in this paper, we propose a novel MultI-view Reciprocal Recommender system for Online Recruitment (MIRROR). Specifically, we first propose to model the users from three different views, respectively search, active, and passive views, and we further design several Transformer-based sequential models to capture the user representation corresponding to each view. Then, we propose to divide the bilateral matching process into three stages, respectively apply, reply, and match, and a multi-stage output layer is designed based on the above multi-view modeling results. To train our MIRROR model, we first design a multi-task learning loss based on the multi-stage output results. Moreover, to bridge the semantic gap between search queries and user behaviors, we additionally design a supplementary task for next-query prediction. Finally, we conduct both offline experiments on five real-world datasets and online A/B tests, and the experiment results clearly validate the effectiveness of our MIRROR model compared with several state-of-the-art baseline methods.
Zhi Zheng 0008, Shanshan Gao 0005, Hengshu Zhu, Hui Xiong 0001
SIGIR3
2024 Bilateral Multi-Behavior Modeling for Reciprocal Recommendation in Online Recruitment
abstract
Recent years have witnessed the rapid development of online recruitment platforms, which provide a convenient way for matching job seekers and recruiters by leveraging recommendation systems. Indeed, this is areciprocal recommendationproblem which needs to consider the preferences of both job seekers and recruiters simultaneously, making it different from traditional uni-directional user-item recommendation problems. Existing studies mainly focus on building recommendation models based on the matched person-job pairs via text matching or collaborative filtering methods. However, we propose that these methods are limited and insufficient for user modeling in recruitment platforms, since the abundant multi-typed bilateral behaviors (e.g.,apply for conversationandneglect the candidates) among users have been largely ignored. Therefore, in this paper, we propose a novel BilAteral Multi-BehaviOr mOdeling (BAMBOO) method for reciprocal recommendation in online recruitment, which can model the multi-typed interactions between job seekers and recruiters from two different perspectives, respectivelyexpectation perspectiveandcompetitiveness perspective. Specifically, for the expectation perspective, we propose to format the historical behaviors of different users as bilateral multi-behavior sequences, and we utilize a transformer-based model to learn the representations of what the userswantto obtain. For the competitiveness perspective, we propose to construct a bilateral interaction heterogeneous graph to describe the entire recruitment market, and further utilize a heterogeneous graph transformer-based model to learn the representations of what the userscanobtain. Moreover, we utilize contrastive learning methods to enhance these two modules. Furthermore, we propose to decompose the matching probability between job seekers and recruiters into the product of two parts, respectively the probability of the active party initiating the conversation and the probability of the passive party accepting it, and we train our model based on a multi-task learning strategy. Finally, we conduct both offline experiments on real-world datasets and online A/B test, and the experiment results validate the effectiveness of our BAMBOO model compared with several state-of-the-art baseline methods.
Zhi Zheng 0008, Zhaopeng Qiu, Shanshan Gao 0005, Yang Song 0021, Hengshu Zhu, Hui Xiong 0001
IEEE Trans. Knowl. Data Eng.5