De-Anonymizing Social Networks with Random Forest Classifier

IEEE Access

Volumn 6, Issue , 2017, Pages 10139-10150

  Ma, Jiangtao ^a,b   Qiao, Yaqiong ^a   Hu, Guangwu ^c   Huang, Yongzhong ^a   Sangaiah, Arun Kumar ^d   Zhang, Chaoqin ^a   Wang, Yanjun ^a,e   Zhang, Rui ^f  

^a STATE KEY LABORATORY OF MATHEMATICAL ENGINEERING AND ADVANCED COMPUTING   (China)

^b ZHENGZHOU UNIVERSITY OF LIGHT INDUSTRY   (China)

^c SHENZHEN INSTITUTE OF INFORMATION TECHNOLOGY   (China)

^d VIT UNIVERSITY   (India)

^e NORTH CHINA UNIVERSITY OF WATER RESOURCES AND ELECTRIC POWER   (China)

^f NONE

Author keywords

De anonymization; graph partition; network structure; random forest; social network analysis

Indexed keywords

DATA PRIVACY; DECISION TREES; FEATURE EXTRACTION; ROBUSTNESS (CONTROL SYSTEMS); SOCIAL NETWORKING (ONLINE);

ALGORITHM DESIGN AND ANALYSIS; ANONYMIZATION; CLASSIFICATION ALGORITHM; GRAPH PARTITION; NETWORK STRUCTURES; RANDOM FORESTS; SOCIAL NETWORK SERVICES;

DATA MINING;

EID: 85030775994     PISSN: None     EISSN: 21693536     Source Type: Journal    
DOI: 10.1109/ACCESS.2017.2756904     Document Type: Article

References (48)

