skip to main content
10.1145/3341161.3342921acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
short-paper

Infinite motif stochastic blockmodel for role discovery in networks

Published: 15 January 2020 Publication History

Abstract

Role/block discovery is an essential task in network analytics so it has attracted significant attention recently. Previous studies on role discovery either relied on first or second-order structural information to group nodes but neglected the higher-order information or required the number of roles/blocks as the input which may be unknown in practice. To overcome these limitations, in this paper we propose a novel generative model, infinite motif stochastic blockmodel (IMM), for role discovery in networks. IMM takes advantage of high-order motifs in the generative process and it is a nonparametric Bayesian model which can automatically infer the number of roles. To validate the effectiveness of IMM, we conduct experiments on synthetic and real-world networks. The obtained results demonstrate IMM outperforms other blockmodels in role discovery task.

References

[1]
R. A. Rossi and N. K. Ahmed, "Role discovery in networks," IEEE TKDE, vol. 27, no. 4, pp. 1112--1131, 2015.
[2]
Y. Pei, J. Zhang, G. Fletcher, and M. Pechenizkiy, "Dynmf: role analytics in dynamic social networks," in IJCAI. AAAI Press, 2018, pp. 3818--3824.
[3]
P. W. Holland, K. B. Laskey, and S. Leinhardt, "Stochastic blockmodels: First steps," Social networks, vol. 5, no. 2, pp. 109--137, 1983.
[4]
E. M. Airoldi, D. M. Blei, S. E. Fienberg, and E. P. Xing, "Mixed membership stochastic blockmodels," Journal of machine learning research, vol. 9, no. Sep, pp. 1981--2014, 2008.
[5]
C. Kemp, J. B. Tenenbaum, T. L. Griffiths, T. Yamada, and N. Ueda, "Learning systems of concepts with an infinite relational model," in AAAI, vol. 3, 2006, p. 5.
[6]
K. Henderson, B. Gallagher, T. Eliassi-Rad, H. Tong, S. Basu, L. Akoglu, D. Koutra, C. Faloutsos, and L. Li, "Rolx: structural role extraction & mining in large graphs," in KDD. ACM, 2012, pp. 1231--1239.
[7]
G. Schwarz et al., "Estimating the dimension of a model," The annals of statistics, vol. 6, no. 2, pp. 461--464, 1978.
[8]
J. Rissanen, "Modeling by shortest data description," Automatica, vol. 14, no. 5, pp. 465--471, 1978.
[9]
S. P. Borgatti and M. G. Everett, "Notions of position in social network analysis," Sociological methodology, pp. 1--35, 1992.
[10]
J. Yin, Q. Ho, and E. P. Xing, "A scalable approach to probabilistic latent space inference of large-scale networks," in NIPS, 2013, pp. 422--430.
[11]
J. Pitman et al., "Combinatorial stochastic processes," Technical Report 621, Dept. Statistics, UC Berkeley, 2002. Lecture notes for, Tech. Rep., 2002.

Cited By

View all
  • (2023)Hyperbolic Node Structural Role Embedding2023 IEEE International Conference on Data Mining Workshops (ICDMW)10.1109/ICDMW60847.2023.00152(1162-1169)Online publication date: 4-Dec-2023
  • (2021)Role-Aware Modeling for N-ary Relational Knowledge BasesProceedings of the Web Conference 202110.1145/3442381.3449874(2660-2671)Online publication date: 19-Apr-2021

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ASONAM '19: Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
August 2019
1228 pages
ISBN:9781450368681
DOI:10.1145/3341161
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

In-Cooperation

  • IEEE CS

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 January 2020

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Short-paper

Conference

ASONAM '19
Sponsor:

Acceptance Rates

ASONAM '19 Paper Acceptance Rate 41 of 286 submissions, 14%;
Overall Acceptance Rate 116 of 549 submissions, 21%

Upcoming Conference

KDD '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 03 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Hyperbolic Node Structural Role Embedding2023 IEEE International Conference on Data Mining Workshops (ICDMW)10.1109/ICDMW60847.2023.00152(1162-1169)Online publication date: 4-Dec-2023
  • (2021)Role-Aware Modeling for N-ary Relational Knowledge BasesProceedings of the Web Conference 202110.1145/3442381.3449874(2660-2671)Online publication date: 19-Apr-2021

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media