Reducing the Number of Canonical Form Tests for Frequent Subgraph Mining

dc.creatorGago Alonso, Andrés
dc.creatorCarrasco Ochoa, Jesús A.
dc.creatorMedina Pagola, José E.
dc.creatorMartínez Trinidad, José F.
dc.date.accessioned2013-04-05T20:18:27Z
dc.date.available2013-04-05T20:18:27Z
dc.date.created2013-04-05T20:18:27Z
dc.date.issued2011-12-13
dc.identifierRevista Computación y Sistemas; Vol. 15 No. 2
dc.identifier1405-5546
dc.identifierhttp://www.repositoriodigital.ipn.mx/handle/123456789/14880
dc.description.abstractAbstract. 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 affect the efficiency of graph miners. In this paper, we introduce novel properties to reduce the number of canonical form tests in FCS mining. Based on these properties, a new algorithm for FCS mining called gRed is presented. The experimentation on real world datasets shows the impact of the proposed properties on the efficiency of gRed reducing the number of canonical form tests regarding gSpan. Besides, the performance of our algorithm is compared against gSpan and other state-of-the-art algorithms.
dc.languageen_US
dc.publisherRevista Computación y Sistemas; Vol. 15 No. 2
dc.relationRevista Computación y Sistemas;Vol. 15 No.2
dc.subjectKeywords. Data mining, frequent patterns, graph mining, frequent subgraph.
dc.titleReducing the Number of Canonical Form Tests for Frequent Subgraph Mining
dc.typeArticle


Este ítem pertenece a la siguiente institución