arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1810.09155cs.LGstat.ML
收藏

一种简单的图分类基线算法

A Simple Baseline Algorithm for Graph Classification

Telecom ParisTech(巴黎电信学院);Safran(赛峰集团)

Nathan de Lara, Edouard Pineau

摘要:

图分类最近受到了机器学习的各个领域的广泛关注,例如核方法,顺序建模或图嵌入。所有这些方法都提供了有希望的结果,但各自有不同的优点和缺点。然而,它们中的大多数依赖于复杂的数学,需要大量的计算能力才能实现最佳性能。我们提出了一个简单而快速的算法的基础上的谱分解的图拉普拉斯进行图分类,并获得第一个参考得分的数据集。我们表明,这种方法获得竞争力的结果相比,国家的最先进的算法。

英文摘要:

Graph classification has recently received a lot of attention from various fields of machine learning e.g. kernel methods, sequential modeling or graph embedding. All these approaches offer promising results with different respective strengths and weaknesses. However, most of them rely on complex mathematics and require heavy computational power to achieve their best performance. We propose a simple and fast algorithm based on the spectral decomposition of graph Laplacian to perform graph classification and get a first reference score for a dataset. We show that this method obtains competitive results compared to state-of-the-art algorithms.

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

↑