Abstract
Although there are many existing alternative methods for using structural characterizations of undirected graphs for embedding, clustering and classification problems, there is relatively little literature aimed at dealing with such problems for directed graphs. In this paper we present a novel method for characterizing graph structure that can be used to embed directed graphs into a feature space. The method commences from a characterization based on the distribution of the von Neumann entropy of a directed graph with the in and out-degree configurations associated with directed edges. We start from a recently developed expression for the von Neumann entropy of a directed graph, which depends on vertex in-degree and out-degree statistics, and thus obtain a multivariate edge-based distribution of entropy. We show how this distribution can be encoded as a multi-dimensional histogram, which captures the structure of a directed graph and reflects its complexity. By performing principal components analysis on a sample of histograms, we embed populations of directed graphs into a low dimensional space. Finally, we undertake experiments on both artificial and real-world data to demonstrate that our directed graph embedding method is effective in distinguishing different types of directed graphs.
Chapter PDF
Similar content being viewed by others
References
Dehmer, M., Mowshowitz, A., Emmert-Streib, F.: Advances in Network Complexity. Wiley-Blackwell (2013)
Han, L., Escolano, F., Hancock, E., Wilson, R.: Graph characterizations from von neumann entropy. Pattern Recognition Letters 33, 1958–1967 (2012)
Berwanger, D., Gradel, E., Kaiser, L., Rabinovich, R.: Entanglement and the complexity of directed graphs. Theoretical Computer Science 463, 2–25 (2012)
Ren, P., Wilson, R., Hancock, E.: Graph characterization via ihara coefficients. IEEE Transactions on Neural Networks 22, 233–245 (2011)
Bunke, H., Riesen, K.: Improving vector space embedding of graphs through feature selection algorithms. Pattern Recognition 44, 1928–1940 (2010)
Chen, M., Yang, Q., Tang, X.: Directed graph embedding. In: IJCAI, pp. 2707–2712 (2007)
Perrault-Joncas, D., Meliă, M.: Directed graph embedding: an algorithm based on continuous limits of laplacian-type operators. Advances in Neural Information Processing Systems 24, 990–998 (2011)
Ye, C., Wilson, R.C., Comin, C.H., da F. Costa, L., Hancock, E.R.: Entropy and heterogeneity measures for directed graphs. In: Hancock, E., Pelillo, M. (eds.) SIMBAD 2013. LNCS, vol. 7953, pp. 219–234. Springer, Heidelberg (2013)
Passerini, F., Severini, S.: The von neumann entropy of networks. Inthernational Journal of Agent Technologies and Systems, 58–67 (2008)
Chung, F.: Laplacians and the cheeger inequailty for directed graphs. Annals of Combinatorics 9, 1–19 (2005)
Nene, A., Nayar, S., Murase, H.: Columbia object image library (coil-20). Technical Report (CUCS-005-96) (February 1996)
Riesen, K., Bunke, H.: IAM graph database repository for graph based pattern recognition and machine learning. In: da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) SSPR&SPR 2008. LNCS, vol. 5342, pp. 287–297. Springer, Heidelberg (2008)
Platt, J.: Sequential Minimal Optimization: A Fast Algorithm for Training Support Vector Machines. MIT Press (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ye, C., Wilson, R.C., Hancock, E.R. (2014). Entropic Graph Embedding via Multivariate Degree Distributions. In: Fränti, P., Brown, G., Loog, M., Escolano, F., Pelillo, M. (eds) Structural, Syntactic, and Statistical Pattern Recognition. S+SSPR 2014. Lecture Notes in Computer Science, vol 8621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44415-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-662-44415-3_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44414-6
Online ISBN: 978-3-662-44415-3
eBook Packages: Computer ScienceComputer Science (R0)