Reducing the Number of Canonical Form Tests for Frequent Subgraph Mining

Frequent connected subgraph (FCS) mining is an interesting problem with wide applications in real life. Most of the FCS mining algorithms have been focused on detecting duplicate candidates using canonical form tests. Canonical form tests have high computational complexity, and therefore, they affect the efficiency of graph miners. In this paper, we introduce novel properties to reduce the number of canonical form tests in FCS mining. Based on these properties, a new algorithm for FCS mining called gRed is presented. The experimentation on real world datasets shows the impact of the proposed properties on the efficiency of gRed reducing the number of canonical form tests regarding gSpan. Besides, the performance of our algorithm is compared against gSpan and other state-of-the-art algorithms.

Bibliographic Details

Main Authors:	Gago Alonso,Andrés, Carrasco Ochoa,Jesús A., Medina Pagóla,José E., Martínez Trinidad,José F
Format:	Digital revista
Language:	English
Published:	Instituto Politécnico Nacional, Centro de Investigación en Computación 2011
Online Access:	http://www.scielo.org.mx/scielo.php?script=sci_arttext&pid=S1405-55462011000400010
Tags:	Add Tag No Tags, Be the first to tag this record!