Graph labelling is a key activity of network science, with broad practical applications, and close relations to other network science tasks, such as community detection and clustering. While a large body of work exists on both unsupervised and supervised labelling algorithms, the class of random walk-based supervised algorithms requires further exploration, particularly given their relevance to social and political networks. This work proposes a new semi-supervised graph labelling method, the GLaSS method, that exactly calculates absorption probabilities for random walks on connected graphs, whereas previous methods rely on simulation and approximation. The proposed method models graphs exactly as a discrete time Markov chain, treating labelled nodes as absorbing states. The method is applied to a series of undirected graphs of roll call voting data from the United States House of Representatives. The GLaSS method is compared to existing supervised and unsupervised methods, demonstrating strong and consistent performance when estimating the labels of unlabelled nodes in graphs.
CITATION STYLE
Glonek, M., Tuke, J., Mitchell, L., & Bean, N. (2019). GLaSS: Semi-supervised Graph Labelling with Markov Random Walks to Absorption. In Studies in Computational Intelligence (Vol. 812, pp. 304–315). Springer Verlag. https://doi.org/10.1007/978-3-030-05411-3_25
Mendeley helps you to discover research relevant for your work.