Abstract
The popularity of social network services has caused the rapid growth of the users. To predict the links between users has been recognized as one of the key tasks in social network analysis. Most of the present link prediction methods either analyze the topology structure of social network graph or just concern the user’s interests. These will lead to the low accuracy of prediction. Furthermore, the large amount of user interest information increases the difficulties for common interest extraction. In order to solve the above problems, this paper proposes a joint social network link prediction method-JLPM. Firstly, we give the problem formulation. Secondly, we define a joint prediction feature model(JPFM) to describe user interest topic feature and network topology structure feature synthetically, and present corresponding feature extracting algorithm. JPFM uses the LDA topic model to extract user interest topics and uses a random walk algorithm to extract the network topology features. Thirdly, by transforming the link prediction problem to a classification problem, we use the typical SVM classifier to predict the possible links. Finally, experimental results on citation data set show the feasibility of our method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boyd, M.D., Ellison, B.N.: Social Network Sites: Definition, History, and Scholarship. Journal of Computer-Mediated Communication 13 (2007)
Yang, S.H., Long, B., Smola, A., et al.: Like like alike — Joint Friendship and Interest Propagation in Social Networks. In: WWW 2011 (2011)
Parimi, R., Caragea, D.: Predicting Friendship Links in Social Networks Using a Topic Modeling Approach. In: Huang, J.Z., Cao, L., Srivastava, J. (eds.) PAKDD 2011, Part II. LNCS, vol. 6635, pp. 75–86. Springer, Heidelberg (2011)
Hasan, M.A., Zaki, M.J.: A Survey of link prediction in social network. Social network data analytics, vol. 6. Kluwer Academic Publishers (2012)
Hsu, H.W., Weninger, T., Paradesi, R.S.M., Lancaster, J.: Structural link analysis from user profiles and friends networks: a feature construction approach. In: Proceedings of International Conference on Weblogs and Social Media, ICWSM 2007, Boulder, CO, USA (2007)
Taskar, B., Wong, M., Abbeel, P., Koller, D.: Link Prediction in Relational Data. In: Proc. of 17th Neural Information Processing Systems, NIPS (2003)
O’Madadhain, J., Hutchins, J., Smyth, P.: Prediction and ranking algorithms for event-based network data. In: ACM SIGKDD, New York (2005)
Eirinaki, M., Louta, M.D., Varlamis, I.: A Trust-Aware System for Personalized User Recommendations in Social Networks. IEEE Transactions on Systems, Man, and Cybernetics: Systems 44(4) (April 2014)
Huang, J., Nie, F., Huang, H., Tu, Y.-C.: Trust prediction via aggregating heterogeneous social networks. CIKM2012:1774-1778
Blei, D., Ng, Y.A., Jordan, I.M.: Latent Dirichlet Allocation. Journal of Machine Learning Research 3, 993–1022 (2003)
Xing, W., Bruce, C.: LDA-based document models for Adhocretrieval. In: Proceedings of the 29th Annual International SIGIR Conference, Washington (2006)
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, Washington (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xie, X., Li, Y., Zhang, Z., Han, S., Pan, H. (2015). A Joint Link Prediction Method for Social Network. In: Wang, H., et al. Intelligent Computation in Big Data Era. ICYCSEE 2015. Communications in Computer and Information Science, vol 503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46248-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-662-46248-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-46247-8
Online ISBN: 978-3-662-46248-5
eBook Packages: Computer ScienceComputer Science (R0)