QUINT: Node Embedding Using Network Hashing

Abstract

Representation learning using network embedding has received tremendous attention due to its efficacy to solve downstream tasks. Popular embedding methods (such as deepwalk, node2vec, LINE) are based on a neural architecture, thus unable to scale on large networks both in terms of time and space usage. Recently, we proposed BinSketch, a sketching technique for compressing binary vectors to binary vectors. In this paper, we show how to extend BinSketch and use it for network hashing. Our proposal named QUINT is built upon BinSketch, and it embeds nodes of a sparse network onto a low-dimensional space using simple bi-wise operations. QUINT is the first of its kind that provides tremendous gain in terms of speed and space usage without compromising much on the accuracy of the downstream tasks. Extensive experiments are conducted to compare QUINT with seven state-of-the-art network embedding methods for two end tasks - link prediction and node classification. We observe huge performance ga

Stats

• citations4
• S2 citations—
• github stars0
• HF likes0
• heat score5.24
• arxiv keybera2021quint

Related papers

• Search Efficient Binary Network Embedding (2019)3.58
• Embedding Compression With Hashing For Efficient Representation Learning In Large-scale Graph (2022)8.60
• Position-based Hash Embeddings For Scaling Graph Neural Networks (2021)2.26
• Semi-supervised Network Embedding With Differentiable Deep Quantisation (2021)5.84
• VERSE: Versatile Graph Embeddings From Similarity Measures (2018)17.42
• Deep Hashing For Signed Social Network Embedding (2019)0.00
• Deep Kernel Supervised Hashing For Node Classification In Structural Networks (2020)6.34
• Hessian-aware Quantized Node Embeddings For Recommendation (2023)2.26