Please use this identifier to cite or link to this item: http://inaoe.repositorioinstitucional.mx/jspui/handle/1009/1594
Reducing the number of canonical form tests for frequent subgraph mining
ANDRÉS GAGO ALONSO
Jesús Ariel Carrasco Ochoa
José Francisco Martínez Trinidad
Acceso Abierto
Atribución-NoComercial-SinDerivadas
Data mining
Frequent patterns
Graph mining
Frequent subgraph
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.
Computación y Sistemas
2011
Artículo
Inglés
Estudiantes
Investigadores
Público en general
Gago-Alonso, A., et al., (2011). Reducing the number of canonical form tests for frequent subgraph mining, Computación y Sistemas, Vol. 15 (2): 251-265
CIENCIA DE LOS ORDENADORES
Versión aceptada
acceptedVersion - Versión aceptada
Appears in Collections:Artículos de Ciencias Computacionales

Upload archives


File SizeFormat 
6 Andres_2011_CompSistem15-2.pdf757.14 kBAdobe PDFView/Open