Motif-Plus: incorporation of network motifs into top-n friendship recommendations

Although recently there have been a variety of attempts for friendship recommendations, most existing approaches overemphasise the use of global information implied in historical data while overlooking such essential transitivity rule in social networks as the 'triadic closure' principle. To overcome this limitation, we analyse triangular network motifs in social networks and design a novel principle named 'triangular power' for friendship recommendations on the basis of the 'triadic closure' rule. With this principle, we propose to quantify the willing-power that drives two people become friends by making use of triangular motifs and propose a novel strategy called Motif-Plus that utilise local information of a social network for friendship recommendations. We further incorporate this strategy into existing recommendation methods by aggregating ranks generated by individual approaches and Motif-Plus. With large-scale random sub-sampling validation experiments on three real social network datasets (Facebook, Twitter and Delicious), we compare the performance of five existing methods with Motif-Plus incorporated to their original forms. Results show that methods with Motif-Plus outperform their original forms in not only accuracy and retrieval criteria but also recommendation diversity significantly, suggesting that friendship recommendations will be benefit from the fusion of global and local information of social networks.

[1]  Gediminas Adomavicius,et al.  Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions , 2005, IEEE Transactions on Knowledge and Data Engineering.

[2]  Patrick Seemann,et al.  Matrix Factorization Techniques for Recommender Systems , 2014 .

[3]  Jonathan L. Herlocker,et al.  Evaluating collaborative filtering recommender systems , 2004, TOIS.

[4]  Krishna P. Gummadi,et al.  On the evolution of user interaction in Facebook , 2009, WOSN '09.

[5]  Kurt Mehlhorn,et al.  Efficient graphlet kernels for large graph comparison , 2009, AISTATS.

[6]  Martin Ester,et al.  A matrix factorization technique with trust propagation for recommendation in social networks , 2010, RecSys '10.

[7]  M. Newman,et al.  Why social networks are different from other types of networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Yi-Cheng Zhang,et al.  Bipartite network projection and personal recommendation. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Jure Leskovec,et al.  Microscopic evolution of social networks , 2008, KDD.

[10]  Nicolas Tsapatsoulis,et al.  The Importance of Similarity Metrics for Representative Users Identification in Recommender Systems , 2010, AIAI.

[11]  A. Rapoport Spread of information through a population with socio-structural bias: I. Assumption of transitivity , 1953 .

[12]  Mingxin Gan,et al.  Walking on a User Similarity Network towards Personalized Recommendations , 2014, PloS one.

[13]  M. Wu,et al.  Collaborative Filtering via Ensembles of Matrix Factorizations , 2007, KDD 2007.

[14]  Diego Fernández,et al.  Comparison of collaborative filtering algorithms , 2011, ACM Trans. Web.

[15]  Eric P. Xing,et al.  On Triangular versus Edge Representations --- Towards Scalable Modeling of Networks , 2012, NIPS.

[16]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[17]  T. Snijders The statistical evaluation of social network dynamics , 2001 .

[18]  U. Alon Network motifs: theory and experimental approaches , 2007, Nature Reviews Genetics.

[19]  Arkadiusz Paterek,et al.  Improving regularized singular value decomposition for collaborative filtering , 2007 .

[20]  Alexander J. Smola,et al.  Like like alike: joint friendship and interest propagation in social networks , 2011, WWW.

[21]  Stanford,et al.  Learning to Discover Social Circles in Ego Networks , 2012 .

[22]  Hsinchun Chen,et al.  Applying associative retrieval techniques to alleviate the sparsity problem in collaborative filtering , 2004, TOIS.

[23]  Rui Jiang,et al.  Constructing a user similarity network to remove adverse influence of popular objects for personalized recommendation , 2013, Expert Syst. Appl..

[24]  Danah Boyd,et al.  Social network sites: definition, history, and scholarship , 2007, IEEE Engineering Management Review.

[25]  Rui Jiang,et al.  Improving accuracy and diversity of personalized recommendation through power law adjustments of user similarities , 2013, Decis. Support Syst..

[26]  David Lazer,et al.  Inferring friendship network structure by using mobile phone data , 2009, Proceedings of the National Academy of Sciences.

[27]  George Karypis,et al.  Item-based top-N recommendation algorithms , 2004, TOIS.

[28]  Charalampos E. Tsourakakis Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[29]  A. Kaplan,et al.  Users of the world, unite! The challenges and opportunities of Social Media , 2010 .

[30]  Michael R. Lyu,et al.  SoRec: social recommendation using probabilistic matrix factorization , 2008, CIKM '08.

[31]  Jure Leskovec,et al.  Supervised random walks: predicting and recommending links in social networks , 2010, WSDM '11.