Abstract
Traditionally, research about social user profiling assumes that users share some similar interests with their followees. However, it lacks the studies on what topic and to what extent their interests are similar. Our study in online sharing sites reveals that besides shared interests between followers and followees, users do maintain some individual interests which differ from their followees. Thus, for better social user profiling we need to discern individual interests (capturing the uniqueness of users) and shared interests (capturing the commonality of neighboring users) of the users in the connected world. To achieve this, we extend the matrix factorization model by incorporating both individual and shared interests, and also learn the multi-faceted similarities unsupervisedly. The proposed method can be applied to many applications, such as rating prediction, item level social influence maximization and so on. Experimental results on real-world datasets show that our work can be applied to improve the performance of social rating. Also, it can reveal some interesting findings, such as who likes the “controversial” items most, and who is the most influential in attracting their followers to rate an item.





Similar content being viewed by others
References
Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent dirichlet allocation. J. Mach. Learn. Res. 3, 993–1022 (2003)
Boyd, S.P., Vandenberghe, L.: Convex optimization. Cambridge University Press (2004)
Breese, J.S., Heckerman, D., Kadie, C.: Empirical analysis of predictive algorithms for collaborative filtering. In: UAI ’98, pp. 43–52 (1998)
Chua, F.C.T., Lauw, H.W., Lim, E.P.: Generative models for item adoptions using social correlation. IEEE Trans. Knowl. Data Eng. 25(9), 2036–2048 (2013)
Deshpande, M., Karypis, G.: Item-based top-n recommendation algorithms. ACM Trans. Inf. Syst. 22(1), 143–177 (2004)
Feng, H., Qian, X.: Recommendation via user’s personality and social contextual. In: CIKM ’13, pp. 1521–1524. ACM (2013)
Friedkin, N.E.: A structural theory of social influence, vol. 13. Cambridge University Press (2006)
Golbeck, J.A.: Computing and applying trust in Web-based social networks (2005)
Herlocker, J.L., Konstan, J.A., Borchers, A., Riedl, J.: An algorithmic framework for performing collaborative filtering. In: SIGIR ’99, pp. 230–237 (1999)
Hofmann, T.: Latent semantic models for collaborative filtering. ACM Trans. Inf. Syst. 22, 89–115 (2004)
Jamali, M., Ester, M.: Trustwalker: a random walk model for combining trust-based and item-based recommendation. In: KDD ’09, pp. 397–406 (2009)
Jamali, M., Ester, M.: A matrix factorization technique with trust propagation for recommendation in social networks. In: RecSys ’10, pp. 135–142 (2010)
Jin, R., Chai, J.Y., Si, L.: An automatic weighting scheme for collaborative filtering. In: SIGIR ’04, pp. 337–344 (2004)
Linden, G., Smith, B., York, J.: Amazon. com recommendations: Item-to-item collaborative filtering. IEEE Internet Comput. 7(1), 76–80 (2003)
Ma, H., King, I., Lyu, M.R.: Learning to recommend with social trust ensemble. In: SIGIR ’09, pp. 203–210 (2009)
Ma, H., Yang, H., Lyu, M.R., King, I.: Sorec: social recommendation using probabilistic matrix factorization. In: CIKM ’08, pp. 931–940 (2008)
Massa, P., Avesani, P.: Trust-aware recommender systems. In: RecSys ’07, pp. 17–24 (2007)
Salakhutdinov, R., Mnih, A.: Probabilistic matrix factorization. In: NIPS ’07, pp. 1257–1264 (2007)
Salakhutdinov, R., Mnih, A., Hinton, G.: Restricted boltzmann machines for collaborative filtering. In: ICML ’07, pp. 791–798 (2007)
Sarwar, B., Karypis, G., Konstan, J., Riedl, J.: Item-based collaborative filtering recommendation algorithms. In: WWW ’01, pp. 285–295 (2001)
Si, L., Jin, R.: Flexible mixture model for collaborative filtering. In: ICML ’03, pp. 704–711 (2003)
Tang, J., Gao, H., Liu, H.: Mtrust: discerning multi-faceted trust in a connected world. In: WSDM ’12, pp. 93–102 (2012)
Tang, J., Hu, X., Gao, H., Liu, H.: Exploiting local and global social context for recommendation. In: Proceedings of the twenty-third international joint conference on artificial intelligence, pp. 2712–2718. AAAI Press (2013)
Wang, Y., Liwei, W., Li, Y., He, D., Chen, W., Liu, T.Y.: A theoretical analysis of ndcg ranking measures. In: 26th annual conference on learning theory (2013)
Xue, G.R., Lin, C., Yang, Q., Xi, W., Zeng, H.J., Yu, Y., Chen, Z.: Scalable collaborative filtering using cluster-based smoothing. In: SIGIR ’05, pp. 114–121 (2005)
Ye, M., Liu, X., Lee, W.C.: Exploring social influence for recommendation: a generative model approach. In: SIGIR ’12, pp. 671–680. ACM (2012)
Acknowledgments
This research was partially supported by grants from the National Science Foundation for Distinguished Young Scholars of China (Grant No. 61325010), the Natural Science Foundation of China (Grant No.s 61403358 and 71329201), the Science and Technology Program for Public Wellbeing (Grant No. 2013GS340302), and the National High Technology Research and Development Program of China (Grant No. 2014AA015203). Ping was supported by the National Natural Science Foundation of China (No.61473274), and National High Technology Research and Development Program of China (No.2014AA015105).
Author information
Authors and Affiliations
Corresponding authors
Appendix
Appendix
Before conducting the experiment methods, we pre-processed the ratings as follows: let L R a t e and H R a t e denote the Lowest and the Highest rating in the training set, then
-
\(r^{1}_{u, v} = \frac {r_{u, v} - LRate}{HRate - LRate}\);
-
\(r^{2}_{u, v} = r^{1}_{u, v} - r^{1}\), where \(r^{1} = \frac {1}{|{\Omega }|} {\sum }_{\Omega } r^{1}_{u, v}\);
-
let \(\{r^{2}_{u, v}\}\) be the input of the methods.
When we apply the trained models to the applications, we recover the predicted values as follows:
where \(\varphi ^{1}_{u, v} = \mathbf {\rho }_{u} \cdot \mathbf {v} + L_{u} \cdot r^{1}\), \(L_{u} = {\sum }_{u^{\prime } \in \mathcal {D}(u)} \frac {||\mathbf {w}_{u^{\prime }, u}||_{1}}{K}\) (||⋅||1 means the l 1 norm of vectors).
and \(\eta ^{1}_{u, v} = \mathbf {t}_{u} \cdot \mathbf {v} + T_{u} \cdot r^{1}\), \(T_{u} = {\sum }_{u^{\prime } \in \mathcal {D}(u)} T_{u^{\prime }, u}\).
where \(\theta _{u, v}^{1} = \mathbf {p}_{u} \cdot \mathbf {v} + P_{u} \cdot r^{1}\), \(P_{u} = {\sum }_{u^{\prime } \in \mathcal {F}(u)} \frac {\mathbf {h}_{u, u^{\prime }} \cdot \mathbf {w}_{u, u^{\prime }}}{K}\).
Rights and permissions
About this article
Cite this article
Chen, E., Zeng, G., Luo, P. et al. Discerning individual interests and shared interests for social user profiling. World Wide Web 20, 417–435 (2017). https://doi.org/10.1007/s11280-016-0397-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11280-016-0397-x