Abstract
The Ihara Zeta Function, related to the number of prime cycles in a graph, is a powerful tool for graph clustering and characterization. In this paper we explore how to use the Ihara Zeta Function to define graph kernels. We propose to use the coefficients of reciprocal of Ihara Zeta Function for defining a kernel. The proposed kernel is then applied to graph clustering.
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
Bunke, H.: On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Lett. 18(8), 689–694 (1997)
Gärtner, T., Flach, P., Wrobel, S.: On graph kernels: Hardness results and efficient alternatives. In: Schölkopf, B., Warmuth, M.K. (eds.) COLT/Kernel 2003. LNCS (LNAI), vol. 2777, pp. 129–143. Springer, Heidelberg (2003)
Borgwardt, M., Kriegel, H.: Shortest-path kernels on graphs. In: Proceedings of 5th IEEE Internationl Conference on Data Mining (ICDM 2005), pp. 74–81 (2005)
Qiangrong, J., Hualan, L., Yuan, G.: Cycle kernel based on spanning tree. In: Proc. of International Conference on Electrical and Control Engineering 2010, pp. 656–659 (2010)
Horváth, T., Gärtner, T., Wrobel, S.: Cyclic pattern kernels for predictive graph mining. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery, pp. 158–167 (2004)
Ren, P., Wilson, R.C., Hancock, E.R.: Pattern vectors from the Ihara zeta function. In: 19th International Conference on Pattern Recognition, pp. 1–4 (2008)
Ren, P., Wilson, R.C., Hancock, E.R.: Graph Characteristics from the Ihara Zeta Function. In: da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) S+SSPR 2008. LNCS, vol. 5342, pp. 257–266. Springer, Heidelberg (2008)
Ren, P., Aleksić, T., Wilson, R.C., Hancock, E.R.: Hypergraphs, Characteristic Polynomials and the Ihara Zeta Function. In: Jiang, X., Petkov, N. (eds.) CAIP 2009. LNCS, vol. 5702, pp. 369–376. Springer, Heidelberg (2009)
Scott, G., Storm, C.K.: The coefficients of the Ihara Zeta Function. Involve - a Journal of Mathematics 1(2), 217–233 (2008)
Kotani, M., Sunada, T.: Zeta function of finite graphs. Journal of Mathematics, University of Tokyo 7(1), 7–25 (200)
Brooks, B.P.: The coefficients of the characteristic polynomial in terms of the eigenvalues and the elements of an n×n matrix. Applied Mathematics, 511–515 (2006)
Mihoubi, M.: Some congruences for the partial Bell polynomials Journal of Integer Sequences (2009)
Mizuno, H., Sato, I.: Zeta functions of diagraphs. Linear Algebra and its Applications 336, 181–190 (2001)
Ren, P., Aleksic, T., Emms, D., Wilson, R.C., Hancock, E.R.: Quantum walks, Ihara zeta functions and cospectrality in regular graphs. Quantum Information Processing (in press)
Bass, H.: The IharaSelberg zeta function of a tree lattice. Internat. J. Math, 717–797 (1992)
Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vision Comput., 950–959 (2009)
Harris, C., Stephens, M.: A combined corner and edge detector. In: Fourth Alvey Vision Conference, Manchester, UK, pp. 147–151 (1988)
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
Aziz, F., Wilson, R.C., Hancock, E.R. (2011). Kernelising the Ihara Zeta Function. In: Real, P., Diaz-Pernil, D., Molina-Abril, H., Berciano, A., Kropatsch, W. (eds) Computer Analysis of Images and Patterns. CAIP 2011. Lecture Notes in Computer Science, vol 6854. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23672-3_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-23672-3_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23671-6
Online ISBN: 978-3-642-23672-3
eBook Packages: Computer ScienceComputer Science (R0)