返回
Compact network embedding for fast node classification
DOI:10.1016/j.patcog.2022.109236.png)
摘要
En 中文
Network embedding has shown promising performance in real-world applications. The network embed-ding typically lies in a continuous vector space, where storage and computation costs are high, especially in large-scale applications. This paper proposes more compact representation to fulfill the gap. The pro-posed discrete network embedding (DNE) leverages hash code to represent node in Hamming space. The Hamming similarity between hash codes approximates the ground-truth similarity. The embedding and classifier are jointly learned to improve compactness and discrimination. The proposed multi-class classi-fier is further constrained to be discrete to expedite classification. In addition, this paper further extends DNE and proposes deep discrete attributed network embedding (DDANE) to learn compact deep embed-ding from more informative attributed network. From the perspective of generalized signal smoothing, the proposed DDANE trains an improved graph convolutional network autoencoder to effectively lever-age node attribute and network structure. Extensive experiments on node classification demonstrate the proposed methods exhibit lower storage and computational complexity than state-of-the-art network em-bedding methods, and achieve satisfactory accuracy.(c) 2022 Elsevier Ltd. All rights reserved.
Keyword:
Network embedding
Hashing
Compact representation
Graph
期刊
IF:
7.6
论文数:
1.4W
被引数:
6.1W
机构
引用论文
A simple graph embedding for anomaly detection in a stream of heterogeneous labeled graphs用于异构标记图流中异常检测的简单图嵌入
PATTERN RECOGNITION
IF7.6
Graph variational auto-encoder for deriving EEG-based graph emb e dding用于推导基于EEG的图形嵌入的图形变分自动编码器
PATTERN RECOGNITION
IF7.6

