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

用于机器学习的图拓扑推理基准

Graph topology inference benchmarks for machine learning

IMT Atlantique(大西洋国立高等工业技术与矿业学校);University of Rochester(罗切斯特大学)

Carlos Lassance, Vincent Gripon, Gonzalo Mateos

摘要:

图现在在信号处理和机器学习领域中无处不在。作为用于表达对象之间的关系的工具,图可以被部署到各种目的:I)顶点的聚类,II)顶点的半监督分类,III)图信号的监督分类,以及IV)图信号的去噪。然而,在许多实际情况下,图表并不明确,因此必须从数据中推断。验证是一项具有挑战性的工作,自然取决于学习图形的下游任务。因此,通常难以比较不同算法的功效。在这项工作中,我们介绍了几个易于使用和公开发布的基准,专门设计来揭示图推理方法的相对优点和局限性。我们还对比了文献中一些最突出的技术。

英文摘要:

Graphs are nowadays ubiquitous in the fields of signal processing and machine learning. As a tool used to express relationships between objects, graphs can be deployed to various ends: I) clustering of vertices, II) semi-supervised classification of vertices, III) supervised classification of graph signals, and IV) denoising of graph signals. However, in many practical cases graphs are not explicitly available and must therefore be inferred from data. Validation is a challenging endeavor that naturally depends on the downstream task for which the graph is learnt. Accordingly, it has often been difficult to compare the efficacy of different algorithms. In this work, we introduce several ease-to-use and publicly released benchmarks specifically designed to reveal the relative merits and limitations of graph inference methods. We also contrast some of the most prominent techniques in the literature.

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

↑