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

Полное описание

Сохранить в:
Библиографические подробности
Опубликовано в: :Computación y Sistemas
Главные авторы: Andrés Gago Alonso, Jesús A. Carrasco Ochoa, José E. Medina Pagola, José F. Martínez Trinidad
Формат: Artigo
Язык:Inglês
Опубликовано: Instituto Politécnico Nacional 2011
Предметы:
Computación
Data mining
graph mining
frequent patterns
frequent subgraph
Online-ссылка:https://www.redalyc.org/articulo.oa?id=61520938010
Метки: Добавить метку
Нет меток, Требуется 1-ая метка записи!

Схожие документы