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

Penghang Yu

dblp:354/7262 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
6since 2021 · last 2026
0009-0004-3233-4248ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 5 · 2 first-author · 5 since 2021Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 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.

Artificial intelligence
3 papers
Graph learning · 83% Transfer learning and domain adaptation · 17%
Databases, data mining, and information retrieval
3 papers
Recommender systems · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems
multimodal recommendation
2.432025
Mind Individual Information! Principal Graph Learning for Multimedia Recommendation · AAAI 2025
BeFA: A General Behavior-driven Feature Adapter for Multimedia Recommendation · AAAI 2025
Multi-View Graph Convolutional Network for Multimedia Recommendation · ACM Multimedia 2023
Machine learning › Transfer learning and domain adaptation › domain adaptation
feature adaptation
0.912025
BeFA: A General Behavior-driven Feature Adapter for Multimedia Recommendation · AAAI 2025
Machine learning › Graph learning
graph neural network
0.912025
Mind Individual Information! Principal Graph Learning for Multimedia Recommendation · AAAI 2025
Machine learning › Graph learning
graph representation learning
0.912025
Mind Individual Information! Principal Graph Learning for Multimedia Recommendation · AAAI 2025
Machine learning › Graph learning › graph neural network
message passing
0.912025
Mind Individual Information! Principal Graph Learning for Multimedia Recommendation · AAAI 2025
Machine learning › Graph learning › graph neural network
subgraph learning
0.912025
Mind Individual Information! Principal Graph Learning for Multimedia Recommendation · AAAI 2025
Machine learning › Graph learning › graph neural network
graph convolutional network
0.712023
Multi-View Graph Convolutional Network for Multimedia Recommendation · ACM Multimedia 2023

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

