On the efficiency of social recommender networks

Proceedings - IEEE INFOCOM

Volumn 26, Issue , 2015, Pages 2317-2325

  Wong, Felix Ming Fai ^a   Liu, Zhenming ^a   Chiang, Mung ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); INFORMATION DISSEMINATION; SOCIAL NETWORKING (ONLINE); STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

FRIEND RECOMMENDATIONS; INDIVIDUAL LEVELS; INFORMATION PROPAGATION; MACROSCOPIC LEVELS; NETWORK EFFICIENCY; SERVICE PROVIDER; SOCIAL RECOMMENDER SYSTEMS; USER EXPERIENCE;

EFFICIENCY;

EID: 84954210060     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2015.7218619     Document Type: Conference Paper

References (30)

1. D. Kempe, J. M. Kleinberg, and E. Tardos, "Maximizing the spread of influence through a social network, " in KDD, 2003.
2. W. Chen, A. Collins, R. Cummings, T. Ke, Z. Liu, D. Rincon, X. Sun, Y. Wang, W. Wei, and Y. Yuan, "Influence maximization in social networks when negative opinions may emerge and propagate, " in SDM, 2011.
3. M. Granovetter, "The strength of weak ties: A network theory revisited, " Sociological Theory, vol. 1, 1982.
4. F. E. Walter, S. Battiston, and F. Schweitzer, "A model of a trust-based recommendation system on a social network, " Autonomous Agents and Multi-Agent Systems, vol. 16, no. 1, 2008.
5. F. M. F. Wong and P. Marbach, "'Who are your friends-A simple mechanism that achieves perfect network formation, " in INFOCOM, 2011.
6. Y. Koren, R. Bell, and C. Volinsky, "Matrix factorization techniques for recommender systems, " IEEE Computer, vol. 42, no. 8, 2009.
7. X. Su and T. M. Khoshgoftaar, "A survey of collaborative filtering techniques, " Advances in Artificial Intelligence, 2009.
8. S. Boyd, P. Diaconis, and L. Xiao, "Fastest mixing markov chain on a graph, " SIAM Review, vol. 46, no. 4, 2004.
9. A. Ghosh, S. Boyd, and A. Saberi, "Minimizing effective resistance of a graph, " SIAM Review, vol. 50, no. 1, 2008.
10. F. Chierichetti, S. Lattanzi, and A. Panconesi, "Almost tight bounds for rumour spreading with conductance, " in STOC, 2010.
11. M. Abdullah, C. Cooper, and M. Draief, "Viral processes by random walks on random regular graphs, " in APPROX-RANDOM, 2011.
12. H. Lam, Z. Liu, M. Mitzenmacher, X. Sun, and Y. Wang, "Information dissemination via random walks in d-dimensional space. " in SODA, 2012.
13. A. Clementi, R. Silvestri, and L. Trevisan, "Information spreading in dynamic graphs, " in PODC, 2012.
14. D. A. Levin, Y. Peres, and E. L. Wilmer, Markov Chains and Mixing Times. American Mathematical Society, 2008.
15. A. Mohaisen, A. Yun, and Y. Kim, "Measuring the mixing time of social graphs, " in IMC, 2010.
16. B. Bollobás, Random graphs. Academic Press, 1985.
17. F. Viger and M. Latapy, "Fast generation of random connected graphs with prescribed degrees, " in COCOON, 2005.
18. J. Kleinberg, "The small-world phenomenon: An algorithmic perspective, " in STOC, 2000.
19. O. E. Livne and A. Brandt, "Lean algebraic multigrid (LAMG): Fast graph laplacian linear solver, " SIAM Journal on Scientific Computing, vol. 34, no. 4, 2012.
20. I. Gurobi Optimization, "Gurobi optimizer reference manual, " 2014. [Online]. Available: http: //www. gurobi. com
21. W. Ellens, F. Spieksma, P. Van Mieghem, A. Jamakovic, and R. Kooij, "Effective graph resistance, " Linear Algebra and its Applications, vol. 435, no. 10, 2011.
22. A. Tizghadam and A. Leon-Garcia, "Autonomic traffic engineering for network robustness, " IEEE Journal on Selected Areas in Communica-tions, vol. 28, no. 1, 2010.
23. G. Ranjan and Z.-L. Zhang, "Geometry of complex networks and topological centrality, " Physica A: Statistical Mechanics and its Applications, vol. 392, no. 17, 2013.
24. D. Wang, H. Park, G. Xie, S. Moon, M.-A. Kaafar, and K. Salamatian, "A genealogy of information spreading on microblogs: A Galton-Watson-based explicative model, " in INFOCOM, 2013.
25. P. Mittal, C. Papamanthou, and D. Song, "Preserving link privacy in social network based systems, " in NDSS, 2013.
26. R. B. Zadeh, A. Goel, K. Munagala, and A. Sharma, "On the precision of social and information networks, " in COSN, 2013.
27. A. May, A. Chaintreau, N. Korula, and S. Lattanzi, "Filter & follow: How social media foster content curation, " in SIGMETRICS, 2014.
28. H. Ma, "On measuring social friend interest similarities in recommender systems, " in SIGIR, 2014.
29. C. Gkantsidis, G. Goel, M. Mihail, and A. Saberi, "Towards topology aware networks, " in INFOCOM, 2007.
30. J. K. Johnson and M. Chertkov, "A majorization-minimization approach to design of power transmission networks, " in CDC, 2010.