A Novel Scheme for Recommendation Unlearning Verification (RUV) Using Non-Influential Trigger Data

Machine unlearning has garnered widespread attention, due to various reasons, including privacy-preserving, model usability, and legal regulations. It requires model providers to unlearning users' data from models upon receiving unlearning request. Recommendation systems have also been extensively researched in the field of deep learning, particularly within the context of big data environments. However, little research can be found to verify the effectiveness of unlearning approach using pure tabular data-based recommendation scenario. In this paper, we propose a recommendation unlearning verification (RUV) scheme based on non-influential trigger data, which fills this gap. Users can use the recommendation rate for selected target items to determine whether the recommendation system complies with unlearning requests. Evaluation results on real datasets confirm the efficiency and effectiveness of our proposed RUV scheme.

Authors

Institutions

Publication Details

Published
2025-01-10
DOI
https://doi.org/10.1109/ccnc54725.2025.10976014
Primary Topic
Face and Expression Recognition
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Novel Scheme for Recommendation Unlearning Verification (RUV) Using Non-Influential Trigger Data

Manoranjan Mohanty, Haiyu Deng, Heng Xu, Priyadarsi Nanda et al.
Face and Expression Recognition
article

A Novel Scheme for Recommendation Unlearning Verification (RUV) Using Non-Influential Trigger Data

Manoranjan Mohanty, Haiyu Deng, Heng Xu, Priyadarsi Nanda, Xiaocui Dang
article en

Abstract

Machine unlearning has garnered widespread attention, due to various reasons, including privacy-preserving, model usability, and legal regulations. It requires model providers to unlearning users' data from models upon receiving unlearning request. Recommendation systems have also been extensively researched in the field of deep learning, particularly within the context of big data environments. However, little research can be found to verify the effectiveness of unlearning approach using pure tabular data-based recommendation scenario. In this paper, we propose a recommendation unlearning verification (RUV) scheme based on non-influential trigger data, which fills this gap. Users can use the recommendation rate for selected target items to determine whether the recommendation system complies with unlearning requests. Evaluation results on real datasets confirm the efficiency and effectiveness of our proposed RUV scheme.

University of Technology Sydney (AU), Carnegie Mellon University Qatar (QA)
Openalex Percentile: Top 92%
Face and Expression Recognition
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.