arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.04206cs.SIcs.IRcs.LG
收藏

QUINT:使用网络散列的节点嵌入

QUINT: Node embedding using network hashing

IIIT-Delhi(德里印度理工学院);Indian Institute of Technology, Mandi(曼迪印度理工学院);National University of Singapore(新加坡国立大学)

Debajyoti Bera, Rameshwar Pratap, Bhisham Dev Verma, Biswadeep Sen, Tanmoy Chakraborty

摘要:

使用网络嵌入的表示学习由于其解决下游任务的有效性而受到极大的关注。流行的嵌入方法(如deepwalk,node 2 vec,LINE)基于神经架构,因此在时间和空间使用方面都无法在大型网络上扩展。最近,我们提出了BinSketch,一种用于将二进制向量压缩为二进制向量的草图技术。在本文中,我们展示了如何扩展BinSketch并将其用于网络哈希。我们名为QUINT的建议是建立在BinSketch上的,它使用简单的双向操作将稀疏网络的节点嵌入到低维空间中。QUINT是同类产品中的第一个,它在速度和空间使用方面提供了巨大的收益,而不会对下游任务的准确性造成太大影响。进行了大量的实验比较QUINT与七个国家的最先进的网络嵌入方法的两个终端任务-链接预测和节点分类。我们观察到QUINT在加速(高达7000倍)和节省空间(高达80倍)方面的巨大性能增益,这是由于其逐位特性来获得节点嵌入。此外,QUINT在所有数据集的基线任务中始终表现出色。我们的经验观察得到了严格的理论分析的支持,以证明QUINT的有效性。特别地,我们证明了QUINT保留了足够的结构信息,这些信息可以进一步用于以高置信度近似网络的许多拓扑性质。

英文摘要:

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 gain for QUINT in terms of speedup (up to 7000x) and space saving (up to 80x) due to its bit-wise nature to obtain node embedding. Moreover, QUINT is a consistent top-performer for both the tasks among the baselines across all the datasets. Our empirical observations are backed by rigorous theoretical analysis to justify the effectiveness of QUINT. In particular, we prove that QUINT retains enough structural information which can be used further to approximate many topological properties of networks with high confidence.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