Graph Embedding Framework Based on Adversarial and Random Walk Regularization
Graph embedding aims to represent node structural as well as attribute information into a low-dimensional vector space so that some downstream application tasks such as node classification, link prediction, community detection, and recommendation can be easily performed by using simple machine learn...
Main Authors: | Wei Dou, Weiyu Zhang, Ziqiang Weng, Zhongxiu Xia |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2021-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9306765/ |
Similar Items
-
Graph Embedding via Graph Summarization
by: Jingyanning Yang, et al.
Published: (2021-01-01) -
SemanticGraph2Vec: Semantic graph embedding for text representation
by: Wael Etaiwi, et al.
Published: (2023-03-01) -
Graph Embedding Models: A Survey
by: YUAN Lining, LI Xin, WANG Xiaodong, LIU Zhao
Published: (2022-01-01) -
Adversarial Attention-Based Variational Graph Autoencoder
by: Ziqiang Weng, et al.
Published: (2020-01-01) -
Attributed Graph Embedding with Random Walk Regularization and Centrality-Based Attention
by: Yuxuan Yang, et al.
Published: (2023-04-01)