13,684 research outputs found
Online Privacy as a Collective Phenomenon
The problem of online privacy is often reduced to individual decisions to
hide or reveal personal information in online social networks (OSNs). However,
with the increasing use of OSNs, it becomes more important to understand the
role of the social network in disclosing personal information that a user has
not revealed voluntarily: How much of our private information do our friends
disclose about us, and how much of our privacy is lost simply because of online
social interaction? Without strong technical effort, an OSN may be able to
exploit the assortativity of human private features, this way constructing
shadow profiles with information that users chose not to share. Furthermore,
because many users share their phone and email contact lists, this allows an
OSN to create full shadow profiles for people who do not even have an account
for this OSN.
We empirically test the feasibility of constructing shadow profiles of sexual
orientation for users and non-users, using data from more than 3 Million
accounts of a single OSN. We quantify a lower bound for the predictive power
derived from the social network of a user, to demonstrate how the
predictability of sexual orientation increases with the size of this network
and the tendency to share personal information. This allows us to define a
privacy leak factor that links individual privacy loss with the decision of
other individuals to disclose information. Our statistical analysis reveals
that some individuals are at a higher risk of privacy loss, as prediction
accuracy increases for users with a larger and more homogeneous first- and
second-order neighborhood of their social network. While we do not provide
evidence that shadow profiles exist at all, our results show that disclosing of
private information is not restricted to an individual choice, but becomes a
collective decision that has implications for policy and privacy regulation
Latent Self-Exciting Point Process Model for Spatial-Temporal Networks
We propose a latent self-exciting point process model that describes
geographically distributed interactions between pairs of entities. In contrast
to most existing approaches that assume fully observable interactions, here we
consider a scenario where certain interaction events lack information about
participants. Instead, this information needs to be inferred from the available
observations. We develop an efficient approximate algorithm based on
variational expectation-maximization to infer unknown participants in an event
given the location and the time of the event. We validate the model on
synthetic as well as real-world data, and obtain very promising results on the
identity-inference task. We also use our model to predict the timing and
participants of future events, and demonstrate that it compares favorably with
baseline approaches.Comment: 20 pages, 6 figures (v3); 11 pages, 6 figures (v2); previous version
appeared in the 9th Bayesian Modeling Applications Workshop, UAI'1
- …