.png){kind=icon}
.png){kind=icon}
Return
SNCA: Semi-Supervised Node Classification for Evolving Large Attributed Graphs
.png){kind=icon}
OA
AI
DOI：10.26599/BDMA.2024.9020033.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Attributed graphs have an additional sign vector for each node. Typically, edge signs represent like or dislike relationship between the node pairs. This has applications in domains, such as recommender systems, personalised search, etc. However, limited availability of edge sign information in attributed networks requires inferring the underlying graph embeddings to fill-in the knowledge gap. Such inference is performed by way of node classification which aims to deduce the node characteristics based on the topological structure of the graph and signed interactions between the nodes. The study of attributed networks is challenging due to noise, sparsity, and class imbalance issues. In this work, we consider node centrality in conjunction with edge signs to contemplate the node classification problem in attributed networks. We propose Semi-supervised Node Classification in Attributed graphs (SNCA). SNCA is robust to underlying network noise, and has in-built class imbalance handling capabilities. We perform an extensive experimental study on real-world datasets to showcase the efficiency, scalability, robustness, and pertinence of the solution. The performance results demonstrate the suitability of the solution for large attributed graphs in real-world settings.
Keywords:
Training
Accuracy
Scalability
Noise
Probabilistic logic
Robustness
Vectors
attributed networks
node classification
recommender systems
Journal
IF:
6.2
Papers:
274
Citations:
1.0K
View more organizations