JIN CUI

Ms. JIN CUI

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 July 2023
Verified
Conference Paper
Open access
XWXinfeng Wang
Xinfeng Wang
FFFumiyo Fukumoto
Fumiyo Fukumoto
JCJIN CUI
JIN CUI
YSYoshimi Suzuki
Yoshimi Suzuki
JLJiyi Li
Jiyi Li
DYDongjin Yu
Dongjin Yu
The point-of-interest (POI) recommendation predicts users' destinations, which might be of interest to users and has attracted considerable attention as one of the major applications in location-based social networks (LBSNs). Recent work on graph-based neural networks (GNN) or matrix factorization-based (MF) approaches has resulted in better representations of users and POIs to forecast users' latent preferences. However, they still suffer from the implicit feedback and cold-start problems of check-in data, as they cannot capture both local and global graph-based relations among users (or POIs) simultaneously, and the cold-start neighbors are not handled properly during graph convolution in GNN. In this paper, we propose an enhanced encoder-decoder network (EEDN) to exploit rich latent features between users, POIs, and interactions between users and POIs for POI recommendation. The encoder of EEDN utilizes a hybrid hypergraph convolution to enhance the aggregation ability of each graph convolution step and learns to derive more robust cold-start-aware user representations. In contrast, the decoder mines local and global interactions by both graph- and sequential-based patterns for modeling implicit feedback, especially to alleviate exposure bias. Extensive experiments in three public real-world datasets demonstrate that EEDN outperforms state-of-the-art methods. Our source codes and data are released at https://github.com/WangXFng/EEDN

22 December 2021 in IEEE Transactions on Cognitive and Developmental Systems
Verified
Journal Article
Closed access
JCJIN CUI
JIN CUI
XJXuanyu Jin
Xuanyu Jin
HHHua Hu
Hua Hu
LZLi Zhu
Li Zhu
KOKenji Ozawa
Kenji Ozawa
Wanzeng KongWanzeng Kong
Wanzeng Kong
For the detection of EEG-based driving mental states, it is important to utilize transfer learning to overcome individual and period differences. However, there are two challenges in existing unsupervised domain adaptation methods: (1) they ignore the geometric divergence of the source and target domains with single subspace mapping, and (2) they usually employ a fixed weight distribution to align the marginal and conditional probability distributions. In this paper, we propose a dynamic distribution alignment with dual-subspace mapping method (DDADSM) for cross-subject driver mental state detection. Initially, DDADSM explores two optimally aligned subspaces for the source and target domains, which can significantly reduce the geometric shifting. Subsequently, the dynamic probability distribution alignment method is introduced to acquire the adaptive weight between the marginal and conditional distributions, which adapts to domains with wide variations. Through our experiments based on the driving mental state detection task, DDADSM demonstrated superior performance compared with state-of-the-art models.

10 July 2024
Verified
Conference Paper
Open access
XWXinfeng Wang
Xinfeng Wang
FFFumiyo Fukumoto
Fumiyo Fukumoto
JCJIN CUI
JIN CUI
YSYoshimi Suzuki
Yoshimi Suzuki
DYDongjin Yu
Dongjin Yu
Graph neural network (GNN)-based models have been extensively studied for recommendations, as they can extract high-order collaborative signals accurately which is required for high-quality recommender systems. However, they neglect the valuable information gained through negative feedback in two aspects: (1) different users might hold opposite feedback on the same item, which hampers optimal information propagation in GNNs, and (2) even when an item vastly deviates from users' preferences, they might still choose it and provide a negative rating. In this paper, we propose a negative feedback-aware recommender model (NFARec) that maximizes the leverage of negative feedback. To transfer information to multi-hop neighbors along an optimal path effectively, NFARec adopts a feedback-aware correlation that guides hypergraph convolutions (HGCs) to learn users' structural representations. Moreover, NFARec incorporates an auxiliary task - predicting the feedback sentiment polarity (i.e., positive or negative) of the next interaction - based on the Transformer Hawkes Process. The task is beneficial for understanding users by learning the sentiment expressed in their previous sequential feedback patterns and predicting future interactions. Extensive experiments demonstrate that NFARec outperforms competitive baselines. Our source code and data are released at https://github.com/WangXFng/NFARec.

10 July 2024
Verified
Conference Paper
Open access
XWXinfeng Wang
Xinfeng Wang
FFFumiyo Fukumoto
Fumiyo Fukumoto
JCJIN CUI
JIN CUI
YSYoshimi Suzuki
Yoshimi Suzuki
JLJiyi Li
Jiyi Li
DYDongjin Yu
Dongjin Yu
Recommender models aimed at mining users' behavioral patterns have raised great attention as one of the essential applications in daily life. Recent work on graph neural networks (GNNs) or debiasing methods has attained remarkable gains. However, they still suffer from (1) over-smoothing node embeddings caused by recursive convolutions with GNNs, and (2) the skewed distribution of interactions due to popularity and user-individual biases. This paper proposes a contextualized and debiased recommender model (CaDRec). To overcome the over-smoothing issue, we explore a novel hypergraph convolution operator that can select effective neighbors during convolution by introducing both structural context and sequential context. To tackle the skewed distribution, we propose two strategies for disentangling interactions: (1) modeling individual biases to learn unbiased item embeddings, and (2) incorporating item popularity with positional encoding. Moreover, we mathematically show that the imbalance of the gradients to update item embeddings exacerbates the popularity bias, thus adopting regularization and weighting schemes as solutions. Extensive experiments on four datasets demonstrate the superiority of the CaDRec against state-of-the-art (SOTA) methods. Our source code and data are released at https://github.com/WangXFng/CaDRec.

11 September 2026 in Applied Sciences
Verified
Journal Article
Open access
PDF file
XLXiong Li
Xiong Li
JCJIN CUI
JIN CUI
Xiaofen JiXiaofen Ji
Xiaofen Ji
JZJing Zhang
Jing Zhang
SSShi Jing Shen
Shi Jing Shen
XPXiaohua Pan
Xiaohua Pan
Fashion trend forecasting is crucial for proactive supply chain management, sustainable production, and personalized marketing. However, accurately predicting fine-grained fashion trends across diverse user groups remains challenging, as conventional numerical models rely solely on historical popularity signals and cannot explicitly exploit the high-level semantic context underlying trend evolution. To address this limitation, we propose a Dual-Stream Driven Fashion Trend Forecasting (DDFTF) framework that integrates numerical forecasting with textual semantic reasoning. The numerical stream employs a multi-scale patch Transformer with metadata-aware feature fusion to capture temporal dynamics, while the semantic stream converts historical trends into structured textual descriptions, extracting interpretable semantic representations of global trends and turning points. A residual fusion module combines both streams by treating semantic signals as complementary corrections to numerical predictions. Extensive experiments on the FIT and GeoStyle benchmarks demonstrate that DDFTF consistently outperforms state-of-the-art methods, achieving up to a 14.6% relative MAE reduction in long-term forecasting. Ablation and qualitative analyses further show that the performance gains arise from meaningful semantic information rather than increased model capacity, while also improving the interpretability of fashion trend prediction. Our code is publicly available.