PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Hypergraphs, Characteristic Polynomials and the Ihara Zeta Function
Peng Ren, Tatjana Aleksic, Richard Wilson and Edwin Hancock
In: CAIP 2009, 2-4 Sept 2009, Munster.


In this paper we make a characteristic polynomial analysis on hypergraphs for the purpose of clustering. Our starting point is the Ihara zeta function [8] which captures the cycle structure for hypergraphs. The Ihara zeta function for a hypergraph can be expressed in a determinant form as the reciprocal of the characteristic polynomial of the adjacency matrix for a transformed graph representation. Our hypergraph characterization is based on the coefficients of the characteristic polynomial, and can be used to construct feature vectors for hypergraphs. In the experimental evaluation, we demonstrate the effectiveness of the proposed characterization for clustering hypergraphs.

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