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

Deskribapen osoa

Gorde:
Xehetasun bibliografikoak
Argitaratua izan da:Computación y Sistemas
Egile Nagusiak: Andrés Gago Alonso, Jesús A. Carrasco Ochoa, José E. Medina Pagola, José F. Martínez Trinidad
Formatua: Artigo
Hizkuntza:Inglês
Argitaratua: Instituto Politécnico Nacional 2011
Gaiak:
Computación
Data mining
graph mining
frequent patterns
frequent subgraph
Sarrera elektronikoa:https://www.redalyc.org/articulo.oa?id=61520938010
Etiketak: Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!

Antzeko izenburuak