Search Efficient Binary Network Embedding

Abstract

Traditional network embedding primarily focuses on learning a continuous vector representation for each node, preserving network structure and/or node content information, such that off-the-shelf machine learning algorithms can be easily applied to the vector-format node representations for network analysis. However, the learned continuous vector representations are inefficient for large-scale similarity search, which often involves finding nearest neighbors measured by distance or similarity in a continuous vector space. In this paper, we propose a search efficient binary network embedding algorithm called BinaryNE to learn a binary code for each node, by simultaneously modeling node context relations and node attribute relations through a three-layer neural network. BinaryNE learns binary node representations through a stochastic gradient descent based online learning algorithm. The learned binary encoding not only reduces memory usage to represent each node, but also allows fast bit

Stats

• citations2
• S2 citations—
• github stars0
• HF likes0
• heat score3.58
• arxiv keyzhang2019search

Related papers

• QUINT: Node Embedding Using Network Hashing (2021)5.24
• End-to-end Binary Representation Learning Via Direct Binary Embedding (2017)5.84
• Compact Hash Code Learning With Binary Deep Neural Network (2017)9.03
• Embedding Compression With Hashing For Efficient Representation Learning In Large-scale Graph (2022)8.60
• Learning To Hash With Binary Deep Neural Network (2016)14.93
• Recurrent Binary Embedding For Gpu-enabled Exhaustive Retrieval From Billion-scale Semantic Vectors (2018)8.35
• Document Network Embedding: Coping For Missing Content And Missing Links (2019)0.00
• Fast Training Of Triplet-based Deep Binary Embedding Networks (2016)14.62