[1] |
韩毅, 方滨兴, 贾焰 ,等. 基于密度估计的社会网络特征簇挖掘方法[J]. 通信学报, 2012,33(5): 38-48. HAN Y , FANG B X , JIA Y ,et al. Mining characteristic clusters:a density estimation approach[J]. Journal on Communications, 2012,33(5): 38-48.
|
[2] |
WU X , YING X , LIU K . A survey of privacy-preservation of graphs and social networks[M]. Managing and mining graph data. Springer US, 2010: 421-453.
|
[3] |
CASAS-ROMA J , HERRERA-JOANCOMARTí J , TORRA V . Anonymizing graphs:measuring quality for clustering[J]. Knowledge&Information Systems, 2015,44(3): 1-22.
|
[4] |
BHAGAT S , CORMODE G , KRISHNAMURTHY B . Class based graph anaonymization for social network data[C]// 35th International Conference on Very Large Data Base. 2009: 766-777.
|
[5] |
WANG R , ZHANG M , FENG D ,et al. A clustering approach for privacy-preserving in social networks[C]// Information Security and Cryptology-ICISC 2014. Springer International Publishing, 2014: 193-204.
|
[6] |
JING Y , GOSSWEILER III R C . Using visualization techniques for adjustment of privacy settings in social networks[P]. US8832567, 2014.
|
[7] |
AGGARWAL C C , LI Y , YU P S . On the anonymizability of graphs[J]. Knowledge&Information Systems, 2015,45(3): 571-588.
|
[8] |
兰丽辉, 鞠时光 . 基于差分隐私的权重社会网络隐私保护[J]. 通信学报, 2015,36(9): 145-159. LAN L H , JU S G . Privacy preserving based on differential privacy for weighted social networks[J]. Journal on Communications, 2015,36(9): 145-159.
|
[9] |
KARWA V , SLAVKOVIC A B , KRIVITSKY P N . Differentially private exponential random graphs[C]// Privacy in Statistical Database-UNESCO Chair in Data Privacy,International Conference,PSD 2014. Ibiza,Spain, 2014: 143-155.
|
[10] |
SALA A , ZHAO X , WILSON C . Sharing graphs using differentially private graph models[C]// The 2011 ACM SIGCOMM Conference on Internet Measurement,ACM, 2011: 81-98.
|
[11] |
MEDFORTH N , WANG K . Privacy risk in graph stream publishing for social network data[C]// The 2011 IEEE 11th International Conference on Data Mining. 2011: 437-446.
|
[12] |
ROSSI L , MUSOLESI M , TORSELLO A . On the k-anonymization of time-varying and multi-layer social graphs[J]. arXiv preprint arXiv:1503.06497, 2015.
|
[13] |
ZHOU B , PEI J . The k-anonymity and l-diversity approaches for privacy preservation in social networks against neighborhood attacks[J]. Knowledge and Information Systems, 2011,28(1): 47-77.
|
[14] |
LIU C G , LIU I H , YAO W S ,et al. K-anonymity against neighborhood attacks in weighted social networks[J]. Security &Communication Networks, 2015,18(8): 3864-3882.
|
[15] |
LIU K , TERZI E . Towards identity anonymization on graphs[C]// The 2008 ACM SIGMOD International Conference on Management of Data. ACM, 2008: 93-106.
|
[16] |
CHENG J , FU A W , LIU J . K-isomorphism:privacy preserving network publication against structural attacks[C]// The 2010 ACM SIGMOD International Conference on Management of Data. ACM, 2010: 459-470.
|
[17] |
MICHEAL H , GEROME M , DAVID J . Resisting structural re-identification in anonymized social networks[J]. Proceedings of the VLDB Endowment, 2008,1(1): 102-114.
|
[18] |
FUNG B C M , JIN Y , LI J ,et al. Anonymizing social network data for maximal frequent-sharing pattern mining[M]. Recommendation and Search in Social Networks. Springer International Publishing, 2015: 77-100.
|
[19] |
SWEENEY L . k-anonymity:a model for protecting privacy[J]. International Journal of Uncertainty,Fuzziness and Knowledge-Based Systems, 2002,10(05): 557-570.
|
[20] |
BYUN J W , KAMRA A , BERTINO E ,et al. Efficient k-anonymization using clustering techniques[C]// Dasfaa. Springer Berlin Heidelberg, 2007: 188-200.
|
[21] |
HAN J , KAMBER M . Data mining:comcepts and techniques[J]. San Francisco, 2006,29(1): 1-25.
|