Differentially private data analysis of social networks via restricted sensitivity
From MaRDI portal
Publication:2986861
DOI10.1145/2422436.2422449zbMath1361.68078arXiv1208.4586OpenAlexW2080900058MaRDI QIDQ2986861
Anupam Datta, Jeremiah Blocki, Or Sheffet, Avrim L. Blum
Publication date: 16 May 2017
Published in: Proceedings of the 4th conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.4586
Social networks; opinion dynamics (91D30) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (4)
Some basics on privacy techniques, anonymization and their big data challenges ⋮ Differentially private response mechanisms on categorical data ⋮ Differential privacy protection scheme based on community density aggregation and matrix perturbation ⋮ The Complexity of Differential Privacy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Teachability in computational learning
- Measuring teachability using variants of the teaching dimension
- Teaching a smarter learner.
- Occam's razor
- Pseudorandom generators for space-bounded computation
- On the power of inductive inference from good examples
- A model of interactive teaching
- Learning from different teachers
- On the limits of efficient teachability
- In search of an easy witness: Exponential time vs. probabilistic polynomial time.
- On the complexity of teaching
- On specifying Boolean functions by labelled examples
- Recent Developments in Algorithmic Teaching
- A theory of the learnable
- Teaching Randomized Learners
- Algorithmic Learning Theory
- A theory of goal-oriented communication
- Derandomizing polynomial identity tests means proving circuit lower bounds
This page was built for publication: Differentially private data analysis of social networks via restricted sensitivity
