Pith. sign in

REVIEW

Unlearnable Graph: Protecting Graphs from Unauthorized Exploitation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2303.02568 v1 pith:HQYBEPLI submitted 2023-03-05 cs.LG cs.AIcs.CR

classification cs.LGcs.AIcs.CR
keywords graphdatagraphsexploitationmethodpotentialunauthorizedunlearnable
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

While the use of graph-structured data in various fields is becoming increasingly popular, it also raises concerns about the potential unauthorized exploitation of personal data for training commercial graph neural network (GNN) models, which can compromise privacy. To address this issue, we propose a novel method for generating unlearnable graph examples. By injecting delusive but imperceptible noise into graphs using our Error-Minimizing Structural Poisoning (EMinS) module, we are able to make the graphs unexploitable. Notably, by modifying only $5\%$ at most of the potential edges in the graph data, our method successfully decreases the accuracy from ${77.33\%}$ to ${42.47\%}$ on the COLLAB dataset.

Discussion (0). Continue with ORCID to comment.

Pith tools