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 affec...

Descrición completa

Gardado en:
Detalles Bibliográficos
Publicado en:Computación y Sistemas
Main Authors: Andrés Gago Alonso, Jesús A. Carrasco Ochoa, José E. Medina Pagola, José F. Martínez Trinidad
Formato: Artigo
Idioma:Inglês
Publicado: Instituto Politécnico Nacional 2011
Assuntos:
Computación
Data mining
graph mining
frequent patterns
frequent subgraph
Acceso en liña:https://www.redalyc.org/articulo.oa?id=61520938010
Tags: Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!

Títulos similares