Abstract
Link prediction has attracted a lot of attention in recent years. While most researchers try to find effective prediction methods, they ignore using the key users for friendship expansion. In this paper, we study the important factors that affect people’s decision for building friendship, and quantify the relationship strength between users and their friends, based on which we build an overall hierarchical network. From the network, features are extracted to measure the closeness and difference between users, which are employed in supervised learning with classical classifiers for link prediction. Experimental results show that our proposed method substantially outperforms existing unsupervised link prediction methods in terms of AUROC (area under roc curve).
Chapter PDF
References
Fire, M., Katz, G., Rokach, L., Elovici, Y.: Links reconstruction attack. Springer, New York (2013)
Krebs, V.: Mapping networks of terrorist cells. Connections 24(3), 43–52 (2002)
Liben-Nowell, D., Kleinberg, J.M.: The link prediction problem for social networks. In: CIKM, pp. 556–559 (2003)
Feng, X., Zhao, J., Xu, K.: Link prediction in complex networks: a clustering perspective. The European Physical Journal B 85(1), 1–9 (2012)
Zhao, J., Feng, X., Dong, L., Liang, X., Xu, K.: Performance of local information-based link prediction: a sampling perspective. Journal of Physics A: Mathematical and Theoretical 45(34), 345001 (2012)
Lichtenwalter, R.N., Lussier, J.T., Chawla, N.V.: New perspectives and methods in link prediction. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2010, pp. 243–252. ACM, New York (2010)
Hopcroft, J.E., Lou, T., Tang, J.: Who will follow you back?: reciprocal relationship prediction. In: Macdonald, C., Ounis, I., Ruthven, I. (eds.) CIKM, pp. 1137–1146. ACM (2011)
Yan, B., Gregory, S.: Finding missing edges in networks based on their community structure. CoRR, vol. abs/1109.2793 (2011)
Xiang, R., Neville, J., Rogati, M.: Modeling relationship strength in online social networks. In: Rappa, M., Jones, P., Freire, J., Chakrabarti, S. (eds.) WWW, pp. 981–990. ACM (2010)
Panigrahy, R., Najork, M., Xie, Y.: How user behavior is related to social affinity. In: Adar, E., Teevan, J., Agichtein, E., Maarek, Y. (eds.) WSDM, pp. 713–722. ACM (2012)
Ball, B., Newman, M.E.J.: Friendship networks and social status. CoRR, vol. abs/1205.6822 (2012)
Backstrom, L., Leskovec, J.: Supervised random walks: predicting and recommending links in social networks. In: Proceedings of the Fourth ACM International Conference on Web Search and Data Mining, WSDM 2011, pp. 635–644. ACM, New York (2011)
Liu, Z., Zhang, Q.-M., Lü, L., Zhou, T.: Link prediction in complex networks: a local naïve bayes model. CoRR, vol. abs/1105.4005 (2011)
Lü, L., Zhou, T.: Link prediction in weighted networks: The role of weak ties. EPL (Europhysics Letters) 89, 18001 (2010)
Adamic, L.A., Adar, E.: Friends and neighbors on the web. Social Networks 25, 211–230(20) (2003)
Zhou, T., Lü, L., Zhang, Y.: Predicting missing links via local information. The European Physical Journal B-Condensed Matter and Complex Systems 71(4), 623–630 (2009)
Murata, T., Moriyasu, S.: Link prediction of social networks based on weighted proximity measures. In: Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence, WI 2007, pp. 85–88. IEEE Computer Society, Washington, DC (2007)
Mea, V.D., Mizzaro, S.: Measuring retrieval effectiveness. A new proposal and a first experimental validation (2004)
Liu, W., Lü, L.: Link prediction based on local random walk. EPL (Europhysics Letters) 89, 58007 (2010)
Yan, L., Dodier, R.H., Mozer, M., Wolniewicz, R.H.: Optimizing classifier performance via an approximation to the wilcoxon-mann-whitney statistic. In: Fawcett, T., Mishra, N. (eds.) ICML, pp. 848–855. AAAI Press (2003)
Dai, Y.-H.: Convergence properties of the bfgs algoritm. SIAM Journal on Optimization 13(3), 693–701 (2002)
Rḱping, S.: Incremental learning with support vector machines. In: Cercone, N., Lin, T.Y., Wu, X. (eds.) ICDM, pp. 641–642. IEEE Computer Society (2001)
Gupte, M., Shankar, P., Li, J., Muthukrishnan, S., Iftode, L.: Finding hierarchy in directed online social networks. In: Srinivasan, S., Ramamritham, K., Kumar, A., Ravindra, M.P., Bertino, E., Kumar, R. (eds.) WWW, pp. 557–566. ACM (2011)
Traud, A.L., Kelsic, E.D., Mucha, P.J., Porter, M.A.: Comparing community structure to characteristics in online collegiate social networks. SIAM Review 53(3), 526–543 (2011)
Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, KDD 2005, pp. 177–187. ACM, New York (2005)
Lancichinetti, A., Radicchi, F., Ramasco, J.J., Fortunato, S.: Finding statistically significant communities in networks. PLoS ONE 6, e18961 (2011)
Witten, I., Frank, E., Hall, M.: Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kaufmann (2011)
Katz, L.: A new status index derived from sociometric analysis. Psychometrika 18, 39–43 (1953)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, N., Feng, X., Ji, S., Xu, K. (2013). Modeling Relationship Strength for Link Prediction. In: Wang, G.A., Zheng, X., Chau, M., Chen, H. (eds) Intelligence and Security Informatics. PAISI 2013. Lecture Notes in Computer Science, vol 8039. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39693-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-39693-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39692-2
Online ISBN: 978-3-642-39693-9
eBook Packages: Computer ScienceComputer Science (R0)