20 search results - page 1 / 4 » The union-split algorithm and cluster-based anonymization of... |
CSE
2009
IEEE
13 years 2 months ago
2009
IEEE
Edges in social network graphs can model sensitive relationships. In this paper, we consider the problem of edges anonymity in graphs. We propose a probabilistic notion of edge ano...
CCS
2009
ACM
14 years 5 months ago
2009
ACM
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
WWW
2007
ACM
14 years 5 months ago
2007
ACM
In a social network, nodes correspond to people or other social entities, and edges correspond to social links between them. In an effort to preserve privacy, the practice of anon...
DASFAA
2011
IEEE
13 years 2 months ago
2011
IEEE
\Identity disclosure" problem on publishing social network data has gained intensive focus from academia. Existing k-anonymization algorithms on social network may result in n...
SP
2009
IEEE
13 years 11 months ago
2009
IEEE
Operators of online social networks are increasingly sharing potentially sensitive information about users and their relationships with advertisers, application developers, and da...