Kernelising the ihara zeta function

Authors:
Furqan Aziz;Richard C. Wilson;Edwin R. Hancock
Affiliations:
Department of Computer Science, The University of York, UK;Department of Computer Science, The University of York, UK;Department of Computer Science, The University of York, UK
Venue:
CAIP'11 Proceedings of the 14th international conference on Computer analysis of images and patterns - Volume Part I
Year:
2011

Citing 8
Cited 0

On a relation between graph edit distance and maximum common subgraph

Pattern Recognition Letters
Cyclic pattern kernels for predictive graph mining

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Shortest-Path Kernels on Graphs

ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Graph Characteristics from the Ihara Zeta Function

SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Approximate graph edit distance computation by means of bipartite graph matching

Image and Vision Computing
Hypergraphs, Characteristic Polynomials and the Ihara Zeta Function

CAIP '09 Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns
Cycle Kernel Based on Spanning Tree

ICECE '10 Proceedings of the 2010 International Conference on Electrical and Control Engineering
Quantum walks, Ihara zeta functions and cospectrality in regular graphs

Quantum Information Processing

Quantified Score

Hi-index	0.00

Visualization

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.