Skip to content
Book Open access

LTSV: Layered Type-Constrained Shapley Value for Heterogeneous Graph Data Valuation

Aug 2026 · Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2 · pp. 4636-4646 · 0 citations · 32 references

Abstract

Data valuation is essential for quantifying data worth in machine learning, especially in multi-party collaborations where incentives rely on fair contribution attribution. Although Shapley-value-based methods are effective for I.I.D. data, extending them to heterogeneous graphs remains challenging due to type-dependent node roles, cross-type dependencies, and prohibitive valuation costs. In this paper, we propose LTSV (Layered Type-Constrained Shapley Value, a framework that decomposes each node's value into three components: intra-type feature contribution, cross-type semantic bridging, and global structural support. Specifically, LTSV anchors the valuation in type-constrained subgames to ensure axiomatic fairness for within-type contributions while preserving the heterogeneous context. It further introduces meta-path-based value propagation to make the implicit contribution of unlabeled bridge nodes explicit and quantifiable. To scale valuation, we develop type-constrained Monte Carlo sampling with importance weighting. Experiments on DBLP, ACM, and IMDb show that LTSV more accurately identifies high-value nodes than state-of-the-art baselines under standard deletion/addition evaluations, while achieving favorable computational efficiency.

Read PDF

Similar papers

#machine learning Preprint Sep 2026

Shapley Value Estimation for Multi-Site Data with Blockwise-Missing Features

FUSHAP is proposed, a method that leverages partially-observed auxiliary sites to reduce the variance of a preliminary single-site Shapley estimate without imputation and reduces MSE on multi-site air quality and multi-center clinical data.

Siqi Li, Wang-Xuan Fan, Yi-Ming Li et al. · 0 citations
#artificial intelligence Preprint Oct 2026

Aggregating User Preferences while Ensuring Equity, Diversity, and Inclusion using Graph Summarization

Aggregating the preferences of diverse user groups into a collective outcome raises fundamental challenges of equity, diversity, and inclusion (EDI): classical aggregation rules such as Borda and Condorcet have no mechanism to prevent results from systematically favoring majority groups, collapsing onto homogeneous ite...

Adji Marieme Sita Cissé, Malek Mouhoub · 0 citations
Open access 2026

Hodge-Guided Active Preference Elicitation for Efficient Pairwise Ranking

Pairwise comparison is a standard method for eliciting user preferences in recommender systems and group decision-making. The number of required comparisons grows quadratically with the number of alternatives, creating a substantial burden for users and platforms. This paper asks whether Hodge decomposition, which spli...

Eskander Bejaoui, M. O. Aoueileyine, R. Bouallègue · 0 citations
#machine learning Preprint Oct 2026

Interval-valued SHAP in Tree-Based Models

This paper proposes an imprecise Dirichlet model (IDM) based method to analyze the robustness of Shapley values in decision trees and random forests and shows that the proposed method can be straightforwardly generalized to the case of Banzhaf values.

Chen-Rui Zhu, Vu-Linh Nguyen, M. Masson et al. · 0 citations
Preprint Sep 2026

Semiparametric Inference for Conditional Shapley Feature Importance

A one-step estimator with K-fold cross-fitting and a U-statistic correction of the squared loss that removes the Monte Carlo bias of the naive plug-in is proposed, which is $\sqrt{n}$-consistent and asymptotically normal under double-robust rate conditions, and the resulting Wald interval attains nominal coverage.

Agostino Gnasso · 0 citations
Open access Aug 2026

Efficient Game-Theoretic Explanations for Tree-Based Ensembles via Owen Values

Shapley-value-based explanations, notably SHAP (SHapley Additive exPlanations), have gained prominence as a principled game-theoretic framework for local explanations and global feature importance. While exact Shapley value computation is exponential in feature count, TreeExplainer exploits the recursive structure of d...

Hyunwook Koh · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.