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

Minghao Xiao

dblp:375/1785 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none

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

Databases, data management, data science and information retrieval · 1 · 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
1 paper
Recommender systems · 100%
Network and information security
1 paper
Privacy and data protection · 50% Security and privacy of machine learning · 50%

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

TopicWeightPapersLastEvidence papers
Recommender systems
large language model-based recommendation
0.912025
Exact and Efficient Unlearning for Large Language Model-Based Recommendation · IEEE Trans. Knowl. Data Eng. 2025
Recommender systems
machine unlearning
0.912025
Exact and Efficient Unlearning for Large Language Model-Based Recommendation · IEEE Trans. Knowl. Data Eng. 2025
Privacy and data protection › privacy-enhancing technologies
data deletion
0.912025
Exact and Efficient Unlearning for Large Language Model-Based Recommendation · IEEE Trans. Knowl. Data Eng. 2025
Security and privacy of machine learning
machine unlearning
0.912025
Exact and Efficient Unlearning for Large Language Model-Based Recommendation · IEEE Trans. Knowl. Data Eng. 2025

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

parameter-efficient fine-tuning · 1.7data partitioning · 1.7adapter aggregation · 1.7
YearPublicationVenuePosition
2025 Exact and Efficient Unlearning for Large Language Model-Based Recommendation
abstract
Recent years have witnessed the trend of enhancing recommender systems with large language models (LLMs), namely, LLMRec. A common way is to fine-tune the LLMs with the instruction data transformed from user behaviors, stimulating the recommendation ability of LLMs. Similar to traditional recommender systems, integrating user data into LLMs raises privacy concerns. Users desire a tool to erase the impacts of their sensitive data from the trained models. To meet this user demand, LLMRec unlearning becomes pivotal to enable the removal of unusable data (e.g.historical behaviors) from established LLMRec models. However, existing methods mostly focus on partition strategies and approximate unlearning. These methods are not well-suited for the unique characteristics of LLMRec due to computational costs or incomplete removal. In this study, we propose the Adapter Partition and Aggregation (APA) framework for exact and efficient LLMRec unlearning while maintaining recommendation performance. APA achieves this by retraining PEFT adapters using data partitioning, constructing adapters for partitioned training data shards, and retraining only the affected adapters. To preserve recommendation performance and avoid significant inference costs, APA incorporates balanced and heterogeneous data partitioning, and parameter-level adapter aggregation with sample-adaptive adapter attention for each testing sample. Extensive experiments demonstrate the effectiveness and efficiency of our method.
Zhiyu Hu, Yang Zhang 0072, Minghao Xiao, Wenjie Wang 0007, Fuli Feng, Xiangnan He 0001
IEEE Trans. Knowl. Data Eng.3
2024 MEEG and AT-DGNN: Improving EEG Emotion Recognition with Music Introducing and Graph-based Learning
abstract
We present the MEEG dataset, a multi-modal collection of music-induced electroencephalogram (EEG) recordings designed to capture emotional responses to various musical stimuli across different valence and arousal levels. This public dataset facilitates an in-depth examination of brainwave patterns within musical contexts, providing a robust foundation for studying brain network topology during emotional processing. Leveraging the MEEG dataset, we introduce the Attention-based Temporal Learner with Dynamic Graph Neural Network (AT-DGNN), a novel framework for EEG-based emotion recognition. This model combines an attention mechanism with a dynamic graph neural network (DGNN) to capture intricate EEG dynamics. The AT-DGNN achieves state-of-the-art (SOTA) performance with an accuracy of 83.74% in arousal recognition and 86.01% in valence recognition, outperforming existing SOTA methods. This study advances graph-based learning methodology in brain-computer interfaces (BCI), significantly improving the accuracy of EEG-based emotion recognition. The MEEG dataset and source code are publicly available at https://github.com/xmh1011/AT-DGNN.
Minghao Xiao, Zhengxi Zhu, Kang Xie, Bin Jiang 0011
BIBM1