Shaochuan Lin

dblp:302/7914 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
5since 2021 · last 2023
0000-0001-5192-1609ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Databases, data management, data science and information retrieval · 3 · 1 first-author · 3 since 2021
YearPublicationVenuePosition
2023 Multi-Granularity Attention Model for Group Recommendation
abstract
Group recommendation provides personalized recommendations to a group of users based on their shared interests, preferences, and characteristics. Current studies have explored different methods for integrating individual preferences and making collective decisions that benefit the group as a whole. However, most of them heavily rely on users with rich behavior and ignore latent preferences of users with relatively sparse behavior, leading to insufficient learning of individual interests. To address this challenge, we present the Multi-Granularity Attention Model (MGAM), a novel approach that utilizes multiple levels of granularity (i.e., subsets, groups, and supersets) to uncover group members' latent preferences and mitigate recommendation noise. Specially, we propose a Subset Preference Extraction module that enhances the representation of users' latent subset-level preferences by incorporating their previous interactions with items and utilizing a hierarchical mechanism. Additionally, our method introduces a Group Preference Extraction module and a Superset Preference Extraction module, which explore users' latent preferences on two levels: the group-level, which maintains users' original preferences, and the superset-level, which includes group-group exterior information. By incorporating the subset-level embedding, group-level embedding, and superset-level embedding, our proposed method effectively reduces group recommendation noise across multiple granularities and comprehensively learns individual interests. Extensive offline and online experiments have demonstrated the superiority of our method in terms of performance.
Jianye Ji, Jiayan Pei, Shaochuan Lin, Taotao Zhou 0002, Hengxu He, Jia Jia 0006
CIKM3
2023 BASM: A Bottom-up Adaptive Spatiotemporal Model for Online Food Ordering Service
abstract
Online Food Ordering Service (OFOS) is a popular location-based service that helps people order what they want. Compared with traditional e-commerce recommendation systems, users’ interests may be diverse under different spatiotemporal contexts, leading to various spatiotemporal data distributions, which increases the difficulty of model learning. However, numerous current works simply mix all samples to train a set of model parameters, which makes it challenging to capture the diversity in different spatiotemporal contexts. Therefore, we address this challenge by proposing a Bottom-up Adaptive Spatiotemporal Model(BASM) to adaptively fit the spatiotemporal data distribution, further improving the fitting capability of the model. Specifically, a spatiotemporal-aware embedding layer performs weight adaptation on field granularity in feature embedding to achieve the purpose of dynamically perceiving spatiotemporal contexts. Meanwhile, we propose a spatiotemporal semantic transformation layer to explicitly convert the concatenated input of the raw semantic to the spatiotemporal semantic, which can further enhance the semantic representation under different spatiotemporal contexts. Furthermore, we introduce a novel spatiotemporal adaptive bias tower to capture diverse spatiotemporal bias, reducing the difficulty of modeling spatiotemporal distinction. To further verify the effectiveness of BASM, we propose two new metrics, Time-period-wise AUC (TAUC) and City-wise AUC (CAUC). Extensive offline evaluations on public and industrial datasets are conducted to demonstrate the effectiveness of our proposed model. The online A/B experiment also further illustrates the practicability of the model online service. This proposed method has now been implemented on Ele.me, a major online food ordering platform in China, serving more than 100 million online users.
Boya Du, Shaochuan Lin, Jiong Gao, Xiyu Ji, Mengya Wang, Taotao Zhou 0005, Hengxu He, Jia Jia 0006
ICDE2
2023 Exploring the Spatiotemporal Features of Online Food Recommendation Service
Shaochuan Lin, Jiayan Pei, Taotao Zhou 0005, Hengxu He, Jia Jia 0006
SIGIR1
2022 Heterogeneous graph driven unsupervised domain adaptation of person re-identification
Shaochuan Lin, Jianming Lv, Zhenguo Yang, Qing Li 0001, Wei-Shi Zheng 0001
Neurocomputing1
2021 GPS-ReID: A Benchmark for Cross-Modal Pedestrian Retrieval
abstract
Traditional person re-identification aims to retrieve the surveillance images containing the same pedestrian. As the quick development of modern cities, a large number of multimodal personal information, including mobile information and social network log, is available and useful for customer identification and crime tracking. Compared with traditional person reidentification (ReID) only based on image modality, how to make full use of multi-modal information for efficient person ReID is more challenging. In this paper, we propose a brand new cross-modal pedestrian retrieval task based on a novel multi-modal dataset containing GPS trajectories and surveillance images. Three sub-tasks are evolved in the benchmark: unsupervised GPS-to-Image, Image-to-GPS, and Image-to-Image retrieval. In order to further verify our ideas, we propose the Similarity Driven Model (SDM), which utilizes the attention mechanism to improve the performance of domain adaptation. Furthermore, we build a cross-modal heterogeneous graph based on SDM, and adopt Triplet-Walk to uniformly represent different modalities for retrieval. Experimental results demonstrate that our method achieves the state-of-the-art on the GPS-ReID dataset.
Shaochuan Lin, Jianming Lv, Yaquan Wang, Chujie Chen
IJCNN1