Abstract
In recent years the research on measuring relationship strength among the people in a social network has gained attention due to its potential applications of social network analysis. The challenge is how we can learn social relationship strength based on various resources such as user profiles and social interactions. In this paper we propose a KPMCF model to learn social relationship strength based on users’ latent features inferred from both profile and interaction information. The proposed model takes an uniformed approach of integrating Matrix Co-Factorization with Multiple Kernels. We conduct experiments on real-world data sets for typical web mining applications, showing that the proposed model produces better relationship strength measurement in comparison with other social factors.
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
Agovic, A., Banerjee, A., Chatterjee, S.: Probabilistic matrix addition. In: Proceedings of the Twenty-Eighth International Conference on Machine Learning (2011)
Baeza-Yates, R., Ribeiro-Neto, B., et al.: Modern information retrieval, vol. 463. ACM Press, New York (1999)
Buntine, W.L.: Operations for learning with graphical models. arXiv preprint cs/9412102 (1994)
Fang, Y., Si, L.: Matrix co-factorization for recommendation with rich side information and implicit feedback. In: Proceedings of the 2nd International Workshop on Information Heterogeneity and Fusion in Recommender Systems, pp. 65–69. ACM (2011)
Gilbert, E., Karahalios, K.: Predicting tie strength with social media. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 211–220. ACM (2009)
Granovetter, M.: The strength of weak ties. American Journal of Sociology, 1360–1380 (1973)
Granovetter, M.: The strength of weak ties: A network theory revisited. Sociological Theory 1(1), 201–233 (1983)
Hofmann, T., Schölkopf, B., Smola, A.J.: Kernel methods in machine learning. The Annals of Statistics, 1171–1220 (2008)
Kahanda, I., Neville, J.: Using transactional information to predict link strength in online social networks. In: Proceedings of the Third International Conference on Weblogs and Social Media, ICWSM (2009)
Koren, Y., Bell, R., Volinsky, C.: Matrix factorization techniques for recommender systems. Computer 42(8), 30–37 (2009)
Lippert, C., Weber, S.H., Huang, Y., Tresp, V., Schubert, M., Kriegel, H.P.: Relation prediction in multi-relational domains using matrix factorization. In: Proceedings of the NIPS 2008 Workshop: Structured Input-Structured Output, Vancouver, Canada (2008)
Ma, H., Yang, H., Lyu, M.R., King, I.: Sorec: Social recommendation using probabilistic matrix factorization. In: Proceeding of CIKM 2008, pp. 931–940. ACM (2008)
Marsden, P., Campbell, K.: Measuring tie strength. Social Forces 63(2), 482–501 (1984)
McAuley, J., Leskovec, J.: Image labeling on a network: Using social-network metadata for image classification. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012, Part IV. LNCS, vol. 7575, pp. 828–841. Springer, Heidelberg (2012)
McPherson, M., Smith-Lovin, L., Cook, J.M.: Birds of a feather: Homophily in social networks. Annual Review of Sociology, 415–444 (2001)
Rasmussen, C., Williams, C.: Gaussian processes for machine learning, vol. 1. MIT Press, Cambridge (2006)
Salakhutdinov, R., Mnih, A.: Probabilistic matrix factorization. In: Advances in Neural Information Processing Systems, vol. 20, pp. 1257–1264 (2008)
Scholkopf, B., Smola, A.: Learning with kernels: support vector machines, regularization, optimization, and beyond, vol. 1. MIT Press, Cambridge (2002)
Singh, A.P., Gordon, G.J.: Relational learning via collective matrix factorization. In: Proceeding of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 650–658. ACM (2008)
Singh, A.P., Gordon, G.J.: A unified view of matrix factorization models. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML PKDD 2008, Part II. LNCS (LNAI), vol. 5212, pp. 358–373. Springer, Heidelberg (2008)
Smola, A.J., Kondor, R.: Kernels and regularization on graphs. In: Schölkopf, B., Warmuth, M.K. (eds.) COLT/Kernel 2003. LNCS (LNAI), vol. 2777, pp. 144–158. Springer, Heidelberg (2003)
Van House, N.A.: Flickr and public image-sharing: distant closeness and photo exhibition. In: Proceedings of CHI 2007, pp. 2717–2722. ACM (2007)
Xiang, R., Neville, J., Rogati, M.: Modeling relationship strength in online social networks. In: Proceedings of the 19th International Conference on World Wide Web, pp. 981–990. ACM (2010)
Zhao, X., Li, G., Yuan, J., Chen, X., Li, Z.: Relationship strength estimation for online social networks with the study on facebook. Neurocomputing (2012)
Zhou, T., Shan, H., Banerjee, A., Sapiro, G.: Kernelized probabilistic matrix factorization: Exploiting graphs and side information. In: Proceedings of SDM 2012, pp. 403–414. SIAM (2012)
Zhuang, J., Mei, T., Hoi, S., Hua, X., Li, S.: Modeling social strength in social media community via kernel-based learning. In: Proceedings of the 19th ACM International Conference on Multimedia, pp. 113–122. ACM (2011)
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
Zhong, Y., Du, L., Yang, J. (2013). Learning Social Relationship Strength via Matrix Co-Factorization with Multiple Kernels. In: Lin, X., Manolopoulos, Y., Srivastava, D., Huang, G. (eds) Web Information Systems Engineering – WISE 2013. WISE 2013. Lecture Notes in Computer Science, vol 8180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41230-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-41230-1_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41229-5
Online ISBN: 978-3-642-41230-1
eBook Packages: Computer ScienceComputer Science (R0)