Graphlet Decomposition of a Weighted Network
Abstract
We consider the problem of modeling networks with nonnegative edge weights. We develop a \emphbit-string decomposition (BSD) for weighted networks, a new representation of social information based on social structure, with an underlying semi-parametric statistical model. We develop a scalable inference algorithm, which combines Expectation-Maximization with Bron-Kerbosch in a novel fashion, for estimating the model’s parameters from a network sample. We present theoretical descriptions to the computational complexity of the method. Finally, we demonstrate the performance of the proposed methodology for synthetic data, academic networks from Facebook and finding communities in a historical data from 19th century.
Cite
Text
Soufiani and Airoldi. "Graphlet Decomposition of a Weighted Network." Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, 2012.Markdown
[Soufiani and Airoldi. "Graphlet Decomposition of a Weighted Network." Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, 2012.](https://mlanthology.org/aistats/2012/soufiani2012aistats-graphlet/)BibTeX
@inproceedings{soufiani2012aistats-graphlet,
title = {{Graphlet Decomposition of a Weighted Network}},
author = {Soufiani, Hossein Azari and Airoldi, Edo},
booktitle = {Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics},
year = {2012},
pages = {54-63},
volume = {22},
url = {https://mlanthology.org/aistats/2012/soufiani2012aistats-graphlet/}
}