Jiahao Wang

Jiahao Wang


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
23 June 2025 in Journal of King Saud University Computer and Information Sciences
Verified
Journal Article
Open access
PDF file
QWQingshuai Wang
Qingshuai Wang
JWJiahao Wang
Jiahao Wang
NINoor Farizah Ibrahim
Noor Farizah Ibrahim
Precise news recommendations are critical in today’s digital landscape. However, conventional approaches overlook fine-grained sentiment nuances associated with individual entities in news content. This paper presents SentiEntityRec, a novel graph neural network framework that enriches traditional entity embeddings using a global graph-enhanced model by incorporating sentiment vectors. Experiments conducted with MIND datasets have shown that SentiEntityRec surpasses existing models in key performance metrics. For example, the proposed model improves +0.5% AUC over GLoCIM. These results underscore the superior efficacy of incorporating entity-sentiment analysis into graph-based news recommendation systems.

30 January 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
JWJiahao Wang
Jiahao Wang
HMHong yan Mei
Hong yan Mei
KLKai Li
Kai Li
XZXING ZHANG
XING ZHANG
Xin ChenXin Chen
Xin Chen
This paper proposes a novel graph neural network recommendation method to alleviate the user cold-start problem caused by too few relevant items in personalized recommendation collaborative filtering. A deep feedforward neural network is constructed to transform the bipartite graph of user–item interactions into the spectral domain, using a random wandering method to discover potential correlation information between users and items. Then, a finite-order polynomial is used to optimize the convolution process and accelerate the convergence of the convolutional network, so that deep connections between users and items in the spectral domain can be discovered quickly. We conducted experiments on the classic dataset MovieLens-1M. The recall and precision were improved, and the results show that the method can improve the accuracy of recommendation results, tap the association information between users and items more effectively, and significantly alleviate the user cold-start problem.

21 September 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
WLWenxiao Li
Wenxiao Li
HMHong yan Mei
Hong yan Mei
YLYutian Li
Yutian Li
JYJiayao Yu
Jiayao Yu
XZXing Zhang
Xing Zhang
JWJiahao Wang
Jiahao Wang
Due to the fast retrieval speed and low storage cost, cross-modal hashing has become the primary method for cross-modal retrieval. Since the emergence of deep cross-modal hashing methods, cross-modal retrieval significantly improved. However, the existing cross-modal hash retrieval methods still need to effectively utilize the dataset’s supervisory information and the lack of similarity expression ability. This means that the label information needs to be maximized, and the potential semantic relationship between two modalities cannot be fully explored, thus affecting the judgment of semantic similarity between two modalities. To address these problems, this paper proposes Tri-CMH, a cross-modal hash retrieval method with fused triples, which is an end-to-end modeling framework consisting of two parts: feature extraction and hash learning. Firstly, the multi-modal data are preprocessing into the form of triple groups. The data supervision matrix is constructed so that the samples with labels and their meanings are aggregated together. In contrast, the samples with labels and their opposite meanings are separated, thus avoiding the problem of the under-utilization of supervisory information in the data set and achieving the effect of efficiently utilizing the global supervisory information. Meanwhile, the loss function of the hash learning part is optimized by considering the Hamming distance loss, single-modality internal loss, cross-modality loss, and quantization loss to explicitly constrain semantically similar hash codes and semantically dissimilar hash codes and to improve the model’s ability to judge cross-modality semantic similarity. The method is trained and tested on the IAPR-TC12, MIRFLICKR-25K, and NUS-WIDE datasets, and the experimental evaluation criteria are mAP and PR curve, and the experimental results show the effectiveness and practicality of the method.