node2vec:可扩展的网络特征学习
node2vec: Scalable Feature Learning for Networks
摘要:
在网络中的节点和边上的预测任务需要在学习算法使用的工程特征方面进行仔细的努力。最近在更广泛的表示学习领域的研究已经在通过学习特征本身来自动预测方面取得了重大进展。然而,目前的特征学习方法没有足够的表达能力来捕捉网络中观察到的连接模式的多样性。在这里,我们提出了node2vec,一个算法框架,用于学习网络中节点的连续特征表示。在node2vec中,我们学习节点到低维特征空间的映射,该映射最大化保留节点的网络邻域的可能性。我们定义了一个灵活的概念,一个节点的网络邻域,并设计了一个有偏的随机游走过程,有效地探索不同的社区。我们的算法概括了以前的工作,这是基于刚性的概念网络的邻居,我们认为,增加的灵活性,探索社区是学习更丰富的表示的关键。我们证明了node2vec在多标签分类和链接预测在几个现实世界的网络从不同的领域现有的国家的最先进的技术的功效。总之,我们的工作代表了一种新的方法,可以有效地学习复杂网络中最先进的任务无关表示。
英文摘要:
Prediction tasks over nodes and edges in networks require careful effort in engineering features used by learning algorithms. Recent research in the broader field of representation learning has led to significant progress in automating prediction by learning the features themselves. However, present feature learning approaches are not expressive enough to capture the diversity of connectivity patterns observed in networks. Here we propose node2vec, an algorithmic framework for learning continuous feature representations for nodes in networks. In node2vec, we learn a mapping of nodes to a low-dimensional space of features that maximizes the likelihood of preserving network neighborhoods of nodes. We define a flexible notion of a node's network neighborhood and design a biased random walk procedure, which efficiently explores diverse neighborhoods. Our algorithm generalizes prior work which is based on rigid notions of network neighborhoods, and we argue that the added flexibility in exploring neighborhoods is the key to learning richer representations. We demonstrate the efficacy of node2vec over existing state-of-the-art techniques on multi-label classification and link prediction in several real-world networks from diverse domains. Taken together, our work represents a new way for efficiently learning state-of-the-art task-independent representations in complex networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。