Shixin Wan

dblp:394/4899 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 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 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.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%
Databases, data mining, and information retrieval
1 paper
Machine learning and data management · 100%
Network and information security
1 paper
Privacy and data protection · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning and data management › data valuation
shapley value
0.912025
A Comprehensive Study of Shapley Value in Data Analytics · Proc. VLDB Endow. 2025
Algorithmic game theory and mechanism design
cooperative game theory
0.912025
A Comprehensive Study of Shapley Value in Data Analytics · Proc. VLDB Endow. 2025
Algorithmic game theory and mechanism design › cooperative game theory › solution concepts
shapley value
0.912025
A Comprehensive Study of Shapley Value in Data Analytics · Proc. VLDB Endow. 2025
Privacy and data protection
privacy-preserving data analysis
0.312025
A Comprehensive Study of Shapley Value in Data Analytics · Proc. VLDB Endow. 2025

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

approximation algorithm · 2.6
YearPublicationVenuePosition
2025 A Comprehensive Study of Shapley Value in Data Analytics
abstract
Over the recent years, Shapley value (SV), a solution concept from cooperative game theory, has found numerous applications in data analytics (DA). This paper presents the first comprehensive study of SV used throughout the DA workflow, clarifying the key variables in defining DA-applicable SV and the essential functionalities that SV can provide for data scientists. We condense four primary challenges of using SV in DA, namely computation efficiency, approximation error, privacy preservation, and interpretability, disentangle the resolution techniques from existing arts in this field, then analyze and discuss the techniques w.r.t. each challenge and the potential conflicts between challenges. We also implement SVBench , a modular and extensible open-source framework for developing SV applications in different DA tasks, and conduct extensive evaluations to validate our analyses and discussions. Based on the qualitative and quantitative results, we identify the limitations of current efforts for applying SV to DA and highlight the directions of future research and engineering.
Shixin Wan, Zhongle Xie, Ke Chen 0005, Meihui Zhang 0001, Lidan Shou, Gang Chen 0001
Proc. VLDB Endow.2