spectral graph theory · 1.7principal subgraph extraction · 1.7pre-trained encoder · 1.7feature adapter · 1.7attribution analysis · 1.7multi-view learning · 1.3modality feature fusion · 1.3behavior-modality disentanglement · 1.3
YearPublicationVenuePosition
2026 Denoising-Enhanced Multimodal Detection Network for Fake News Video Detection
abstract
The proliferation of fake news on short video platforms has recently attracted widespread attention, prompting a growing interest in fake news video detection. While existing studies show initial success, they may be constrained by the following limitations: (1) Current detection approaches lack logical understanding and integration capabilities, thereby leading to models missing implicit essential news information. (2) They simultaneously exploit news content for detection but fail to effectively distinguish between informative and non-informative elements, causing the attention bias within the detection model. To address these limitations, we propose a Denoising-Enhanced Multimodal Detection Network (D2et) to mine implicit essential news information and filter out redundant information. Firstly, to improve comprehension of essential content, we leverage the large language model to mine tags from two levels: (1) Global-Insight Tag, which captures the overall content of the short video; and (2) Local-Veracity Tag, which identifies essential details. We obtain the global and local level tags to jointly extract the explicit and structured content for clarifying essential information. Secondly, we design an information denoising mechanism to eliminate redundant noise. This mechanism refines multimodal features guided by the extracted tags, ensuring that the model focuses on relevant content and suppresses redundant information, thereby improving detection performance. Extensive experiments on two datasets demonstrate the effectiveness of our method, validating the contributions of multi-level tags and the information denoising mechanism.
Xueshan Deng, Penghang Yu, Shengsheng Qian, Baoyuan Qi, Changsheng Xu
IEEE Trans. Circuits Syst. Video Technol.2
2025 BeFA: A General Behavior-driven Feature Adapter for Multimedia Recommendation
abstract
Multimedia recommender systems focus on utilizing behavioral information and content information to model user preferences. Typically, it employs pre-trained feature encoders to extract content features, then fuses them with behavioral features. However, pre-trained feature encoders often extract features from the entire content simultaneously, including excessive preference-irrelevant details.We speculate that it may result in the extracted features not containing sufficient features to accurately reflect user preferences. To verify our hypothesis, we introduce an attribution analysis method for visually and intuitively analyzing the content features. The results indicate that certain items’ content features exhibit the issues of information drift and information omission, reducing the expressive ability of features. Building upon this finding, we propose an effective and efficient general Behaviordriven Feature Adapter (BeFA) to tackle these issues. This adapter reconstructs the content feature with the guidance of behavioral information, enabling content features accurately reflecting user preferences. Extensive experiments demonstrate the effectiveness of the adapter across all multimedia recommendation methods.
Qile Fan, Penghang Yu, Zhiyi Tan 0002, Bing-Kun Bao, Guanming Lu
AAAI2
2025 Mind Individual Information! Principal Graph Learning for Multimedia Recommendation
abstract
Graph Neural Network (GNN)-based methods have recently emerged as effective approaches for multimedia recommendation. Typically, these methods employ message passing on the user-item interaction graph, and model user preferences by exploiting co-occurrence patterns. Despite their effectiveness, we argue that they insufficiently exploit the individual information, potentially limiting recommendation performance. To validate our argument, we first analyze existing methods from spectral graph theory. We identify that existing methods focus on capturing global structural features, but underutilize local structural features that convey individual information. Further detailed experiments reveal that such an underutilization leads to overly similar user preferences modeling. Furthermore, we propose a novel Principal Graph Learning (PGL) framework to address this issue. The idea is to enhance user preference modeling by effectively mining and utilizing principal local structural features. PGL first extracts the principal subgraph from the user-item interaction graph using two novel extraction operators: global-aware and local-aware subgraph extraction. It then employs message passing on the principal subgraph to comprehensively model user perference, with the aim of simultaneously capturing co-occurrence patterns and individual information. Compared to existing methods, PGL achieves an average performance improvement of 9%.
Penghang Yu, Zhiyi Tan 0002, Guanming Lu, Bing-Kun Bao
AAAI1
2025 LD4MRec: simplifying and powering diffusion model for multimedia recommendation
Jiarui Zhu, Penghang Yu, Zhiyi Tan 0002, Bing-Kun Bao
Multim. Syst.3
2024 Improving Graph Collaborative Filtering with Directional Behavior Enhanced Contrastive Learning
abstract
Graph Collaborative Filtering is a widely adopted approach for recommendation, which captures similar behavior features through Graph Neural Network (GNN). Recently, Contrastive Learning (CL) has been demonstrated as an effective method to enhance the performance of graph collaborative filtering. Typically, CL-based methods first perturb users’ history behavior data (e.g., drop clicked items), then construct a self-discriminating task for behavior representations under different random perturbations. However, for widely existing inactive users, random perturbation makes their sparse behavior information more incomplete, thereby harming the behavior feature extraction. To tackle the above issue, we design a novel directional perturbation-based CL method to improve the graph collaborative filtering performance. The idea is to perturb node representations through directionally enhancing behavior features. To do so, we propose a simple yet effective feedback mechanism, which fuses the representations of nodes based on behavior similarity. Then, to avoid irrelevant behavior preferences introduced by the feedback mechanism, we construct a behavior self-contrast task before and after feedback, to align the node representations between the final output and the first layer of GNN. Different from the widely adopted self-discriminating task, the behavior self-contrast task avoids complex message propagation on different perturbed graphs, which is more efficient than previous methods. Extensive experiments on three public datasets demonstrate that the proposed method has distinct advantages over other CL methods on recommendation accuracy.
Penghang Yu, Bing-Kun Bao, Zhiyi Tan 0002, Guanming Lu
ACM Trans. Knowl. Discov. Data1
2023 Multi-View Graph Convolutional Network for Multimedia Recommendation
abstract
Multimedia recommendation has received much attention in recent years. It models user preferences based on both behavior information and item multimodal information. Though current GCN-based methods achieve notable success, they suffer from two limitations: (1) Modality noise contamination to the item representations. Existing methods often mix modality features and behavior features in a single view (e.g., user-item view) for propagation, the noise in the modality features may be amplified and coupled with behavior features. In the end, it leads to poor feature discriminability; (2) Incomplete user preference modeling caused by equal treatment of modality features. Users often exhibit distinct modality preferences when purchasing different items. Equally fusing each modality feature ignores the relative importance among different modalities, leading to the suboptimal user preference modeling.
Penghang Yu, Zhiyi Tan 0002, Guanming Lu, Bing-Kun Bao
ACM Multimedia1