1. R. B. Shapiro and P. N. Ossorio, "Regulation of online social network studies, " Science, vol. 339, no. 6116, pp. 144-145, Jan. 2013.
2. S. Aral and D. Walker, "Identifying influential and susceptible members of social networks, " Science, vol. 337, no. 6092, pp. 337-341, Jul. 2012.
3. D. Centola, "The spread of behavior in an online social network experiment, " Science, vol. 329, no. 5996, pp. 1194-1197, Sep. 2010.
4. L. Cui, F. R. Yu, and Q. Yan, "When big data meets software-defined networking: SDN for big data and big data for SDN, " IEEE Netw., vol. 30, no. 1, pp. 58-65, Jan./Feb. 2016.
5. L. Cui, L. Sun, X. Fu, N. Lu, and G. Zhang, "Exploring a trust based recommendation approach for videos in online social network, " Signal Process. Syst., vol. 86, nos. 2-3, pp. 207-219, 2017.
6. R. Gross and A. Acquisti, "Information revelation and privacy in online social networks, " in Proc. ACM Workshop Privacy Electron. Soc., 2005, pp. 71-80.
7. T. Jung, X.-Y. Li, and M. Wan, "Collusion-tolerable privacy-preserving sum and product calculation without secure channel, " IEEE Trans. Depend. Sec. Comput., vol. 12, no. 1, pp. 45-57, Jan. 2015.
8. K. Liu and E. Terzi, "Towards identity anonymization on graphs, " in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2008, pp. 93-106.
9. S. Ji, W. Li, M. Srivatsa, and R. Beyah, "Structural data de-anonymization: Quantification, practice, and implications, " in Proc. ACM SIGSAC Conf. Comput. Commun. Secur., 2014, pp. 1040-1053.
10. M. Zabielski, R. Kasprzyk, Z. Tarapata, and K. Szkóka, "Methods of profile cloning detection in online social networks, " in Proc. MATEC Web Conf., vol. 76. 2016, p. 4013.
11. R. Zafarani and H. Liu, "Connecting users across social media sites: A behavioral-modeling approach, " in Proc. 19th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2013, pp. 41-49.
12. A. Malhotra, L. Totti, W. Meira, Jr., P. Kumaraguru, and V. Almeida, "Studying user footprints in different online social networks, " in Proc. IEEE/ACM Int. Conf. Adv. Social Netw. Anal. Mining, Sep. 2012, pp. 1065-1070.
13. S. Tan, Z. Guan, D. Cai, X. Qin, J. Bu, and C. Chen, "Mapping users across networks by manifold alignment on hypergraph, " in Proc. 28th AAAI Conf. Artif. Intell., 2014, pp. 159-165.
14. R. Zafarani and H. Liu, "Connecting corresponding identities across communities, " in Proc. Int. Conf. Weblogs Social Media (ICWSM), San Jose, CA, USA, May 2009, pp. 1-4.
15. D. Perito, C. Castelluccia, M. A. Kaafar, and P. Manils, "How unique and traceable are usernames?" in Proc. 11th Int. Symp. (PETS), Waterloo, ON, Canada, Jul. 2011, pp. 1-17.
16. J. Liu, F. Zhang, X. Song, Y.-I. Song, C.-Y. Lin, and H.-W. Hon, "What's in a name?: An unsupervised approach to link users across communities, " in Proc. 6th ACM Int. Conf. Web Search Data Mining, 2013, pp. 495-504.
17. T. Iofciu, P. Fankhauser, F. Abel, and K. Bischoff, "Identifying users across social tagging systems, " in Proc. Int. Conf. Weblogs Social Media, Barcelona, Spain, Jul. 2010, pp. 1-4.
18. Y. Zhang, J. Tang, Z. Yang, J. Pei, and P. S. Yu, "COSNET: Connecting heterogeneous social networks with local and global consistency, " in Proc. ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2015, pp. 1485-1494.
19. W. Cohen, P. Ravikumar, and S. Fienberg, "A comparison of string metrics for matching names and records, " in Proc. KDD Workshop Data Cleaning Object Consolidation, vol. 3. 2003, pp. 73-78.
20. A. Narayanan and V. Shmatikov, "De-anonymizing social networks, " in Proc. IEEE Secur. Privacy Symp., Jun. 2009, pp. 173-187.
21. E. Kazemi, S. H. Hassani, and M. Grossglauser, "Growing a graph matching from a handful of seeds, " Proc. VLDB Endow., vol. 8, no. 10, pp. 1010-1021, 2015.
22. C. Fabiana, M. Garetto, and E. Leonardi, "De-anonymizing scale-free social networks by percolation graph matching, " in Proc. IEEE Conf. Comput. Commun. (INFOCOM), Sep. 2015, pp. 1571-1579.
23. L. Sweeney, "K-anonymity: Amodel for protecting privacy, " Int. J. Uncer-tainty, Fuzziness Knowl.-Based Syst., vol. 10, no. 5, pp. 557-570, 2002.
24. C.-H. Tai, P. S. Yu, D.-N. Yang, and M.-S. Chen, "Structural diversity for privacy in publishing social networks, " in Proc. SIAM Int. Conf. Data Mining, 2011, pp. 35-46.
25. G. Wang, Q. Liu, F. Li, S. Yang, and J. Wu, "Outsourcing privacypreserving social networks to a cloud, " in Proc. IEEE INFOCOM, Aug. 2013, pp. 2886-2894.
26. D. Proserpio, S. Goldberg, and F. McSherry, "Calibrating data to sensitivity in private data analysis: A platform for differentially-private analysis of weighted datasets, " Proc. VLDB Endow., vol. 7, no. 8, pp. 637-648, 2014.
27. W. Peng, F. Li, X. Zou, and J. Wu, "A two-stage deanonymization attack against anonymized social networks, " IEEE Trans. Comput., vol. 63, no. 2, pp. 290-303, Feb. 2014.
28. N. Korula and S. Lattanzi, "An efficient reconciliation algorithm for social networks, " Proc. VLDB Endow., vol. 7, no. 5, pp. 377-388, 2014.
29. P. Pedarsani, D. R. Figueiredo, and M. Grossglauser, "A Bayesian method for matching two similar graphs without seeds, " in Proc. 51st Annu. Allerton Conf. Commun., Control, Comput. (Allerton), 2013, pp. 1598-1607.
30. J. Qian, X. Y. Li, C. Zhang, and L. Chen, "De-anonymizing social networks and inferring private attributes using knowledge graphs, " in Proc. IEEE INFOCOM 35th Annu. IEEE Int. Conf. Comput. Commun., May 2016, pp. 1-9.
31. M. Hay, G. Miklau, D. Jensen, D. Towsley, and P. Weis, "Resisting structural re-identification in anonymized social networks, " in Proc. VLDB, Aug. 2008, vol. 1. no. 1, pp. 102-114.
32. G. Wondracek, T. Holz, E. Kirda, and C. Kruegel, "A practical attack to de-anonymize social network users, " in Proc. Secur. Privacy, 2010, pp. 223-238.
33. A. Narayanan, E. Shi, and B. I. P. Rubinstein, "Link prediction by de-anonymization: How we won the Kaggle social network challenge, " in Proc. Int. Joint Conf. Neural Netw., 2011, pp. 1825-1834.
34. K. Sharad and G. Danezis, "An automated social graph de-anonymization technique, " in Proc. 13th Workshop Privacy Electron. Soc., 2014, pp. 47-58.
35. T. Opsahl, F. Agneessens, and J. Skvoretz, "Node centrality in weighted networks: Generalizing degree and shortest paths, " Soc. Netw., vol. 32, no. 3, pp. 245-251, 2010.
36. L. C. Freeman, "Centrality in social networks conceptual clarification, " Soc. Netw., vol. 1, no. 3, pp. 215-239, Jan. 1978.
37. D. J. Watts and S. H. Strogatz, "Collective dynamics of 'small-world' networks, " Nature, vol. 393, no. 6684, p. 440, 1998.
38. M. E. J. Newman, "The mathematics of networks, " New Palgrave Encycl. Econ., vol. 2, pp. 1-12, Sep. 2008.
39. A. Buluç, H. Meyerhenke, I. Safro, P. Sanders, and C. Schulz, "Recent advances in graph partitioning, " in Algorithm Engineering, L. Kliemann and P. Sanders, Eds. Cham, Switzerland: Springer, 2016, pp. 117-158.
40. A. Liaw and M. Wiener, "Classification and regression by randomforest, " R News, vol. 2, no. 3, pp. 18-22, 2002.
41. C. Strobl, J. Malley, and G. Tutz, "An introduction to recursive partitioning: Rationale, application and characteristics of Classification and regression trees, bagging and random forests, " Psychol. Methods, vol. 14, no. 4, p. 323, 2009.
42. R. J. Yang and L. Gu, "Experience with approximate reliability-based optimization methods, " Struct. Multidisciplinary Optim., vol. 26, no. 1, pp. 152-159, Jan. 2004.
43. A. Sinha et al., "An overview of Microsoft academic service (MAS) and applications, " in Proc. 24th Int. Conf. WorldWideWeb, 2015, pp. 243-246.
44. H. Zaugg, R. E. West, D. L. Randall, and I. Tateishi, "Mendeley: Creating communities of scholarly inquiry through research collaboration, " TechTrends, vol. 55, no. 1, pp. 32-36, 2011.
45. J. Tang, "AMiner: Toward understanding big scholar data, " in Proc. 9th ACM Int. Conf. Web Search Data Mining, 2016, p. 467.
46. S. Ji, W. Li, M. Srivatsa, J. S. He, and R. Beyah, "Structure based data de-anonymization of social networks and mobility traces, " in Proc. 17th Int. Conf. Inf. Secur. (ISC), Hong Kong, Oct. 2014, pp. 237-254.
47. M. E. J. Newman, "Scientific collaboration networks. I. Network construction and fundamental results, " Phys. Rev. E, Stat. Phys. Plasmas Fluids Relat. Interdiscip. Top., vol. 64, no. 1, p. 16131, 2001.
48. A.-L. Barabási and R. Albert, "Emergence of scaling in random networks, " Science, vol. 286, no. 5439, pp. 509-512, Oct. 1999.