Abstract
We study the problem of identifying representative users in social networks from an information spreading perspective. While traditional network measures such as node degree and PageRank have been shown to work well for selecting seed users, the resulting nodes often have high neighbour overlap and thus are not optimal in terms of maximising spreading coverage. In this paper we extend a recently proposed statistical learning approach called skeleton learning (SKE) to graph datasets. The idea is to associate each node with a random representative node through Bayesian inference. By doing so, a prior distribution defined over the graph nodes emerges where representatives with high probabilities lie in key positions and are mutually exclusive, reducing neighbour overlap. Evaluation with information diffusion experiments on real scientific collaboration networks shows that seeds selected using SKE are more effective spreaders compared with those selected with traditional ranking algorithms and a state-of-the-art degree discount heuristic.
This is a preview of subscription content, log in via an institution to check access.
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
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888–905 (2000)
Ng, A.Y., Jordan, M.I., Weiss, Y.: On spectral clustering: Analysis and an algorithm. In: NIPS 14, pp. 849–856. MIT Press (2002)
Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395–416 (2007)
White, S., Smyth, P.: A spectral clustering approach to finding communities in graphs. In: Proc. SDM 2005, pp. 274–285 (2005)
Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74(3), 036104 (2006)
Xu, K.S., Kliger, M., Chen, Y., Woolf, P.J., Hero III, A.O.: Revealing social networks of spammers through spectral clustering. In: Proc. ICC 2009, pp. 735–740 (2009)
Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Networks ISDN 30(1-7), 107–117 (1998)
Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM 46(5), 604–632 (1999)
Lempel, R., Moran, S.: The stochastic approach for link-structure analysis (SALSA) and the TKC effect. Comput. Netw. 33(1-6), 387–401 (2000)
Chung, F.R.K.: Spectral Graph Theory. Amer. Math. Soc. (1997)
Zhou, D., Huang, J., Schölkopf, B.: Learning from labeled and unlabeled data on a directed graph. In: Proc. ICML 2005, pp. 1036–1043 (2005)
Agarwal, A., Chakrabarti, S.: Learning random walks to rank nodes in graphs. In: Proc. ICML 2007, pp. 9–16 (2007)
Domingos, P., Richardson, M.: Mining the network value of customers. In: Proc. SIGKDD 2001, pp. 57–66 (2001)
Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: Proc. SIGKDD 2002, pp. 61–70 (2002)
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proc. SIGKDD 2003, pp. 137–146 (2003)
Granovetter, M.: Threshold models of collective behavior. Am. J. Sociol. 83(6), 1420–1443 (1978)
Goldenberg, J., Libai, B., Muller, E.: Talk of the network: A complex systems look at the underlying process of word-of-mouth. Market. Lett. 12(3), 211–223 (2001)
Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proc. SIGKDD 2009, pp. 199–208 (2009)
Kitsak, M., Gallos, L., Havlin, S., Liljeros, F., Muchnik, L., Stanley, H., Makse, H.: Identification of influential spreaders in complex networks. Nature Phys. 6(11), 889–893 (2010)
Sun, K., Bruno, E., Marchand-Maillet, S.: Unsupervised skeleton learning for manifold denoising. In: Proc. ICPR 2012, pp. 2719–2722 (2012)
Hinton, G.E., Roweis, S.T.: Stochastic Neighbor Embedding. In: NIPS 15, pp. 833–840. MIT Press (2003)
Hein, M., Maier, M.: Manifold denoising. In: NIPS 19, pp. 561–568. MIT Press (2007)
Myers, S.A., Zhu, C., Leskovec, J.: Information diffusion and external influence in networks. In: Proc. SIGKDD 2012, pp. 33–41 (2012)
Xu, L.: Learning algorithms for RBF functions and subspace based functions. In: Handbook of Research on Machine Learning Applications and Trends: Algorithms, Methods and Techniques, pp. 60–94. IGI Global (2009)
Bottou, L.: Online algorithms and stochastic approximations. In: Online Learning and Neural Networks. Cambridge University Press (1998)
Stehlé, J., Voirin, N., Barrat, A., Cattuto, C., Isella, L., Pinton, J., Quaggiotto, M., Van den Broeck, W., Régis, C., Lina, B., Vanhems, P.: High-resolution measurements of face-to-face contact patterns in a primary school. PLoS ONE 6(8), e23176 (2011)
Backstrom, L., Leskovec, J.: Supervised random walks: predicting and recommending links in social networks. In: Proc. WSDM 2011, pp. 635–644 (2011)
Lancichinetti, A., Radicchi, F., Ramasco, J.J., Fortunato, S.: Finding statistically significant communities in networks. PLoS ONE 6(4), e18961 (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
Sun, K., Morrison, D., Bruno, E., Marchand-Maillet, S. (2013). Learning Representative Nodes in Social Networks. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2013. Lecture Notes in Computer Science(), vol 7819. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37456-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-37456-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37455-5
Online ISBN: 978-3-642-37456-2
eBook Packages: Computer ScienceComputer Science (R0)