Labeling small-degree nodes promotes semi-supervised community detection on graph convolutional network

Yu Zhao (), Huiyao Li () and Bo Yang ()
Additional contact information
Yu Zhao: Kunming University of Science and Technology
Huiyao Li: Kunming University of Science and Technology
Bo Yang: Kunming University of Science and Technology

The European Physical Journal B: Condensed Matter and Complex Systems, 2024, vol. 97, issue 11, 1-18

Abstract: Abstract Community structure is one of the most important characteristics of network, which can reveal the internal organization structure of nodes. Many algorithms have been proposed to identify community structures in networks. However, the classification accuracy of existing unsupervised community detection algorithms is generally low. Therefore, the semi-supervised community detection algorithm which can greatly improve the classification accuracy by introducing a small number of labeled nodes has attracted much attention. Nevertheless, previous studies were sketchy in terms of label rates and also ignored the variation of classification accuracy under different labeling strategies. In this paper, based on graph convolutional networks, we first study the effect of labeling strategies and label rates on classification accuracy in four real world networks in detail. The research phenomenon is counter-intuitive but surprisingly effective: the classification accuracy of labeling small-degree nodes or random-selection nodes is significantly higher than that of labeling high-degree nodes. The labeling strategies based on acquaintance immune algorithm also prove this result. The interesting question that arises is what topological properties of the network can lead to such results? So we test and verify it in two kinds of synthetic networks. It is found that the phenomenon which labeling small-degree nodes promotes classification accuracy can be observed when the degree distribution of the network follows power-law distribution and the ratio of the external edges of the community to the total edges of nodes in the network is small. Graphical abstract

Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1140/epjb/s10051-024-00817-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:eurphb:v:97:y:2024:i:11:d:10.1140_epjb_s10051-024-00817-x

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/10051

DOI: 10.1140/epjb/s10051-024-00817-x

Access Statistics for this article

The European Physical Journal B: Condensed Matter and Complex Systems is currently edited by P. Hänggi and Angel Rubio

More articles in The European Physical Journal B: Condensed Matter and Complex Systems from Springer, EDP Sciences
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().