RolX: structural role extraction & mining in large graphs

Abstract

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 <i>roles</i> for nodes? We propose <i>RolX (Role eXtraction)</i>, 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 <i>RolX</i> 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.

DOI: 10.1145/2339530.2339723

Extracted Key Phrases

14 Figures and Tables

010203020132014201520162017
Citations per Year

100 Citations

Semantic Scholar estimates that this publication has 100 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Henderson2012RolXSR, title={RolX: structural role extraction & mining in large graphs}, author={Keith Henderson and Brian Gallagher and Tina Eliassi-Rad and Hanghang Tong and Sugato Basu and Leman Akoglu and Danai Koutra and Christos Faloutsos and Lei Li}, booktitle={KDD}, year={2012} }