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

Descripció completa

Guardat en:
Dades bibliogràfiques
Publicat a:Computación y Sistemas
Autors principals: Andrés Gago Alonso, Jesús A. Carrasco Ochoa, José E. Medina Pagola, José F. Martínez Trinidad
Format: Artigo
Idioma:Inglês
Publicat: Instituto Politécnico Nacional 2011
Matèries:
Computación
Data mining
graph mining
frequent patterns
frequent subgraph
Accés en línia:https://www.redalyc.org/articulo.oa?id=61520938010
Etiquetes: Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!

Ítems similars