Mankun Zhao

Mankun Zhao

Auto-generated profile, based on publicly available information

Mankun Zhao

College of Intelligence and Computing, Tianjin University, Tianjin 300350, P. R. China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
27 February 2023
Verified
Conference Paper
Open access
XLXuewei Li
Xuewei Li
ASAitong Sun
Aitong Sun
MZMankun Zhao
Mankun Zhao
JYJian Yu
Jian Yu
KZKun Zhu
Kun Zhu
RYRuiguo Yu
Ruiguo Yu
Sequential recommendation aims to capture users' dynamic preferences, in which data sparsity is a key problem. Most contrastive learning models leverage data augmentation to address this problem, but they amplify noises in original sequences. Contrastive learning has the assumption that two views (positive pairs) obtained from the same user behavior sequence must be similar. However, noises typically disturb the user's main intention, which results in the dissimilarity of two views. To address this problem, in this work, we formalize the denoising problem by selecting the user's main intention, and apply contrastive learning for the first time under this topic, i.e., we propose a novel framework, namely Multi-Intention Oriented Contrastive Learning Recommender (IOCRec). In order to create high-quality views with intent-level, we fuse local and global intentions to unify sequential patterns and intent-level self-supervision signals. Specifically, we design the sequence encoder in IOCRec which includes three modules: local module, global module and disentangled module. The global module can capture users' global preferences, which is independent of the local module. The disentangled module can obtain multi-intention behind global and local representations. From a fine-grained perspective, IOCRec separates different intentions to guide the denoising process. Extensive experiments on four widely-used real datasets demonstrate the effectiveness of our new method for sequential recommendation.

4 March 2024
Verified
Conference Paper
Open access
XLXuewei Li
Xuewei Li
HCHongwei Chen
Hongwei Chen
JYJian Yu
Jian Yu
MZMankun Zhao
Mankun Zhao
TXTianyi Xu
Tianyi Xu
MYMei Yu
Mei Yu
Multi-behavior sequential recommendation (MBSR) predicts a user's next item of interest based on their interaction history across different behavior types. Although existing studies have proposed capturing the correlation between different types of behavior, two important challenges have not been explored: i) Dealing with heterogeneous item transitions (both global and local perspectives). ii) Mitigating the issue of noise that arises from the incorporation of auxiliary behaviors. To address these issues, we propose a novel solution, Global Heterogeneous Graph and Target Interest Denoising for Multi-behavior Sequential Recommendation (GHTID). In particular, we view the transitions between behavior types of items as different relationships and propose two heterogeneous graphs. By considering the relationship between items under different behavioral types of transformations, we propose two heterogeneous graph convolution modules and explicitly learn heterogeneous item transitions. Moreover, we utilize two attention networks to integrate long-term and short-term interests associated with the target behavior to alleviate the noisy interference of auxiliary behaviors. Extensive experiments on four real-world datasets demonstrate that our method outperforms other state-of-the-art methods.

13 April 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
MYMei Yu
Mei Yu
CBChen Bai
Chen Bai
JYJian Yu
Jian Yu
MZMankun Zhao
Mankun Zhao
TXTianyi Xu
Tianyi Xu
RYRuiguo Yu
Ruiguo Yu
Knowledge representation learning achieves the automatic completion of knowledge graphs (KGs) by embedding entities into continuous low-dimensional vector space. In knowledge graph completion (KGC) tasks, the inter-dependencies and hierarchical information in KGs have gained attention. Existing methods do not well capture the latent dependencies between all components of entities and relations. To address this, we introduce the mathematical theories of octonion, a more expressive generalized form of complex number and quaternion, and propose a translation-based KGC model with octonion (TransO). TransO models entities as octonion coordinate vectors, relations as the combination of octonion component matrices and coordinate vectors, and uses specific grouping calculation rules to interact between entities and relations. In addition, since hyperbolic Poincaré space in non-Euclidean mathematics can represent hierarchical data more accurately and effectively than traditional Euclidean space, we propose a Poincaré-extended TransO model (PTransO). PTransO transforms octonion coordinate vectors into hyperbolic embeddings by exponential mapping, and integrates the Euclidean-based calculations into hyperbolic space by operations such as Möbius addition and hyperbolic distance. The experimental results of link prediction indicate that TransO outperforms other translation-based models on the WN18 benchmark, and PTransO further achieves state-of-the-art performance in low-dimensional space on the well-established WN18RR and FB15k-237 benchmarks.

17 June 2022 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
MYMei Yu
Mei Yu
JGJiujiang Guo
Jiujiang Guo
JYJian Yu
Jian Yu
TXTianyi Xu
Tianyi Xu
MZMankun Zhao
Mankun Zhao
RYRuiguo Yu
Ruiguo Yu

3 February 2023 in Data Mining and Knowledge Discovery
Verified
Journal Article
Closed access
PDF file
MYMei Yu
Mei Yu
JGJiujiang Guo
Jiujiang Guo
JYJian Yu
Jian Yu
TXTianyi Xu
Tianyi Xu
MZMankun Zhao
Mankun Zhao
RYRuiguo Yu
Ruiguo Yu

18 September 2024 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
MZMankun Zhao
Mankun Zhao
ASAitong Sun
Aitong Sun
JYJian Yu
Jian Yu
XLXuewei Li
Xuewei Li
Dongxiao HeDongxiao He
Dongxiao He
MYMei Yu
Mei Yu
Sequential recommendation aims to capture users' dynamic preferences. Due to the limited information in the sequence and the uncertain user behavior, data sparsity has always been a key problem. Although data augmentation methods can alleviate this issue, unreliable data can affect the performance of such models. To solve the above problems, we propose a new framework, namely R eliable D ata Augmented C ontrastive Learning Rec ommender (RDCRec). Specifically, in order to generate more high-quality reliable items for data augmentation, we design a multi-attributes oriented sequence generator. It moves auxiliary information from the input layer to the attention layer for learning a better attention distribution. Then, we replace a percentage of items in the original sequence with reliable items generated by the generator as the augmented sequence, for creating a high-quality view for contrastive learning. In this way, RDCRec can extract more meaningful user patterns by using the self-supervised signals of the reliable items, thereby improving recommendation performance. Finally, we train a discriminator to identify unreplaced items in the augmented sequence thus we can update item embeddings selectively in order to increase the exposure of more reliable items and improve the accuracy of recommendation results. The discriminator, as an auxiliary model, is jointly trained with the generative task and the contrastive learning task. Large experiments on four popular datasets that are commonly used demonstrate the effectiveness of our new method for sequential recommendation.