Node Classification in Signed Social Networks

Node classification in social networks has been proven to be useful in many real-world applications. The vast majority of existing algorithms focus on unsigned social networks (or social networks with only positive links), while little work exists for signed social networks. It is evident from recent developments in signed social network analysis that negative links have added value over positive links. Therefore, the incorporation of negative links has the potential to benefit various analytical tasks. In this paper, we study the novel problem of node classification in signed social networks. We provide a principled way to mathematically model positive and negative links simultaneously and propose a novel framework NCSSN for node classification in signed social networks. Experimental results on real-world signed social network datasets demonstrate the effectiveness of the proposed framework NCSSN. Further experiments are conducted to gain a deeper understanding of the importance of negative links for NCSSN.

[1]  Lise Getoor,et al.  Collective Classification in Network Data , 2008, AI Mag..

[2]  P. K. Singh,et al.  Community Mining in Signed Social Networks -An Automated Approach , 2011 .

[3]  Graham Cormode,et al.  Node Classification in Social Networks , 2011, Social Network Data Analytics.

[4]  Jiming Liu,et al.  Community Mining from Signed Social Networks , 2007, IEEE Transactions on Knowledge and Data Engineering.

[5]  Charu C. Aggarwal,et al.  Negative Link Prediction in Social Media , 2014, WSDM.

[6]  Nagarajan Natarajan,et al.  Exploiting longer cycles for link prediction in signed networks , 2011, CIKM '11.

[7]  Shankar Kumar,et al.  Video suggestion and discovery for youtube: taking random walks through the view graph , 2008, WWW.

[8]  Xiaolong Wang,et al.  Overlapping community detection in networks with positive and negative links , 2013, ArXiv.

[9]  Ramanathan V. Guha,et al.  Propagation of trust and distrust , 2004, WWW '04.

[10]  Michael R. Lyu,et al.  Learning to recommend with trust and distrust relationships , 2009, RecSys '09.

[11]  Zoubin Ghahramani,et al.  Combining active learning and semi-supervised learning using Gaussian fields and harmonic functions , 2003, ICML 2003.

[12]  Chris H. Q. Ding,et al.  Orthogonal nonnegative matrix t-factorizations for clustering , 2006, KDD '06.

[13]  Arik Azran,et al.  The rendezvous algorithm: multiclass semi-supervised learning with Markov random walks , 2007, ICML '07.

[14]  Bernhard Schölkopf,et al.  Learning with Local and Global Consistency , 2003, NIPS.

[15]  Bernhard Schölkopf,et al.  Learning from labeled and unlabeled data on a directed graph , 2005, ICML.

[16]  Lise Getoor,et al.  Link mining: a survey , 2005, SKDD.

[17]  Malik Magdon-Ismail,et al.  Communities and Balance in Signed Networks: A Spectral Approach , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

[18]  Ben Taskar,et al.  Discriminative Probabilistic Models for Relational Data , 2002, UAI.

[19]  Mohammad Ali Abbasi,et al.  Scalable learning of users' preferences using networked data , 2014, HT.

[20]  Lise Getoor,et al.  Link-Based Classification , 2003, Encyclopedia of Machine Learning and Data Mining.

[21]  Michael Szell,et al.  Multirelational organization of large-scale social networks in an online world , 2010, Proceedings of the National Academy of Sciences.

[22]  Frank McSherry,et al.  Spectral partitioning of random graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[23]  Foster Provost,et al.  A Simple Relational Classifier , 2003 .

[24]  Huan Liu,et al.  Is distrust the negation of trust?: the value of distrust in social media , 2014, HT.

[25]  Jérôme Kunegis,et al.  What is the added value of negative links in online social networks? , 2013, WWW.

[26]  Chris Cornelis,et al.  Trust- and Distrust-Based Recommendations for Controversial Reviews , 2011, IEEE Intelligent Systems.

[27]  Jennifer Neville,et al.  Iterative Classification in Relational Data , 2000 .

[28]  Lise Getoor,et al.  To join or not to join: the illusion of privacy in social networks with mixed public and private user profiles , 2009, WWW '09.

[29]  Inderjit S. Dhillon,et al.  Low rank modeling of signed networks , 2012, KDD.

[30]  Éva Tardos,et al.  Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[31]  Huan Liu,et al.  Exploiting homophily effect for trust prediction , 2013, WSDM.

[32]  Sahin Albayrak,et al.  Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization , 2010, SDM.

[33]  Inderjit S. Dhillon,et al.  Scalable clustering of signed networks using balance normalized cut , 2012, CIKM.

[34]  Charu C. Aggarwal,et al.  A Survey of Signed Network Mining in Social Media , 2015, ACM Comput. Surv..

[35]  Huan Liu,et al.  Relational learning via latent social dimensions , 2009, KDD.

[36]  Jure Leskovec,et al.  Predicting positive and negative links in online social networks , 2010, WWW '10.