DeepWalking回溯:从嵌入到图形
DeepWalking Backwards: From Embeddings Back to Graphs
摘要:
低维节点嵌入在分析图数据集中起着关键作用。然而,很少有人研究流行的嵌入方法到底编码了什么信息,以及这些信息如何与下游机器学习任务的性能相关。我们通过研究嵌入是否可以被反转以(近似)恢复用于生成它们的图来解决这个问题。专注于流行的DeepWalk方法的变体(Perozzi等人,2014; Qiu等人,2018),我们提出了用于精确嵌入反演的算法-即,从图G的低维嵌入,我们可以找到具有非常相似嵌入的图H。我们在真实世界的网络上进行了大量的实验,观察到关于G的重要信息,例如特定的边缘和三角形密度等整体属性,经常在H中丢失。然而,社区结构往往得到保留,甚至得到加强。我们的研究结果是更严格地理解关于输入图的信息嵌入编码以及为什么这些信息对学习任务有用的一步。
英文摘要:
Low-dimensional node embeddings play a key role in analyzing graph datasets. However, little work studies exactly what information is encoded by popular embedding methods, and how this information correlates with performance in downstream machine learning tasks. We tackle this question by studying whether embeddings can be inverted to (approximately) recover the graph used to generate them. Focusing on a variant of the popular DeepWalk method (Perozzi et al., 2014; Qiu et al., 2018), we present algorithms for accurate embedding inversion - i.e., from the low-dimensional embedding of a graph G, we can find a graph H with a very similar embedding. We perform numerous experiments on real-world networks, observing that significant information about G, such as specific edges and bulk properties like triangle density, is often lost in H. However, community structure is often preserved or even enhanced. Our findings are a step towards a more rigorous understanding of exactly what information embeddings encode about the input graph, and why this information is useful for learning tasks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。