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

PropEnc:一种用于图神经网络的属性编码器

PropEnc: A Property Encoder for Graph Neural Networks

Vanderbilt University(范德堡大学);University of Texas at Dallas(德克萨斯大学达拉斯分校)

Anwar Said, Waseem Abbas, Xenofon Koutsoukos

AI总结:

针对无节点特征图中传统结构与位置编码受属性最大值限制的问题,提出 PropEnc 编码器,利用直方图与反向索引编码从任意图度量生成低维、高效且适应性强的节点特征。

摘要:

图机器学习,尤其是使用图神经网络时,严重依赖节点特征。然而,许多真实系统(例如社交网络和生物网络)由于隐私问题、数据不完整或采集限制而缺少节点特征。结构编码和位置编码通常被用于解决这一问题,但受到被编码属性最大值(例如最高节点度)的限制。这一局限使其不适用于无标度网络以及涉及大型或非类别属性的应用。本文介绍了 PropEnc,这是一种新颖且通用的编码器,可从任意图度量生成富有表达力的节点嵌入。通过将直方图构造与反向索引编码相结合,PropEnc 提供了一种灵活的解决方案,支持低维表示和多种输入类型,在有效缓解稀疏性问题的同时提高计算效率。此外,它能够复现 one-hot 编码或以高精度近似索引,从而可适应广泛的图应用。我们在多个缺少节点特征的社交网络上,通过图分类任务的大量实验验证了 PropEnc。实证结果表明,PropEnc 为从各种图度量构建节点特征提供了一种高效机制。

英文摘要:

Graph machine learning, particularly using graph neural networks, heavily relies on node features. However, many real-world systems, such as social and biological networks, lack node features due to privacy concerns, incomplete data, or collection limitations. Structural and positional encoding are commonly used to address this but are constrained by the maximum values of the encoded properties, such as the highest node degree. This limitation makes them impractical for scale-free networks and applications involving large or non-categorical properties. This paper introduces PropEnc, a novel and versatile encoder to generate expressive node embedding from any graph metric. By combining histogram construction with reversed index encoding, PropEnc offers a flexible solution that supports low-dimensional representations and diverse input types, effectively mitigating sparsity issues while improving computational efficiency. Additionally, it replicates one-hot encoding or approximates indices with high accuracy, making it adaptable to a wide range of graph applications. We validate PropEnc through extensive experiments on graph classification task across several social networks lacking node features. The empirical results demonstrate that PropEnc offers an efficient mechanism for constructing node features from various graph metrics.

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

↑