Attributed Network Embedding in Streaming Style
Anbiao Wu, Ye Yuan, Changsheng Li, Yuliang Ma, Hao Zhang
Abstract
Attributed network embedding (ANE) can learn low-dimensional embeddings for nodes in attributed graphs, which can facilitate several data analysis tasks. However, the existing ANE methods fail to tackle scenarios involving the continuous generation of attributes. The ongoing generation of attributes accumulates numerous attributes, incurring high storage costs in existing methods. Furthermore, due to storage limitations, old attributes will be discarded as new ones are generated, existing methods struggle to integrate the new attribute information into embeddings generated from old attributes. Therefore, we propose a novel ANE framework named SANE (Streaming-style ANE), featuring a “memory” capability - that is, when updating the embeddings for new attributes, old attribute information can be partly preserved. In SANE, we first define forward and backward affinity between nodes and attributes by reviewing a node as source or target node. The definition guides quick computation of affinity vectors that integrate both topological and attribute information. Meanwhile, we propose an augmentation strategy to enrich node attribute information for enhance the quality of node embeddings. Leveraging the augmented attributes, we iteratively generate forward and backward affinity vectors, providing quantification of node-attribute affinity in two directions. Subsequently, we achieve a streaming-style update of node embeddings by employing matrix sketching technology on these iteratively generated vectors. Furthermore, capitalizing on the mergeability of matrix sketching, we efficiently integrate information of new generated attributes into node embeddings. Extensive experiments on 5 real datasets demonstrate that SANE surpasses the state-of-the-art algorithms in node classification and link prediction. SANE's ability to incorporate new attribute information into embeddings in a fast manner is validated through adequate simulation experiments.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 43b12b4a-8a8d-4aa5-921d-cb16105ce7e5Cited by top-tier papers2
- LLMLog: Advanced Log Template Generation via LLM-driven Multi-Round AnnotationFei Teng, Haoyang Li, Lei ChenVLDB 2025 · 2 citations
- Effective and Efficient Attributed Hypergraph Embedding on Nodes and HyperedgesYiran Li, Gongyao Guo, Chen Feng, Jieming ShiVLDB 2025 · 1 citation
Related papers
- Scaling Attributed Network Embedding to Massive GraphsRenchi Yang, Jieming Shi, Xiaokui Xiao, Yin Yang et al.VLDB 2021 · 62 citations
- SNEQ: Semi-Supervised Attributed Network Embedding with Attention-Based QuantisationTao He, Lianli Gao, Jingkuan Song, Xin Wang et al.AAAI 2020 · 12 citations
- Adaptive Graph Encoder for Attributed Graph EmbeddingGanqu Cui, Jie Zhou, Cheng Yang, Zhiyuan LiuKDD 2020 · 224 citations
- BiANE: Bipartite Attributed Network EmbeddingWentao Huang, Yuchen Li, Yuan Fang, Ju Fan et al.SIGIR 2020 · 43 citations
- Learning Based Proximity Matrix Factorization for Node EmbeddingXingyi Zhang, Kun Xie, Sibo Wang, Zengfeng HuangKDD 2021 · 30 citations
