arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.09120cs.LG
收藏

SAS:一种简单、准确、可扩展的节点分类算法

SAS: A Simple, Accurate and Scalable Node Classification Algorithm

ShanghaiTech University(上海科技大学)

Ziyuan Wang, Feiming Yang, Rui Fan

摘要:

图神经网络已经实现了用于图节点分类的最先进的准确性。然而,GNN很难扩展到大型图,例如,即使在中等大小的图上也经常遇到内存不足的错误。最近的工作试图使用两阶段的方法来解决这个问题,该方法首先沿着图边缘聚集数据,然后在不使用额外的图信息的情况下训练分类器。这些方法可以在更大的图上运行,并且比GNN快几个数量级,但分类精度较低。我们提出了一个新的两阶段算法的基础上,一个简单但有效的观察:我们应该首先训练分类器,然后聚集,而不是相反。我们证明了我们的算法比现有的两阶段算法更快,可以处理更大的图,同时实现与流行的GNN相当或更高的准确性。我们还提出了一个理论基础来解释我们的算法的准确性提高,通过给出一个合成的非线性数据集,其中在分类之前进行聚合实际上会降低准确性,而我们的分类然后聚合方法与单独分类相比大大提高了准确性。

英文摘要:

Graph neural networks have achieved state-of-the-art accuracy for graph node classification. However, GNNs are difficult to scale to large graphs, for example frequently encountering out-of-memory errors on even moderate size graphs. Recent works have sought to address this problem using a two-stage approach, which first aggregates data along graph edges, then trains a classifier without using additional graph information. These methods can run on much larger graphs and are orders of magnitude faster than GNNs, but achieve lower classification accuracy. We propose a novel two-stage algorithm based on a simple but effective observation: we should first train a classifier then aggregate, rather than the other way around. We show our algorithm is faster and can handle larger graphs than existing two-stage algorithms, while achieving comparable or higher accuracy than popular GNNs. We also present a theoretical basis to explain our algorithm's improved accuracy, by giving a synthetic nonlinear dataset in which performing aggregation before classification actually decreases accuracy compared to doing classification alone, while our classify then aggregate approach substantially improves accuracy compared to classification alone.

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

↑