Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2501.00709v3

Help | Advanced Search

Computer Science > Machine Learning

arXiv:2501.00709v3 (cs)
[Submitted on 1 Jan 2025 (v1) , last revised 22 Jan 2025 (this version, v3)]

Title: KAN KAN Buff Signed Graph Neural Networks?

Title: KAN KAN 缓冲有符号图神经网络?

Authors:Muhieddine Shebaro, Jelena Tešić
Abstract: Graph Representation Learning aims to create effective embeddings for nodes and edges that encapsulate their features and relationships. Graph Neural Networks (GNNs) leverage neural networks to model complex graph structures. Recently, the Kolmogorov-Arnold Neural Network (KAN) has emerged as a promising alternative to the traditional Multilayer Perceptron (MLP), offering improved accuracy and interpretability with fewer parameters. In this paper, we propose the integration of KANs into Signed Graph Convolutional Networks (SGCNs), leading to the development of KAN-enhanced SGCNs (KASGCN). We evaluate KASGCN on tasks such as signed community detection and link sign prediction to improve embedding quality in signed networks. Our experimental results indicate that KASGCN exhibits competitive or comparable performance to standard SGCNs across the tasks evaluated, with performance variability depending on the specific characteristics of the signed graph and the choice of parameter settings. These findings suggest that KASGCNs hold promise for enhancing signed graph analysis with context-dependent effectiveness.
Abstract: 图表示学习旨在创建有效的节点和边嵌入,这些嵌入包含它们的特征和关系。图神经网络(GNNs)利用神经网络来建模复杂的图结构。最近,Kolmogorov-Arnold神经网络(KAN)作为一种传统多层感知器(MLP)的有前途的替代方案出现,它在参数更少的情况下提供了更高的准确性和可解释性。在本文中,我们提出将KAN集成到有符号图卷积网络(SGCNs)中,从而开发出增强的KAN-SGCNs(KASGCN)。我们在有符号社区检测和链接符号预测等任务上评估KASGCN,以提高有符号网络中的嵌入质量。我们的实验结果表明,KASGCN在所评估的任务中表现出与标准SGCNs相当或具有竞争力的性能,性能变化取决于有符号图的具体特征和参数设置的选择。这些发现表明,KASGCNs在具有上下文依赖性的有效性方面有望增强有符号图分析。
Subjects: Machine Learning (cs.LG)
Cite as: arXiv:2501.00709 [cs.LG]
  (or arXiv:2501.00709v3 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2501.00709
arXiv-issued DOI via DataCite

Submission history

From: Muhieddine Shebaro [view email]
[v1] Wed, 1 Jan 2025 03:12:18 UTC (463 KB)
[v2] Tue, 14 Jan 2025 09:05:54 UTC (463 KB)
[v3] Wed, 22 Jan 2025 07:55:26 UTC (518 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
cs.LG
< prev   |   next >
new | recent | 2025-01
Change to browse by:
cs

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号