2018
DOI: 10.1109/tkde.2018.2807452
|View full text |Cite
|
Sign up to set email alerts
|

A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications

Abstract: Graph is an important data representation which appears in a wide diversity of real-world scenarios. Effective graph analytics provides users a deeper understanding of what is behind the data, and thus can benefit a lot of useful applications such as node classification, node recommendation, link prediction, etc. However, most graph analytics methods suffer the high computation and space cost. Graph embedding is an effective yet efficient way to solve the graph analytics problem. It converts the graph data int… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
885
0
3

Year Published

2018
2018
2024
2024

Publication Types

Select...
3
3
3

Relationship

0
9

Authors

Journals

citations
Cited by 1,658 publications
(945 citation statements)
references
References 87 publications
1
885
0
3
Order By: Relevance
“…While being accurate, training a supervised-learning model on the adjacency matrix (SL-A) can take some computational time and resources as the size of the molecular network increases, thus considerably differing in speed for, say, STRING-EXP (14,089 nodes and 141,629 unweighted edges) and GIANT-TN (25,689 nodes and 38,904,929 weighted edges). Worthy of note in this context is the recent excitement in deriving node embeddings for each node in a network, concisely encoding its connectivity to all other nodes, and using them as features in SL algorithms for node classification [60,[69][70][71][72][73][74] . Although we show that SL-A markedly outperforms supervised-learning on the embedding matrix (SL-E; Fig.…”
Section: Discussionmentioning
confidence: 99%
“…While being accurate, training a supervised-learning model on the adjacency matrix (SL-A) can take some computational time and resources as the size of the molecular network increases, thus considerably differing in speed for, say, STRING-EXP (14,089 nodes and 141,629 unweighted edges) and GIANT-TN (25,689 nodes and 38,904,929 weighted edges). Worthy of note in this context is the recent excitement in deriving node embeddings for each node in a network, concisely encoding its connectivity to all other nodes, and using them as features in SL algorithms for node classification [60,[69][70][71][72][73][74] . Although we show that SL-A markedly outperforms supervised-learning on the embedding matrix (SL-E; Fig.…”
Section: Discussionmentioning
confidence: 99%
“…In addition, many ecological datasets exhibit graph structure related to phylogenies, social networks, or network-like spatial structure. While it is possible to adapt convolutional neural networks to operate on distance matrices computed from graphs (Fioravanti et al 2018), there are a variety of graph representation learning approaches that provide embeddings for nodes that encode network structure and node attributes (Hamilton et al 2017;Cai et al 2018).…”
Section: Discussionmentioning
confidence: 99%
“…Comprehensive surveys of network embedding algorithms can be found elsewhere . There is an immense catalogue of algorithms, and code is distributed in a rushing pace (over 50 network embedding packages are available, many of them released during the last 2 years; https://github.com/chihming/awesome-network-embedding).…”
Section: Towards Biological Embeddingsmentioning
confidence: 99%
“…Comprehensive surveys of network embedding algorithms can be found elsewhere. 107,108,110 There is an immense catalogue of algorithms, and code is distributed in a rushing pace (over 50 network embedding packages are available, many of them released during the last 2 years; https://github.com/chihming/awesome-network-embedding). Families of successful network embedding algorithms include adjacency matrix factorizations (e.g., graph Laplacian eigenmaps), local linear embeddings, isomaps, and a series of deep learning implementations that address several scenarios, such as the case of attributed networks or the preservation of network structure and properties.…”
Section: Figurementioning
confidence: 99%