Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yao Zhu 0002

dblp:79/4629-2 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
5since 2021 · last 2024
0009-0000-6731-4475ORCID · verified

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

Databases, data management, data science and information retrieval · 4 · 1 first-author · 4 since 2021Artificial intelligence and machine learning · 2 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
4 papers
Knowledge graphs · 38% Data mining · 32% Recommender systems · 18%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

Topics — the 10 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems
sequential recommendation
0.812024
Knowledge Graph-Based Behavior Denoising and Preference Learning for Sequential Recommendation · IEEE Trans. Knowl. Data Eng. 2024
Data mining
anomaly detection
0.512021
IFSpard: An Information Fusion-based Framework for Spam Review Detection · WWW 2021
Data integration and cleaning
data fusion
0.512021
IFSpard: An Information Fusion-based Framework for Spam Review Detection · WWW 2021
Knowledge graphs › knowledge graph alignment
entity alignment
0.512021
Relation-Aware Neighborhood Matching Model for Entity Alignment · AAAI 2021
Knowledge graphs
knowledge base integration
0.512021
Relation-Aware Neighborhood Matching Model for Entity Alignment · AAAI 2021
Data mining › anomaly detection › spam detection
review spam detection
0.512021
IFSpard: An Information Fusion-based Framework for Spam Review Detection · WWW 2021
Knowledge graphs
link prediction
0.412019
Representation Learning with Ordered Relation Paths for Knowledge Graph Completion · EMNLP/IJCNLP (1) 2019
Data mining
representation learning
0.412019
Representation Learning with Ordered Relation Paths for Knowledge Graph Completion · EMNLP/IJCNLP (1) 2019
Machine learning › Representation and self-supervised learning › representation learning › embedding learning
interpretable embedding
0.112021
IFSpard: An Information Fusion-based Framework for Spam Review Detection · WWW 2021
Machine learning › Representation and self-supervised learning › representation learning
latent representation learning
0.112021
IFSpard: An Information Fusion-based Framework for Spam Review Detection · WWW 2021

Methods — techniques the papers use, named apart from their topics

latent representation learning · 1.0information fusion · 1.0classification ensemble · 1.0supervised knowledge path selection · 0.8knowledge-enhanced preference learning · 0.8knowledge-enhanced behavior denoising · 0.8semi-supervised learning · 0.5neighborhood matching · 0.5iterative framework · 0.5ordered relation paths · 0.4
YearPublicationVenuePosition
2024 Knowledge Graph-Based Behavior Denoising and Preference Learning for Sequential Recommendation
abstract
Sequential recommendation seeks to predict users' next behaviors and recommend related items over time. Existing research has mainly focused on modeling users' dynamic preferences from their sequential behaviors. However, most of these studies have ignored the negative effects of noise behaviors in the given sequences, which may mislead the recommender. In addition, users' behavior data is always sparse, which makes it difficult to effectively learn users' preferences purely from their historical behaviors. Most recently, knowledge graphs (KGs) have been exploited by few researchers for sequential recommendation. However, they always assume all information in KGs or KG paths with limited length are useful for recommendation, which may bring irrelevant information from KGs into the recommender and further mislead the recommender. To address these issues, we propose a novel KG-based behavior denoising and preference learning model named KGDPL for sequential recommendation. We argue that the paths in KGs that reflect semantic relations between entities can not only help to remove noise behaviors and recommend successive items for users, but also provide relevant explanations. Therefore, we first devise a supervised knowledge path selection module to select effective paths between items from KGs for behavior prediction, which aims to filter out irrelevant information from KGs for the given recommendation task. Then, we design a knowledge-enhanced behavior denoising module to mitigate the negative effects of the noise behaviors contained in historical sequences by using the knowledge path information. After that, we propose a knowledge-enhanced preference learning module to better learn users' personalized and dynamic preferences from their historical behavior sequences and related knowledge information, which can also help tag users and provide explanations for recommendation results. Experimental results on four real-world datasets demonstrate the effectiveness and interpretability of the proposed model KGDPL.
Hongzhi Liu 0001, Yao Zhu 0002, Zhonghai Wu
IEEE Trans. Knowl. Data Eng.2
2022 Market-Aware Dynamic Person-Job Fit with Hierarchical Reinforcement Learning
Hongzhi Liu 0001, Yao Zhu 0002, Yang Song 0021, Tao Zhang 0070, Zhonghai Wu
DASFAA (2)4
2021 Relation-Aware Neighborhood Matching Model for Entity Alignment
abstract
Entity alignment which aims at linking entities with the same meaning from different knowledge graphs (KGs) is a vital step for knowledge fusion. Existing research focused on learning embeddings of entities by utilizing structural information of KGs for entity alignment. These methods can aggregate information from neighboring nodes but may also bring noise from neighbors. Most recently, several researchers attempted to compare neighboring nodes in pairs to enhance the entity alignment. However, they ignored the relations between entities which are also important for neighborhood matching. In addition, existing methods paid less attention to the positive interactions between the entity alignment and the relation alignment. To deal with these issues, we propose a novel Relation-aware Neighborhood Matching model named RNM for entity alignment. Specifically, we propose to utilize the neighborhood matching to enhance the entity alignment. Besides comparing neighbor nodes when matching neighborhood, we also try to explore useful information from the connected relations. Moreover, an iterative framework is designed to leverage the positive interactions between the entity alignment and the relation alignment in a semi-supervised manner. Experimental results on three real-world datasets demonstrate that the proposed model RNM performs better than state-of-the-art methods.
Yao Zhu 0002, Hongzhi Liu 0001, Zhonghai Wu, Yingpeng Du
AAAI1
2021 Beyond Matching: Modeling Two-Sided Multi-Behavioral Sequences for Dynamic Person-Job Fit
Hongzhi Liu 0001, Yao Zhu 0002, Yang Song 0021, Tao Zhang 0070, Zhonghai Wu
DASFAA (2)3
2021 IFSpard: An Information Fusion-based Framework for Spam Review Detection
abstract
Online reviews, which contain the quality information and user experience about products, always affect the consumption decisions of customers. Unfortunately, quite a number of spammers attempt to mislead consumers by writing fake reviews for some intents. Existing methods for detecting spam reviews mainly focus on constructing discriminative features, which heavily depend on experts and may miss some complex but effective features. Recently, some models attempt to learn the latent representations of reviews, users, and items. However, the learned embeddings usually lack interpretability. Moreover, most of existing methods are based on single classification model while ignoring the complementarity of different classification models.
Yao Zhu 0002, Hongzhi Liu 0001, Yingpeng Du, Zhonghai Wu
WWW1
2019 Representation Learning with Ordered Relation Paths for Knowledge Graph Completion
abstract
Yao Zhu, Hongzhi Liu, Zhonghai Wu, Yang Song, Tao Zhang. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). 2019.
Yao Zhu 0002, Hongzhi Liu 0001, Zhonghai Wu, Yang Song 0021, Tao Zhang 0070
EMNLP/IJCNLP (1)1