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

Description complète

Enregistré dans:
Détails bibliographiques
Publié dans:Computación y Sistemas
Auteurs principaux: Andrés Gago Alonso, Jesús A. Carrasco Ochoa, José E. Medina Pagola, José F. Martínez Trinidad
Format: Artigo
Langue:Inglês
Publié: Instituto Politécnico Nacional 2011
Sujets:
Computación
Data mining
graph mining
frequent patterns
frequent subgraph
Accès en ligne:https://www.redalyc.org/articulo.oa?id=61520938010
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires