Jibing Gong

Jibing Gong

Auto-generated profile, based on publicly available information

Jibing Gong

Yanshan University, Qinhuangdao, China and Hebei Key Laboratory of Computer Virtual Technology and System Integration, Qinhuangdao, China

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
10 February 2020 in IEEE Access
Verified
Journal Article
Open access
JGJibing Gong
Jibing Gong
ZTZhiyong Teng
Zhiyong Teng
QTQi Teng
Qi Teng
HZHekai Zhang
Hekai Zhang
LDLinfeng Du
Linfeng Du
HMHongyuan Ma
Hongyuan Ma
Traditional methods of multi-label text classification, particularly deep learning, have achieved remarkable results. However, most of these methods use word2vec technology to represent sequential text information, while ignoring the logic and internal hierarchy of the text itself. Although these approaches can learn the hypothetical hierarchy and logic of the text, it is unexplained. In addition, the traditional approach treats labels as independent individuals and ignores the relationships between them, which not only does not reflect reality but also causes significant loss of semantic information. In this paper, we propose a novel Hierarchical Graph Transformer based deep learning model for large-scale multi-label text classification. We first model the text into a graph structure that can embody the different semantics of the text and the connections between them. We then use a multi-layer transformer structure with a multi-head attention mechanism at the word, sentence, and graph levels to fully capture the features of the text and observe the importance of the separate parts. Finally, we use the hierarchical relationship of the labels to generate the representation of the labels, and design a weighted loss function based on the semantic distances of the labels. Extensive experiments conducted on three benchmark datasets demonstrated that the proposed model can realistically capture the hierarchy and logic of text and improve performance compared with the state-of-the-art methods.

22 May 2023 in ACM Transactions on the Web
Verified
Journal Article
Open access
JGJibing Gong
Jibing Gong
YWYao Wan
Yao Wan
YLYe Liu
Ye Liu
XLXuewen Li
Xuewen Li
YZYi Zhao
Yi Zhao
JTJie Tang
Jie Tang
Massive open online courses (MOOCs), which offer open access and widespread interactive participation through the internet, are quickly becoming the preferred method for online and remote learning. Several MOOC platforms offer the service of course recommendation to users, to improve the learning experience of users. Despite the usefulness of this service, we consider that recommending courses to users directly may neglect their varying degrees of expertise. To mitigate this gap, we examine an interesting problem of concept recommendation in this paper, which can be viewed as recommending knowledge to users in a fine-grained way. We put forward a novel approach, termedHinCRec-RL, forConceptRecommendation in MOOCs, which is based onHeterogeneousInformationNetworks andReinforcementLearning. In particular, we propose to shape the problem of concept recommendation within a reinforcement learning framework to characterize the dynamic interaction between users and knowledge concepts in MOOCs. Furthermore, we propose to form the interactions among users, courses, videos, and concepts into aheterogeneous information network (HIN)to learn the semantic user representations better. We then employ an attentional graph neural network to represent the users in the HIN, based on meta-paths. Extensive experiments are conducted on a real-world dataset collected from a Chinese MOOC platform,XuetangX, to validate the efficacy of our proposed HinCRec-RL. Experimental results and analysis demonstrate that our proposed HinCRec-RL performs well when compared with several state-of-the-art models.

18 July 2023
Verified
Conference Paper
Open access
YZYi Zhao
Yi Zhao
CLChaozhuo Li
Chaozhuo Li
JPJiquan Peng
Jiquan Peng
XFxiaohan fang
xiaohan fang
Feiran HuangFeiran Huang
Feiran Huang
JGJibing Gong
Jibing Gong
Cross-Domain Recommendation (CDR) is capable of incorporating auxiliary information from multiple domains to advance recommendation performance. Conventional CDR methods primarily rely on overlapping users, whereby knowledge is conveyed between the source and target identities belonging to the same natural person. However, such a heuristic assumption is not universally applicable due to an individual may exhibit distinct or even conflicting preferences in different domains, leading to potential noises. In this paper, we view the anchor links between users of various domains as the learnable parameters to learn the task-relevant cross-domain correlations. A novel optimal transport based model ALCDR is further proposed to precisely infer the anchor links and deeply aggregate collaborative signals from the perspectives of intra-domain and inter-domain. Our proposal is extensively evaluated over real-world datasets, and experimental results demonstrate its superiority.

7 June 2021 in Electronics
Verified
Journal Article
Open access
PDF file
YWYing Wang
Ying Wang
JZJiazhuang Zheng
Jiazhuang Zheng
QLQing Li
Qing Li
CWChenglong Wang
Chenglong Wang
HZHanyun Zhang
Hanyun Zhang
JGJibing Gong
Jibing Gong
Personality characteristics represent the behavioral characteristics of a class of people. Social networking sites have a multitude of users, and the text messages generated by them convey a person’s feelings, thoughts, and emotions at a particular time. These social texts indeed record the long-term psychological activities of users, which can be used for research on personality recognition. However, most of the existing deep learning models for multi-label text classification consider long-distance semantics or sequential semantics, but problems such as non-continuous semantics are rarely studied. This paper proposed a deep learning framework that combined XLNet and the capsule network for personality classification (XLNet-Caps) from textual posts. Our personality classification was based on the Big Five personality theory and used the text information generated by the same user at different times. First, we used the XLNet model to extract the emotional features from the text information at each time point, and then, the extracted features were passed through the capsule network to extract the personality features further. Experimental results showed that our model can effectively classify personality and achieve the lowest average prediction error.

10 December 2019 in IEEE Access
Verified
Journal Article
Open access
JGJibing Gong
Jibing Gong
YZYi Zhao
Yi Zhao
SCShuai Chen
Shuai Chen
HWHongfei Wang
Hongfei Wang
LDLinfeng Du
Linfeng Du
BDBowen Du
Bowen Du

21 October 2023
Verified
Conference Paper
Open access
XWXi Wu
Xi Wu
LYLiangwei Yang
Liangwei Yang
JGJibing Gong
Jibing Gong
CZChao Zhou
Chao Zhou
TLTianyu Lin
Tianyu Lin
PYPhilip S. Yu
Philip S. Yu
Collaborative filtering (CF) is a widely employed technique that predicts user preferences based on past interactions. Negative sampling plays a vital role in training CF-based models with implicit feedback. In this paper, we propose a novel perspective based on the sampling area to revisit existing sampling methods. We point out that current sampling methods mainly focus on Point-wise or Line-wise sampling, lacking flexibility and leaving a significant portion of the hard sampling area un-explored. To address this limitation, we propose Dimension Independent Mixup for Hard Negative Sampling (DINS), which is the first Area-wise sampling method for training CF-based models. DINS comprises three modules: Hard Boundary Definition, Dimension Independent Mixup, and Multi-hop Pooling. Experiments with real-world datasets on both matrix factorization and graph-based models demonstrate that DINS outperforms other negative sampling methods, establishing its effectiveness and superiority. Our work contributes a new perspective, introduces Area-wise sampling, and presents DINS as a novel approach that achieves state-of-the-art performance for negative sampling. Our implementations are available in PyTorch.