Author:
Wang Guangyuan,Wang Hua,Tao Xiaohui,Zhang Ji
Reference26 articles.
1. Burke, M., & Kraut, R. (2008). Mopping up: Modeling wikipedia promotion decisions. In Proceedings of 11th CSCW (pp. 27–36).
2. Crandall, D.J., Cosley, D., Huttenlocher, D.P., Kleinberg, J.M., & Suri, S. (2008). Feedback effects between similarity and social influence in online communities. In Proceedings of 14th KDD (pp. 160–168).
3. Domingos, P., & Richardson, M. (2001). Mining the network value of customers. In Proceedings of 7th KDD (pp. 57–66).
4. Eubank, S., Kumar, V., Marathe, M.V., Srinivasan, A., & Wang, N. (2004). Structural and algorithmic aspects of massive social networks. In Proceedings of SODA04 (pp. 718–727).
5. Garey, M.R., & Johnson, D.S. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: W. H. Freeman.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献