Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/136489
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | GLaSS: Semi-supervised graph labelling with Markov random walks to absorption |
Author: | Glonek, M. Tuke, S. Mitchell, L. Bean, N. |
Citation: | Studies in Computational Intelligence, 2019 / Aiello, L.M., Cherifi, C., Cherifi, H., Lambiotte, R., Lio, P., Rocha, L.M. (ed./s), vol.812, pp.304-315 |
Publisher: | Springer |
Publisher Place: | Cham, Switzerland |
Issue Date: | 2019 |
Series/Report no.: | Studies in Computational Intelligence; 812 |
ISBN: | 9783030054113 |
ISSN: | 1860-949X 1860-9503 |
Conference Name: | The 7th International Conference on Complex Networks and Their Applications (COMPLEX NETWORKS) (11 Dec 2018 - 13 Dec 2018 : Cambridge, UK) |
Editor: | Aiello, L.M. Cherifi, C. Cherifi, H. Lambiotte, R. Lio, P. Rocha, L.M. |
Statement of Responsibility: | Max Glonek, Jonathan Tuke, Lewis Mitchell, Nigel Bean |
Abstract: | 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. |
Keywords: | Community detection; Graph labelling; Random walk; Markov chain; Political networks |
Rights: | © 2019 Springer Nature Switzerland AG |
DOI: | 10.1007/978-3-030-05411-3_25 |
Grant ID: | http://purl.org/au-research/grants/arc/CE140100049 |
Published version: | https://link.springer.com/book/10.1007/978-3-030-05411-3 |
Appears in Collections: | Mathematical Sciences publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.