Introduces a unified framework with full, partial and budgeted anonymization variants plus four heuristics that outperform baselines by retaining more edges and producing more anonymous nodes.
arXiv preprint arXiv:2011.07190 (2020)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.SI 2verdicts
UNVERDICTED 2representative citing papers
Empirical tests on three real networks show Shapley-value node selection for coverage under reachability rules reaches ~0.9 approximation ratio and beats degree baseline, with one case covering half of Cora using 26 nodes.
citing papers explorer
-
The anonymization problem in social networks
Introduces a unified framework with full, partial and budgeted anonymization variants plus four heuristics that outperform baselines by retaining more edges and producing more anonymous nodes.
-
Sphere of Influence Centrality via Shapley Values: Empirical Approximation and Network Coverage Analysis
Empirical tests on three real networks show Shapley-value node selection for coverage under reachability rules reaches ~0.9 approximation ratio and beats degree baseline, with one case covering half of Cora using 26 nodes.