.png){kind=icon}
返回
HashWalk: An efficient node classification method based on clique-compressed graph embedding
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2022.02.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In recent years, random walk based embedding has become a popular method for node classification. However, current methods still require a huge computational cost to obtain the representation of a large number of nodes. In addition, walking methods cannot adapt well to diverse network structures. Hence, this paper proposes HashWalk to generate a clique-compressed graph that can be used in random walk based embedding for node classification. Specifically, HashWalk compresses cliques into single nodes, and these single nodes are able to inherit neighbors of cliques. As a result, HashWalk can significantly reduce the number of training nodes and computational cost. Besides, HashWalk uses the random walk mapping method to obtain walking sequences of the clique-compressed graph, which makes random walk adapt to network structure. The experimental results prove that HashWalk provides faster time efficiency and lower space complexity while ensuring the accuracy. In summary, this paper provides a fast and effective method using clique-compressed graph embedding for node classification.(c) 2022 Elsevier B.V. All rights reserved.
Keyword:
Node classification
Clique
Graph embedding
Random walk
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
引用论文
A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications图嵌入的综合调查: 问题，技术和应用
OAAI
OAAI分享收藏分享收藏A large-scale evaluation of computational protein function prediction计算蛋白质功能预测的大规模评估.png)
NATURE METHODSOAAI
NATURE METHODSIF32.1
OAAI分享收藏
查看更多内容