Name
Abstract | ||
|---|---|---|
With the increasing popularity of online social networks, such as twitter and weibo, privacy preserving publishing of social network data has raised serious concerns. Previous works only consider a single static release of social network data, which are not inadequate for analyzing the evolution of social networks. In this paper, we focus on the problem of preserving edges when edges are deleted or added in multiple releases of social network data. To achieve this objective, we propose the Dynamic Safety Condition, which effectively constrains nodes partition to ensure sparsity of edges between any two group. Using this condition, we devise the heuristic algorithm DEP, which anonymizes a sequential graphs to satisfy the privacy objective. Finally, we verify the effectiveness of the algorithm through experiments. |
Year | Venue | Keywords |
|---|---|---|
2014 | WEB-AGE INFORMATION MANAGEMENT, WAIM 2014 | social network, privacy preserving, data publishing, edges protection |
Field | DocType | Volume |
Data mining,Graph,Social network,Computer science,Heuristic (computer science),Popularity,Data publishing,Publishing | Conference | 8485 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liangwen Yu | 1 | 7 | 3.49 |
| Yonggang Wang | 2 | 13 | 4.04 |
| Zhengang Wu | 3 | 1 | 3.06 |
| Jiawei Zhu | 4 | 16 | 7.17 |
| Jianbin Hu | 5 | 179 | 22.43 |
| Zhong Chen | 6 | 503 | 58.35 |