PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Weighted Graph Characteristics from Oriented Line Graph Polynomials
Peng Ren, Richard Wilson and Edwin Hancock
In: ICCV 2009, Sept 29 - Oct 2, 2009, Kyoto, Japan.

Abstract

We develop a novel method for extracting graph characteristics from edge-weighted graphs, based on an extension of the Ihara zeta function from unweighted to edgeweighted graphs. This is effected by generalizing the determinant form of the Ihara zeta function. We use the set of the reciprocal polynomial coefficients of the resulting Ihara zeta function, i.e. the Ihara coefficients, to construct our characterization. We also present a spectral analysis of the edge-weighted graph Ihara coefficients and indicate their advantages over graph spectral methods. Experimental results reveal that the Ihara coefficients are effective for the purpose of clustering edge-weighted graphs.

EPrint Type:Conference or Workshop Item (Poster)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Learning/Statistics & Optimisation
Theory & Algorithms
ID Code:6858
Deposited By:Edwin Hancock
Deposited On:08 April 2010