| [1] Guha R, Kumar R, Raghavan P, et al. Propagation of trust and distrust[C]//Proceedings of the 13th International Conference on World Wide Web(WWW). USA: ACM Press, 2004: 403-412.[2] Kunegis J, Lommatzsch A, Bauckhage C. The slashdot zoo: mining a social network with negative edges[C]//Proceedings of the 18th International Conference on World Wide Web(WWW). ESP: ACM Press, 2009: 741-750.[3] Liu Haifeng, Lim E P, Lauw H W, et al. Predicting trusts among users of online communities: an epinions case study[C]//Proceedings of the 9th ACM Conference on Electronic Commerce. USA: ACM Press, 2008: 310-319.[4] Leskovec J, Huttenlocher D, Kleinberg J. Predicting positive and negative links in online social networks[C]//Proceedings of the 19th International Conference on World Wide Web(WWW). USA: ACM Press, 2010: 641-650.[5] Chiang K Y, Natarajan N, Tewari A, et al. Exploiting longer cycles for link prediction in signed networks[C]//Proceedings of the 20th ACM International Conference on Information and Knowledge Management(CIKM). USA: ACM Press, 2011: 1157-1162.[6] De Kerchove C, Van Dooren P. The PageTrust algorithm: how to rank web pages when negative links are allowed[C]//SIAM International Conference on Data Mining(SDM). USA: ACM Press, 2008: 346-352.[7] Chang Chihchung, Lin Chihjen. LIBSVM: a library for support vector machines[J]. ACM Transactions on Intelligent Systems and Technology, 2011, 2: 1-27. |
