skip to main content
10.1145/1553374.1553447acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicmlConference Proceedingsconference-collections
research-article

Learning spectral graph transformations for link prediction

Published: 14 June 2009 Publication History

Abstract

We present a unified framework for learning link prediction and edge weight prediction functions in large networks, based on the transformation of a graph's algebraic spectrum. Our approach generalizes several graph kernels and dimensionality reduction methods and provides a method to estimate their parameters efficiently. We show how the parameters of these prediction functions can be learned by reducing the problem to a one-dimensional regression problem whose runtime only depends on the method's reduced rank and that can be inspected visually. We derive variants that apply to undirected, weighted, unweighted, unipartite and bipartite graphs. We evaluate our method experimentally using examples from social networks, collaborative filtering, trust networks, citation networks, authorship graphs and hyperlink networks.

References

[1]
Albert, R., Jeong, H., & Barabáási, A.-L. (1999). The diameter of the World Wide Web. Nature, 401, 130.
[2]
Bailey, P., Craswell, N., & Hawking, D. (2003). Engineering a multi-purpose test collection for Web retrieval experiments. Information Processing and Management, 39, 853--871.
[3]
Chebotarev, P., & Shamis, E. (1997). The matrix-forest theorem and measuring relations in small social groups. Automation and Remote Control, 58, 1505--1514.
[4]
Fouss, F., Pirotte, A., Renders, J.-M., & Saerens, M. (2007). Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. Trans. on Knowledge and Data Engineering, 19, 355--369.
[5]
Goldberg, K., Roeder, T., Gupta, D., & Perkins, C. (2001). Eigentaste: A constant time collaborative filtering algorithm. Information Retrieval, 4, 133--151.
[6]
Guha, R., Kumar, R., Raghavan, P., & Tomkins, A. (2004). Propagation of trust and distrust. Proc. Int. Conf. on World Wide Web (pp. 403--412).
[7]
Hage, P., & Harary, F. (1983). Structural models in anthropology. Cambridge University Press.
[8]
Hou, Y. (2005). Bounds for the least Laplacian eigen-value of a signed graph. Acta Mathematica Sinica, 21, 955--960.
[9]
Ito, T., Shimbo, M., Kudo, T., & Matsumoto, Y. (2005). Application of kernels to link analysis. Proc. Int. Conf. on Knowledge Discovery in Data Mining (pp. 586--592).
[10]
Kandola, J., Shawe-taylor, J., & Cristianini, N. (2002). Learning semantic similarity. Advances in Neural Information Processing Systems (pp. 657--664).
[11]
Kondor, R., & Lafferty, J. (2002). Diffusion kernels on graphs and other discrete structures. Proc. Int. Conf. on Machine Learning (pp. 315--322).
[12]
Kunegis, J., Lommatzsch, A., & Bauckhage, C. (2009). The Slashdot Zoo: Mining a social network with negative edges. Proc. Int. Conf. on World Wide Web (pp. 741--750).
[13]
Liben-Nowell, D., & Kleinberg, J. (2003). The link prediction problem for social networks. Proc. Int. Conf. on Information and Knowledge Management (pp. 556--559).
[14]
Newman, M. E. J. (2001). The structure of scientific collaboration networks. Proc. National Academy of Sciences, 98, 404--409.
[15]
Sarwar, B., Karypis, G., Konstan, J., & Riedl, J. (2000). Application of dimensionality reduction in recommender systems--a case study. Proc. ACM WebKDD Workshop.
[16]
Smola, A., & Kondor, R. (2003). Kernels and regularization on graphs. Proc. Conf. on Learning Theory and Kernel Machines (pp. 144--158).
[17]
Stewart, D. (2005). Social status in an open-source community. American Sociological Review, 70, 823--842.
[18]
Wax, M., & Sheinvald, J. (1997). A least-squares approach to joint diagonalization. IEEE Signal Processing Letters, 4, 52--53.
[19]
Wu, Y., & Chang, E. Y. (2004). Distance-function design and fusion for sequence data. Proc. Int. Conf. on Information and Knowledge Management (pp. 324--333).

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
ICML '09: Proceedings of the 26th Annual International Conference on Machine Learning
June 2009
1331 pages
ISBN:9781605585161
DOI:10.1145/1553374

Sponsors

  • NSF
  • Microsoft Research: Microsoft Research
  • MITACS

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 June 2009

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Conference

ICML '09
Sponsor:
  • Microsoft Research

Acceptance Rates

Overall Acceptance Rate 140 of 548 submissions, 26%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)38
  • Downloads (Last 6 weeks)1
Reflects downloads up to 23 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media