Jérôme Kunegis
Damien Fay
Christian Bauckhage
ABSTRACT
We introduce and study the spectral evolution model, which characterizes the growth of large networks in terms of the eigenvalue decomposition of their adjacency matrices: In large networks, changes over time result in a change of a graph's spectrum, leaving the eigenvectors unchanged. We validate this hypothesis for several large social, collaboration, authorship, rating, citation, communication and tagging networks, covering unipartite, bipartite, signed and unsigned graphs. Following these observations, we introduce a link prediction algorithm based on the extrapolation of a network's spectral evolution. This new link prediction method generalizes several common graph kernels that can be expressed as spectral transformations. In contrast to these graph kernels, the spectral extrapolation algorithm does not make assumptions about specific growth patterns beyond the spectral evolution model. We thus show that it performs particularly well for networks with irregular, but spectral, growth patterns.
- R. Albert, H. Jeong, and A.-L. Barabási. The diameter of the World Wide Web. Nature, 401:130, 1999.Google Scholar
Cross Ref
- J. Bennett and S. Lanning. The Netflix prize. In Proc. KDD Cup, pages 3--6, 2007.Google Scholar
- K. Bollacker, S. Lawrence, and C. L. Giles. CiteSeer: An autonomous web agent for automatic retrieval and identification of interesting publications. In Proc. Int. Conf. on Autonomous Agents, pages 116--123, 1998. Google ScholarDigital Library
- L. Brožovský and V. Petříček. Recommender system for online dating service. In Proc. Znalosti, pages 29--40, 2007.Google Scholar
- O. Chapelle, J. Weston, and B. Schölkopf. Cluster kernels for semi-supervised learning. In Advances in Neural Information Processing Systems, pages 585--592, 2003.Google Scholar
- J. Ding and A. Zhou. Eigenvalues of rank-one updated matrices with some applications. Applied Mathematics Letters, 20(12):1223--1226, 2007.Google ScholarCross Ref
- K. Emamy and R. Cameron. CiteULike: A researcher's social bookmarking service. Ariadne, (51), 2007.Google Scholar
- F. Fouss, L. Yen, A. Pirotte, and M. Saerens. An experimental investigation of graph kernels on a collaborative recommendation task. In Proc. Int. Conf. on Data Mining, pages 863--868, 2006. Google ScholarDigital Library
- K. Goldberg, T. Roeder, D. Gupta, and C. Perkins. Eigentaste: A constant time collaborative filtering algorithm. Information Retrieval, 4(2):133--151, 2001. Google ScholarDigital Library
- GroupLens Research. MovieLens data sets. http://www.grouplens.org/node/73, October 2006.Google Scholar
- B. H. Hall, A. B. Jaffe, and M. Trajtenberg. The NBER patent citations data file: Lessons, insights and methodological tools. In NBER Working Papers 8498, National Bureau of Economic Research, Inc, 2001.Google Scholar
- A. Hotho, R. Jäschke, C. Schmitz, and G. Stumme. BibSonomy: A social bookmark and publication sharing system. In Proc. Workshop on Conceptual Structure Tool Interoperability, pages 87--102, 2006.Google Scholar
- J. Kandola, J. Shawe-Taylor, and N. Cristianini. Learning semantic similarity. In Advances in Neural Information Processing Systems, pages 657--664, 2002.Google Scholar
- B. Klimt and Y. Yang. The Enron corpus: A new dataset for email classification research. In Proc. Eur. Conf. on Machine Learning, pages 217--226, 2004.Google ScholarDigital Library
- R. Kondor and J. Lafferty. Diffusion kernels on graphs and other discrete structures. In Proc. Int. Conf. on Machine Learning, pages 315--322, 2002. Google ScholarDigital Library
- J. Kunegis and A. Lommatzsch. Learning spectral graph transformations for link prediction. In Proc. Int. Conf. on Machine Learning, pages 561--568, 2009. Google ScholarDigital Library
- J. Kunegis, A. Lommatzsch, and C. Bauckhage. The Slashdot Zoo: Mining a social network with negative edges. In Proc. Int. World Wide Web Conf., pages 741--750, 2009. Google ScholarDigital Library
- P. D. Lax. Linear Algebra and Its Applications. John Wiley & Sons, 1984.Google Scholar
- J. Leskovec. Stanford network analysis project. http://snap.stanford.edu/, March 2010.Google Scholar
- J. Leskovec, L. Backstrom, R. Kumar, and A. Tomkins. Microscopic evolution of social networks. In Proc. Int. Conf. on Knowledge Discovery and Data Mining, pages 462--470, 2008. Google ScholarDigital Library
- M. Ley. The DBLP computer science bibliography: Evolution, research issues, perspectives. In Proc. Int. Symposium on String Processing and Information Retrieval, pages 1--10, 2002. Google ScholarDigital Library
- D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In Proc. Int. Conf. on Information and Knowledge Management, pages 556--559, 2003. Google ScholarDigital Library
- C. D. Manning, P. Raghavan, and H. Schütze. Introduction to Information Retrieval. Cambridge University Press, 2008. Google ScholarDigital Library
- P. Massa and P. Avesani. Controversial users demand local trust metrics: an experimental study on epinions.com community. In Proc. American Association for Artificial Intelligence Conf., pages 121--126, 2005. Google ScholarDigital Library
- A. Mislove. Online Social Networks: Measurement, Analysis, and Applications to Distributed Information Systems. PhD thesis, Rice University, 2009. Google ScholarDigital Library
- A. Mislove, H. S. Koppula, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Growth of the Flickr social network. In Proc. Workshop on Online Social Networks, pages 25--30, 2008. Google ScholarDigital Library
- A. Radl, U. v. Luxburg, and M. Hein. The resistance distance is meaningless for large random geometric graphs. In Proc. Workshop on Analyzing Networks and Learning with Graphs, 2009.Google Scholar
- B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Application of dimensionality reduction in recommender systems - a case study. In Proc. ACM WebKDD Workshop, 2000.Google ScholarCross Ref
- D. Stewart. Social status in an open-source community. American Sociological Review, 70(5):823--842, 2005.Google ScholarCross Ref
- G. W. Stewart. Perturbation theory for the singular value decomposition. Technical report, Univ. of Maryland, College Park, 1990. Google ScholarDigital Library
- J. Sun, D. Tao, and C. Faloutsos. Beyond streams and graphs: Dynamic tensor analysis. In Proc. Int. Conf. on Knowledge Discovery and Data Mining, pages 374--383, 2006. Google ScholarDigital Library
- B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi. On the evolution of user interaction in Facebook. In Proc. Workshop on Online Social Networks, pages 37--42, 2009. Google ScholarDigital Library
- Wikimedia Foundation. Wikimedia downloads. http://download.wikimedia.org/, January 2010.Google Scholar
- X. Zhu, J. Kandola, J. Lafferty, and Z. Ghahramani. Semi-supervised Learning, chapter Graph Kernels by Spectral Transforms. MIT Press, 2006.Google Scholar
- C.-N. Ziegler, S. M. McNee, J. A. Konstan, and G. Lausen. Improving recommendation lists through topic diversification. In Proc. Int. World Wide Web Conf., pages 22--32, 2005. Google ScholarDigital Library
Index Terms
- Network growth and the spectral evolution model
Recommendations
Spectral evolution in dynamic networks
We introduce and study the spectral evolution model, which characterizes the growth of large networks in terms of the eigenvalue decomposition of their adjacency matrices: In large networks, changes over time result in a change of a graph's spectrum, ...
Modeling evolution of a social network using temporalgraph kernels
SIGIR '14: Proceedings of the 37th international ACM SIGIR conference on Research & development in information retrievalMajority of the studies on modeling the evolution of a social network using spectral graph kernels do not consider temporal effects while estimating the kernel parameters. As a result, such kernels fail to capture structural properties of the evolution ...
The Spectral Zoo of Networks: Embedding and Visualizing Networks with Spectral Moments
KDD '20: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data MiningNetwork embedding methods have been widely and successfully used in network-based applications such as node classification and link prediction. However, an ideal network embedding should not only be useful for machine learning, but interpretable. We ...
Comments