Abstract
In a previous work we have uncovered some of the most informative spectral features (Commute Times, Fiedler eigenvector, Perron-Frobenius eigenvector and Node Centrality) for graph discrimination. In this paper we propose a method which exploits information geometry (manifolds and geodesics) to characterize graphlets with covariance matrices involving the latter features. Once we have the vectorized covariance matrices in the tangent space each graph is characterized by a population of vectors in such space. Then we exploit bypass information-theoretic measures for estimating the dissimilarities between populations of vectors. We test this measure in a very challenging database (GatorBait).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Yan, X., Yu, P.S., Han, J.: Graph Indexing: A Frequent Structure-based Approach. In: Proc. of SIGMOD 2004 (2004)
Zou, L., Chen, L., Zhang, H., Lu, Y.S., Lou, Q.: Summarization graph indexing: Beyond frequent structure-based approach. In: Haritsa, J.R., Kotagiri, R., Pudi, V. (eds.) DASFAA 2008. LNCS, vol. 4947, pp. 141–155. Springer, Heidelberg (2008)
Shokoufandeh, A., Macrini, D., Dickinson, S., Siddiqi, K., Zucker, S.W.: Indexing Hierarchical Structures Using Graph Spectra. IEEE Trans. on PAMI 27(7), 1125–1140 (2005)
Escolano, F., Lozano, M.A., Hancock, E.R., Giorgi, D.: What is the complexity of a network? The heat flow-thermodynamic depth approach. In: Hancock, E.R., Wilson, R.C., Windeatt, T., Ulusoy, I., Escolano, F. (eds.) SSPR&SPR 2010. LNCS, vol. 6218, pp. 286–295. Springer, Heidelberg (2010)
Escolano, F., Giorgi, D., Hancock, E.R., Lozano, M.A., Falcidieno, B.: Flow Complexity: Fast Polytopal Graph Complexity and 3D Object Clustering. In: Torsello, A., Escolano, F., Brun, L. (eds.) GbRPR 2009. LNCS, vol. 5534, pp. 253–262. Springer, Heidelberg (2009)
Bonev, B., Escolano, F., Giorgi, D., Biasotti, S.: High-dimensional spectral feature selection for 3D object recognition based on reeb graphs. In: Hancock, E.R., Wilson, R.C., Windeatt, T., Ulusoy, I., Escolano, F. (eds.) SSPR&SPR 2010. LNCS, vol. 6218, pp. 119–128. Springer, Heidelberg (2010)
Kondor, R., Shervashidze, N., Borgwardt, K.M.: The Graphlet Spectrum Proc. of ICML 2009 (2009)
Tuzel, O., Porikli, F., Meer, P.: Pedestrian Detection via Classification on Riemannian Manifolds. IEEE Trans. on PAMI 30(10), 1–15 (2008)
Pennec, X., Fillard, P., Ayache, N.: A Riemannian Framework for Tensor Computing. IJCV 38(1), 41–66 (2006)
Qiu, H., Hancock, E.R.: Clustering and Embedding Using Commute Times. IEEE Trans. on PAMI 29(11), 1873–1890 (2007)
Estrada, E., Rodrguez-Velázquez, J.A.: Subgraph centrality in complex networks. Physical Review E 71, 56103 (2005)
Escolano, F., Lozano, M.A., Bonev, B., Suau, P.: Bypass Information-Theoretic Shape Similarity from Non-rigid Points-based Alignment. In: Proc. of CVPR Workshops, NORDIA (2010)
Henze, N., Penrose, M.: On the multi-variate runs test. Annals of statistics 27, 290–298 (1999)
Friedman, J.H., Rafsky, L.C.: Mutivariate Generalization of the Wald-Wolfowitz and Smirnov Two-Sample Tests. Annals of Statistics 7(4), 697–717 (1979)
Stowell, D., Plumbley, M.D.: Fast Multidimensional Entropy Estimation by K-d Partitioning. IEEE Signal Processing Letters 16(6), 537–540 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Escolano, F., Bonev, B., Lozano, M.A. (2011). Information-Geometric Graph Indexing from Bags of Partial Node Coverages. In: Jiang, X., Ferrer, M., Torsello, A. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2011. Lecture Notes in Computer Science, vol 6658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20844-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-20844-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20843-0
Online ISBN: 978-3-642-20844-7
eBook Packages: Computer ScienceComputer Science (R0)