Published on Sat Apr 04 2020

Privacy Shadow: Measuring Node Predictability and Privacy Over Time

Ivan Brugere, Tanya y. Berger-Wolf

The structure of network data enables simple predictive models to leverage local correlations between nodes to high accuracy. While this is useful for building better user models, it introduces the privacy concern that a user's data may be re-inferred from the network structure.

0
0
0
Abstract

The structure of network data enables simple predictive models to leverage local correlations between nodes to high accuracy on tasks such as attribute and link prediction. While this is useful for building better user models, it introduces the privacy concern that a user's data may be re-inferred from the network structure, after they leave the application. We propose the privacy shadow for measuring how long a user remains predictive from an arbitrary time within the network. Furthermore, we demonstrate that the length of the privacy shadow can be predicted for individual users in three real-world datasets.

Fri Apr 24 2015
Machine Learning
Handling oversampling in dynamic networks using link prediction
Oversampling can affect the quality of many important algorithmic problems on dynamic networks. We show that we can use link prediction to recover from the effects of oversampling. We also introduce a generative model of noise in dynamic networks that represents oversampled data.
0
0
0
Mon Jul 25 2016
Machine Learning
Evaluating Link Prediction Accuracy on Dynamic Networks with Added and Removed Edges
The task of predicting future relationships in a social network has been studied extensively in the literature. Many link prediction methods have been proposed, ranging from common neighbors to Probabilistic models. In dynamic networks where edges are added and removed over time, the link prediction problem is more complex.
0
0
0
Fri Oct 18 2019
Machine Learning
Temporal Network Sampling
Temporal networks representing a stream of timestamped edges are seemingly ubiquitous in the real-world. The massive size and continuous nature of these networks make them fundamentally challenging to analyze and leverage for descriptive and predictive modeling tasks. We propose a general framework for temporal network sampling with unbiased estimation.
0
0
0
Thu Nov 13 2014
Artificial Intelligence
Scalable Link Prediction in Dynamic Networks via Non-Negative Matrix Factorization
We propose a scalable temporal latent space model for link prediction in dynamic social networks. The goal is to predict links over time based on a sequence of previous graph snapshots. The model assumes that each user lies in an unobserved latent space and interactions are more likely to form between similar users.
0
0
0
Mon Apr 15 2013
Machine Learning
Link Prediction with Social Vector Clocks
State-of-the-art link prediction utilizes combinations of complex features from network panel data. We here show that computationally less expensive features can achieve the same performance in the common scenario in which the data is available as a sequence of interactions.
0
0
0
Wed Mar 05 2014
Machine Learning
Detecting change points in the large-scale structure of evolving networks
Change-point detection is an important task in analyzing evolving networks. This method combines a generalized hierarchical random graph model with aBayesian hypothesis test. The method identifies a sequence of change points that align with known external "shocks" to networks.
0
0
0