Buscar
Mostrando ítems 1-10 de 17
Reducing the number of canonical form tests for frequent subgraph mining
(Computación y Sistemas, 2011)
Reducing the Number of Canonical Form Tests for Frequent Subgraph Mining
(Revista Computación y Sistemas; Vol. 15 No. 2, 2011-12-13)
Abstract. 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 ...
Reducing the number of canonical form tests for frequent subgraph mining
(Computación y Sistemas, 2011)
Full duplicate candidate pruning for frequent connected subgraph mining
(IOS Press, 2010)
Full duplicate candidate pruning for frequent connected subgraph mining
(IOS Press, 2010)
Clasificación de imágenes basada en subconjuntos de subgrafos frecuentes aproximados
(Instituto Nacional de Astrofísica, Óptica y Electrónica, 2013)
Representative frequent approximate subgraph mining on multi-graph collections
(Instituto Nacional de Astrofísica, Óptica y Electrónica, 2018)