Multinomial Relation Prediction in Social Data: A Dimension Reduction Approach

The recent popularization of social web services has made them one of the primary uses of the World Wide Web. An important concept in social web services is social actions such as making connections and communicating with others and adding annotations to web resources. Predicting social actions would improve many fundamental web applications, such as recommendations and web searches. One remarkable characteristic of social actions is that they involve multiple and heterogeneous objects such as users, documents, keywords, and locations. However, the high-dimensional property of such multinomial relations poses one fundamental challenge, that is, predicting multinomial relations with only a limited amount of data. In this paper, we propose a new multinomial relation prediction method, which is robust to data sparsity. We transform each instance of a multinomial relation into a set of binomial relations between the objects and the multinomial relation of the involved objects. We then apply an extension of a low-dimensional embedding technique to these binomial relations, which results in a generalized eigenvalue problem guaranteeing global optimal solutions. We also incorporate attribute information as side information to address the "cold start" problem in multinomial relation prediction. Experiments with various real-world social web service datasets demonstrate that the proposed method is more robust against data sparseness as compared to several existing methods, which can only find sub-optimal solutions.

[1]  David M. Pennock,et al.  Methods and metrics for cold-start recommendations , 2002, SIGIR '02.

[2]  Mikhail Belkin,et al.  Laplacian Eigenmaps for Dimensionality Reduction and Data Representation , 2003, Neural Computation.

[3]  Peter Mika,et al.  Ontologies are us: A unified model of social networks and semantics , 2005, J. Web Semant..

[4]  Yong Yu,et al.  Optimizing web search using social annotations , 2007, WWW '07.

[5]  Yong Yu,et al.  Exploring folksonomy for personalized search , 2008, SIGIR '08.

[6]  Yoshihiro Yamanishi,et al.  Supervised Bipartite Graph Inference , 2008, NIPS.

[7]  Yang Song,et al.  Real-time automatic tag recommendation , 2008, SIGIR '08.

[8]  Panagiotis Symeonidis,et al.  Tag recommendations based on tensor dimensionality reduction , 2008, RecSys '08.

[9]  Roelof van Zwol,et al.  Flickr tag recommendation based on collective knowledge , 2008, WWW.

[10]  Georgia Koutrika,et al.  Can social bookmarking improve web search? , 2008, WSDM '08.

[11]  Yutaka Matsuo,et al.  Community gravity: measuring bidirectional effects by trust and rating on online social networks , 2009, WWW '09.

[12]  Lars Schmidt-Thieme,et al.  Learning optimal ranking with tensor factorization for tag recommendation , 2009, KDD.

[13]  Jimeng Sun,et al.  MetaFac: community discovery via relational hypergraph factorization , 2009, KDD.

[14]  Tamara G. Kolda,et al.  Tensor Decompositions and Applications , 2009, SIAM Rev..

[15]  Chun Chen,et al.  Personalized tag recommendation using graph-based ranking on multi-type interrelated objects , 2009, SIGIR.

[16]  Rossano Schifanella,et al.  Folks in Folksonomies: social link prediction from shared metadata , 2010, WSDM '10.

[17]  Lars Schmidt-Thieme,et al.  Pairwise interaction tensor factorization for personalized tag recommendation , 2010, WSDM '10.

[18]  Danushka Bollegala,et al.  Interest Prediction on Multinomial, Time-Evolving Social Graph , 2011, IJCAI.

[19]  Danushka Bollegala,et al.  Exploiting User Interest on Social Media for Aggregating Diverse Data and Predicting Interest , 2011, ICWSM.

[20]  Chris H. Q. Ding,et al.  Low-order tensor decompositions for social tagging recommendation , 2011, WSDM '11.

[21]  Thomas Gottron,et al.  Searching microblogs: coping with sparsity and document quality , 2011, CIKM '11.

[22]  V. Voloshin Introduction to Graph and Hypergraph Theory , 2013 .