Skip to content
Snippets Groups Projects
Commit 41b67b3b authored by aurelien.bellet's avatar aurelien.bellet
Browse files

cosmit

parent e1189631
No related branches found
No related tags found
No related merge requests found
......@@ -224,8 +224,8 @@ until the topology stabilizes.
\begin{remark}[Privacy]
Constructing cliques with Greedy-Swap only requires nodes to reveal their
local label proportions (i.e., a histogram with $L$ bins), which is aggregated
information. In rare
local label proportions (i.e., a histogram with $L$ bins), which is compact
aggregated information. In rare
use-cases where this information may be considered sensitive, techniques
from differential privacy \cite{dwork2013Algorithmic} can be readily used to
control the amount of leakage about the local dataset by adding
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment