An Information Theoretic Approach to Learning Generative Graph Prototypes
We present a method for constructing a generative model for sets of graphs by adopting a minimum description length approach. The method is posed in terms of learning a generative supergraph model from which the new samples can be obtained by an appropriate sampling mechanism. We commence by constructing a probability distribution for the occurrence of nodes and edges over the supergraph. We encode the complexity of the supergraph using the von-Neumann entropy. A variant of EM algorithm is developed to minimize the description length criterion in which the node correspondences between the sample graphs and the supergraph are treated as missing data.The maximization step involves updating both the node correspondence information and the structure of supergraph using graduated assignment. In the experimental part, we demonstrate the practical utility of our proposed algorithm and show that our generative model gives good graph classification results. Besides, we show how to perform graph clustering with Jensen-Shannon kernel and generate new sample graphs.
KeywordsMinimum Description Length Posteriori Probability Sample Graph Median Graph Laplacian Spectrum
Unable to display preview. Download preview PDF.
- 1.Friedman, N., Koller, D.: Being Bayesian about network structure.A Bayesian approach to structure discovery in Bayesian networks. Machine Learning, 95–125 (2003)Google Scholar
- 8.White, D., Wilson, R.C.: Parts based generative models for graphs. In: ICPR, pp. 1–4 (2008)Google Scholar
- 9.Rissanen, J.: Modelling by Shortest Data Description. Automatica, 465–471 (1978)Google Scholar
- 11.Passerini, F., Severini, S.: The von neumann entropy of networks, arXiv:0812.2597 (2008)Google Scholar
- 13.Grunwald, P.: Minimum Description Length Tutorial. In: Advances in Minimum Description Length: Theory and Applications (2005)Google Scholar
- 14.Bridle, J.S.: Training stochastic model recognition algorithms as networks can lead to maximum mutual information estimation of parameters. In: Advances in Neural Information Processing Systems, vol. 2, pp. 211–217 (1990)Google Scholar
- 18.Shi, J., Malik, J.: Normalized cuts and image segmentation. In: CVPR, pp. 731–737 (1997)Google Scholar
- 20.Nene, S.A., Nayar, S.K., Murase, H.: Columbiaobjectimagelibrary (COIL100). Technical Report CUCS-006-96. Department of Computer Science, Columbia University (1996)Google Scholar
- 23.Han, L., Wilson, R.C., Hancock, E.R.: A Supergraph-based Generative Model. In: ICPR, pp. 1566–1569 (2010)Google Scholar