swMATH ID: 32343
Software Authors: K. Henderson, B. Gallagher, T. Eliassi-Rad, H. Tong, S. Basu, L. Akoglu, D. Koutra, C. Faloutsos, L. Li
Description: RolX: structural role extraction & mining in large graphs. Given a network, intuitively two nodes belong to the same role if they have similar structural behavior. Roles should be automatically determined from the data, and could be, for example, ”clique-members,” ”periphery-nodes,” etc. Roles enable numerous novel and useful network-mining tasks, such as sense-making, searching for similar nodes, and node classification. This paper addresses the question: Given a graph, how can we automatically discover roles for nodes? We propose RolX (Role eXtraction), a scalable (linear in the number of edges), unsupervised learning approach for automatically extracting structural roles from general network data. We demonstrate the effectiveness of RolX on several network-mining tasks: from exploratory data analysis to network transfer learning. Moreover, we compare network role discovery with network community discovery. We highlight fundamental differences between the two (e.g., roles generalize across disconnected networks, communities do not); and show that the two approaches are complimentary in nature
Homepage: https://dl.acm.org/doi/10.1145/2339530.2339723
Source Code:  https://github.com/snap-stanford/snap/tree/master/examples/rolx
Related Software: node2vec; SNAP; Python; struc2vec; GraRep; PyTorch; Temporal_Eigenvector_Centrality; subgraph2vec; FastDTW; PyGSP; NumPy; FSCNMF; NodeSketch; GL2vec; SINE; SciPy; TensorFlow; Scikit; NetLSD; graph2vec
Cited in: 7 Publications

Citations by Year