Search Efficient Binary Network Embedding

by   Daokun Zhang, et al.

Traditional network embedding primarily focuses on learning a dense vector representation for each node, which encodes 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 dense vector representations are inefficient for large-scale similarity search, which requires to find the nearest neighbor measured by Euclidean distance in a continuous vector space. In this paper, we propose a search efficient binary network embedding algorithm called BinaryNE to learn a sparse 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 efficiently 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-wise comparisons to support much quicker network node search compared to Euclidean distance or other distance measures. Our experiments and comparisons show that BinaryNE not only delivers more than 23 times faster search speed, but also provides comparable or better search quality than traditional continuous vector based network embedding methods.



There are no comments yet.


page 4

page 5

page 6

page 8

page 9

page 10

page 11

page 12


Attributed Network Embedding via Subspace Discovery

Network embedding aims to learn a latent, low-dimensional vector represe...

struc2gauss: Structure Preserving Network Embedding via Gaussian Embedding

Network embedding (NE) is playing a principal role in network mining, du...

Node Centralities and Classification Performance for Characterizing Node Embedding Algorithms

Embedding graph nodes into a vector space can allow the use of machine l...

A Model of Optimal Network Structure for Decentralized Nearest Neighbor Search

One of the approaches for the nearest neighbor search problem is to buil...

Comparing apples to apples in the evaluation of binary coding methods

We discuss methodological issues related to the evaluation of unsupervis...

node2bits: Compact Time- and Attribute-aware Node Representations for User Stitching

Identity stitching, the task of identifying and matching various online ...

Recurrent Binary Embedding for GPU-Enabled Exhaustive Retrieval from Billion-Scale Semantic Vectors

Rapid advances in GPU hardware and multiple areas of Deep Learning open ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.