Cited by 5,416Advanced Graph Neural NetworksComplex Network Analysis TechniquesGraph Theory and Algorithms

LINE: Large-scale Information Network Embedding

Open access
Tang, Jian, Qu, Meng, Wang, Mingzhe, Zhang, Ming, Yan, Jun, Mei, Qiaozhu·2015·Proceedings of the 24th International Conference on World Wide Web

Abstract

This paper studies the problem of embedding very large information networks into low-dimensional vector spaces, which is useful in many tasks such as visualization, node classification, and link prediction. Most existing graph embedding methods do not scale for real world information networks which usually contain millions of nodes. In this paper, we propose a novel network embedding method called the ``LINE,'' which is suitable for arbitrary types of information networks: undirected, directed, and/or weighted. The method optimizes a carefully designed objective function that preserves both the local and global network structures. An edge-sampling algorithm is proposed that addresses the limitation of the classical stochastic gradient descent and improves both the effectiveness and the efficiency of the inference. Empirical experiments prove the effectiveness of the LINE on a variety of real-world information networks, including language networks, social networks, and citation networks. The algorithm is very efficient, which is able to learn the embedding of a network with millions of vertices and billions of edges in a few hours on a typical single machine. The source code of the LINE is available online\footnote{\url{https://github.com/tangjianpku/LINE}}.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/2736277.2741093

Cites

18 of 18 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 5

  1. [5][5] J. R. Firth. A synopsis of linguistic theory, 1930-1955. In J. R. Firth (Ed.), Studies in linguistic analysis , pages 1-32. -
  2. [6][6] M. S. Granovetter. The strength of weak ties. American journal of sociology , pages 1360-1380, 1973. -
  3. [10][10] D. Liben-Nowell and J. Kleinberg. The link-prediction problem for social networks. Journal of the American society for information science and technology , 58(7):1019-1031, 2007. -
  4. [19][19] J. Tang, J. Zhang, L. Yao, J. Li, L. Zhang, and Z. Su. Arnetminer: extraction and mining of academic social networks. In Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining , pages 990-998. ACM, 2008. -
  5. [21][21] L. Van der Maaten and G. Hinton. Visualizing data using t-sne. Journal of Machine Learning Research , 9(2579-2605):85, 2008. -

Cited by

Sorted by citations

Authors
Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., & Mei, Q.
Affiliations
  • Microsoft Research Asia (China) (CN)
  • Peking University (CN)
  • University of Michigan (US)
Venue
Proceedings of the 24th International Conference on World Wide Web
Published
2015-05-18
Pages
1067-1077
OpenAlex
W1888005072
Cited by
5,416
References
18
Citations by year
2026: 155 · 2025: 322 · 2024: 429 · 2023: 567 · 2022: 653 · 2021: 917 · 2020: 835 · 2019: 774 · 2018: 477 · 2017: 222 · 2016: 59 · 2015: 4
FWCI
143.11
Type
conference paper
Language
en
Open access
Locations
  • International World Wide Web Conference (WWW) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Science Foundation (IIS-1054199, CCF-1048168)
  • National Natural Science Foundation of China (61472006)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Graph Theory and Algorithms
Keywords
lines, graph embedding, edge sampling, stochastic gradient descent, node classification, link prediction, network visualization, social networks, citation networks, language network

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review