MKGCN: a novel multi-channel KAN-GCN model for scalable link prediction

Abstract Link Prediction (LP) is a classic topic in network science, aiming to predict missing and unknown links using existing network data. With the expansion of network scale and the sparsity of network structure, accurately predicting links among a vast number of node pairs has become a severe challenge. Traditional Graph Convolutional Network (GCN) emphasizes local features more during the message passing process. Increasing the number of network layers can collect more global and abstract features, but it also brings the risk of over-smoothing. Blindly increasing the size of hidden layers can also lead to an increase in model complexity and the danger of overfitting. To address this issue, we propose a Multi-channel KAN-GCN Model (MKGCN). It combines KAN and GCN and constructs of three GCN channels to capture feature information at different scales. Meanwhile, the model also introduces a new neural network based on the Kolmogorov-Arnold representation theorem - Kolmogorov-Arnold Network (KAN). Unlike the fixed activation functions used in Multi-layer perceptrons (MLPs), KAN adopts learnable activation functions, providing greater flexibility in capturing complex relationships in high-dimensional data. The MKGCN model maps and fuses features from different channels through KAN. Experimental results demonstrate that the proposed architecture achieves competitive results on eleven real-world network.

Authors

Publication Details

Journal
Physica Scripta
Published
2025-08-22
DOI
https://doi.org/10.1088/1402-4896/adfe9e
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

MKGCN: a novel multi-channel KAN-GCN model for scalable link prediction

Lihong Han, Kuan‐Ching Li, Jianxin Tang, Kan Yang
Physica Scripta
Complex Network Analysis Techniques
article

MKGCN: a novel multi-channel KAN-GCN model for scalable link prediction

Lihong Han, Kuan‐Ching Li, Jianxin Tang, Kan Yang
article en

Abstract

Abstract Link Prediction (LP) is a classic topic in network science, aiming to predict missing and unknown links using existing network data. With the expansion of network scale and the sparsity of network structure, accurately predicting links among a vast number of node pairs has become a severe challenge. Traditional Graph Convolutional Network (GCN) emphasizes local features more during the message passing process. Increasing the number of network layers can collect more global and abstract features, but it also brings the risk of over-smoothing. Blindly increasing the size of hidden layers can also lead to an increase in model complexity and the danger of overfitting. To address this issue, we propose a Multi-channel KAN-GCN Model (MKGCN). It combines KAN and GCN and constructs of three GCN channels to capture feature information at different scales. Meanwhile, the model also introduces a new neural network based on the Kolmogorov-Arnold representation theorem - Kolmogorov-Arnold Network (KAN). Unlike the fixed activation functions used in Multi-layer perceptrons (MLPs), KAN adopts learnable activation functions, providing greater flexibility in capturing complex relationships in high-dimensional data. The MKGCN model maps and fuses features from different channels through KAN. Experimental results demonstrate that the proposed architecture achieves competitive results on eleven real-world network.

Physica ScriptaVol. 100(9)
National Natural Science Foundation of China, National Social Science Fund of China, Science and Technology Program of Gansu Province, Science Fund for Distinguished Young Scholars of Gansu Province
Openalex Percentile: Top 83%
Complex Network Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.