A distributed and privacy preserving algorithm for identifying information hubs in social networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2011, Pages 561-565

  Ilyas, Muhammad U ^a   Shafiq, M Zubair ^a   Liu, Alex X ^a   Radha, Hayder ^a  

^a MICHIGAN STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

23 MILLION; CENTRAL-ENTITY; DATA SETS; DISTRIBUTED METHODS; FACEBOOK; FRIENDSHIP GRAPHS; INFORMATION HUB; INTERACTION GRAPHS; PRIVACY PRESERVING; SOCIAL NETWORKS; USER INTERACTION; USER PRIVACY;

ASSOCIATION REACTIONS; SOCIAL NETWORKING (ONLINE);

ALGORITHMS;

EID: 79960867821     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2011.5935226     Document Type: Conference Paper

References (32)

1. Facebook Advertising, http://www.facebook.com/advertising/, 2010.
2. Facebook Pages, http://www.facebook.com/advertising/?pages, 2010.
3. Statement of rights and responsibilities. http://www.facebook.com/terms. php, 2010.
4. B. Bollobas. Modern graph theory. Springer Verlag, 1998.
5. P. Bonacich. Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2(1):113-120, 1972.
6. P. Bonacich. Technique for analyzing overlapping memberships. Sociological Methodology, 4:176-185, 1972.
7. S. Borgatti. Centrality and network flow. Social Networks, 27(1):55-71, 2005.
8. G. Caldarelli. Scale-Free Networks. Oxford University Press, 2007.
9. R. Duda, P. Hart, and D. Stork. Pattern Classification. Wiley New York, 2nd edition, 2001.
10. P. A. Estevez, P. Vera, and K. Saito. Selecting the most influential nodes in social networks. In proceedings of IJCNN, 2007.
11. D. Geere. Samsung offers free phones to frustrated iPhone users. CNN Tech, http://www.cnn.com/2010/TECH/mobile/07/24/samsung.replacing.iphones/, 2010.
12. J. Goldenberg, S. Han, D. R. Lehmann, and J. W. Hong. The role of hubs in the adoption processes. Journal of Marketing, American Marketing Association, 2008.
13. A. Goyal, F. Bonchi, and L. Lakshmanan. Discovering leaders from community actions. In Proceeding of the 17th ACM conference on Information and knowledge management, pages 499-508. ACM, 2008.
14. M. U. Ilyas and H. Radha. A KLT-inspired node centrality for identifying influential neighborhoods in graphs. In Conference on Information Sciences and Systems, Princeton, NJ, 2010. Princeton University.
15. D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. In proceedings of KDD, 2003.
16. D. Kempe and F. McSherry. A decentralized algorithm for spectral analysis. Journal of Computer and System Sciences, 74(1):70-83, 2008.
17. M. Kimura, K. Saito, and R. Nakano. Extracting influential nodes for information diffusion on a social network. In AAAI, 2007.
18. M. Kimura, K. Saito, R. Nakano, and H. Motoda. Finding influential nodes in a social network from information diffusion data. Springer Social Computing and Behavioral Modeling, 2009.
19. C. Kohlschütter, P. Chirita, and W. Nejdl. Efficient parallel computation of pagerank. Lecture Notes in Computer Science, 3936:241, 2006.
20. C. Lanczos. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Nat. Bur. Standards, 45(4):255-282, 1950.
21. A. Langville, C. Meyer, and P. Fernández. Googles pagerank and beyond: the science of search engine rankings. The Mathematical Intelligencer, 30(1):68-69, 2008.
22. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance. Cost-effective outbreak detection in networks. In proceedings of KDD, 2007.
23. P. Marsden. Egocentric and sociocentric measures of network centrality. Social Networks, 24(4):407-422, 2002.
24. A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and analysis of online social networks. In Proceedings of IMC, San Diego, CA, October 2007.
25. B. Ruhnau. Eigenvector-centrality-a node-centrality? Social networks, 22(4):357-365, 2000.
26. K. Sankaralingam, S. Sethumadhavan, and J. Browne. Distributed pagerank for p2p systems. In 12th IEEE International Symposium on High Performance Distributed Computing, pages 58-68, 2003.
27. R. Shahbaz. how high is your popularity? http://www.facebook.com/apps/ application.php?id=174042725891,2010. 12120 monthly users.
28. X. Shi, M. Bonner, L. Adamic, and A. Gilbert. The very small world of the well-connected. In Proceedings of the nineteenth ACM conference on Hypertext and hypermedia, pages 61-70. ACM, 2008.
29. N. R. Suri and Y. Narahari. Determining the top-k nodes in social networks using the shapley value. In proceedings of AAMAS, 2008.
30. C. Wilson, B. Boe, A. Sala, K. Puttaswamy, and B. Zhao. User interactions in social networks and their implications. In Proceedings of ACM European Conference on Computer Systems, 2009.
31. E. Zheleva and L. Getoor. To join or not to join: The illusion of privacy in social networks with mixed public and private user profiles. In 18th International World Wide Web conference (WWW), 2009.
32. F. Zou, Z. Zhang, and W. Wu. Latency-bounded minimum influential node selection in social networks. In proceedings of WASA, 2009.