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

论图形表示学习的可解释性与评价

On the Interpretability and Evaluation of Graph Representation Learning

Capital One(第一资本金融公司)

Antonia Gogoglou, C. Bayan Bruss, Keegan E. Hines

摘要:

随着人们对图表示学习的兴趣日益浓厚,已经提出了各种方法来有效地捕获图的属性。虽然与传统的图技术相比,这些方法提高了图机器学习任务的性能,但它们仍然被视为对这些表示中编码的信息具有有限洞察力的技术。在这项工作中,我们探索的方法来解释节点嵌入,并提出了一个强大的评估框架比较图表示学习算法和超参数的创建。我们在具有不同属性的图上测试了我们的方法,并研究了嵌入训练参数与产生的嵌入在下游任务中恢复原始图结构的能力之间的关系。

英文摘要:

With the rising interest in graph representation learning, a variety of approaches have been proposed to effectively capture a graph's properties. While these approaches have improved performance in graph machine learning tasks compared to traditional graph techniques, they are still perceived as techniques with limited insight into the information encoded in these representations. In this work, we explore methods to interpret node embeddings and propose the creation of a robust evaluation framework for comparing graph representation learning algorithms and hyperparameters. We test our methods on graphs with different properties and investigate the relationship between embedding training parameters and the ability of the produced embedding to recover the structure of the original graph in a downstream task.

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

↑