Keskeiset käsitteet
The author proposes a novel k-stars LDP algorithm for (p, q)-clique enumeration with improved utility and privacy protection.
Tiivistelmä
The K-stars LDP algorithm introduces a new approach to protect user privacy while counting subgraphs. It outperforms traditional edge LDP algorithms by reducing noise and improving accuracy. The theoretical analysis and experiments demonstrate the effectiveness of the k-stars LDP algorithm in various datasets.
Tilastot
The Gplus dataset has 107,614 nodes and 12,238,285 edges.
The IMDB dataset has 896,308 nodes and 57,064,385 edges.
The GitHub dataset has 177,386 nodes and 440,237 edges.
The Facebook dataset has 63,732 nodes and 1,545,686 edges.
Lainaukset
"Our proposed k-stars LDP algorithm has a better utility than traditional edge LDP algorithm."
"The K-stars LDP algorithm utilizes the structure information within (p, q)-cliques to reduce noise and improve performance."