A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1901.06629v2.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
A Submodularity-based Agglomerative Clustering Algorithm for the Privacy Funnel
[article]
<span title="2019-02-12">2019</span>
<i >
arXiv
</i>
<span class="release-stage" >pre-print</span>
Preserved Fulltext
Other Versions
<span title="2019-01-20">2019</span>
<span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1901.06629v1">arXiv:1901.06629v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ahqo2o7qbbbm3d5g65q4ur5j7q">fatcat:ahqo2o7qbbbm3d5g65q4ur5j7q</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1901.06629v1">arXiv:1901.06629v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ahqo2o7qbbbm3d5g65q4ur5j7q">fatcat:ahqo2o7qbbbm3d5g65q4ur5j7q</a> </span>
For the privacy funnel (PF) problem, we propose an efficient iterative agglomerative clustering algorithm based on the minimization of the difference of submodular functions (IAC-MDSF). For a data curator that wants to share the data X correlated with the sensitive information S, the PF problem is to generate the sanitized data X̂ that maintains a specified utility/fidelity threshold on I(X; X̂) while minimizing the privacy leakage I(S; X̂). Our IAC-MDSF algorithm starts with the original
<span class="external-identifiers">
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1901.06629v2">arXiv:1901.06629v2</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/r355dwp75bfz5mrmd7ofn7rlmq">fatcat:r355dwp75bfz5mrmd7ofn7rlmq</a>
</span>
more »
... et X̂ := X and iteratively merges the elements in the current alphabet X̂ that minimizes the Lagrangian function I(S;X̂) - λ I(X;X̂) . We prove that the best merge in each iteration of IAC-MDSF can be searched efficiently over all subsets of X̂ by the existing MDSF algorithms. We show that the IAC-MDSF algorithm also applies to the information bottleneck (IB), a dual problem to PF. By varying the value of the Lagrangian multiplier λ, we obtain the experimental results on a heart disease data set in terms of the Pareto frontier: I(S;X̂) vs. - I(X;X̂). We show that our IAC-MDSF algorithm outperforms the existing iterative pairwise merge approaches for both PF and IB and is computationally much less complex.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191025164114/https://arxiv.org/pdf/1901.06629v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/87/97/879714f9530523a29cab395368aac0445d8f4d75.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1901.06629v2" title="arxiv.org access">
<button class="ui compact blue labeled icon button serp-button">
<i class="file alternate outline icon"></i>
arxiv.org
</button>
</a>