arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1902.11004cs.CLcs.LGcs.SI
收藏

节点表示的全局向量

Global Vectors for Node Representations

Université de Lyon, Lyon 2(里昂大学里昂第二大学)

Robin Brochier, Adrien Guille, Julien Velcin

摘要:

大多数网络嵌入算法都是通过随机游走来测量节点的同现,然后使用带负采样的Skip-Gram来学习嵌入。虽然它已被证明是一个相关的选择,但也有替代方案,如GloVe,尚未被研究用于网络嵌入。尽管SGNS比GloVe更好地处理非共现,但它的时间复杂度更差。在本文中,我们提出了一个矩阵分解方法的网络嵌入,GloVe的启发,更好地处理非同现具有竞争力的时间复杂度。我们还展示了如何扩展这个模型来处理网络节点的文件,同时学习单词,节点和文档表示。定量评估表明,我们的模型实现了最先进的性能,同时对超参数的选择不那么敏感。从质量上讲,我们展示了我们的模型如何通过生成互补的面向网络和面向内容的关键字来帮助探索文档网络。

英文摘要:

Most network embedding algorithms consist in measuring co-occurrences of nodes via random walks then learning the embeddings using Skip-Gram with Negative Sampling. While it has proven to be a relevant choice, there are alternatives, such as GloVe, which has not been investigated yet for network embedding. Even though SGNS better handles non co-occurrence than GloVe, it has a worse time-complexity. In this paper, we propose a matrix factorization approach for network embedding, inspired by GloVe, that better handles non co-occurrence with a competitive time-complexity. We also show how to extend this model to deal with networks where nodes are documents, by simultaneously learning word, node and document representations. Quantitative evaluations show that our model achieves state-of-the-art performance, while not being so sensitive to the choice of hyper-parameters. Qualitatively speaking, we show how our model helps exploring a network of documents by generating complementary network-oriented and content-oriented keywords.

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

↑