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

Fuld beskrivelse

Na minha lista:
Bibliografiske detaljer
Udgivet i:Computación y Sistemas
Main Authors: Andrés Gago Alonso, Jesús A. Carrasco Ochoa, José E. Medina Pagola, José F. Martínez Trinidad
Format: Artigo
Sprog:Inglês
Udgivet: Instituto Politécnico Nacional 2011
Fag:
Computación
Data mining
graph mining
frequent patterns
frequent subgraph
Online adgang:https://www.redalyc.org/articulo.oa?id=61520938010
Tags: Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!

Lignende værker