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
ऑनलाइन पहुंच:https://www.redalyc.org/articulo.oa?id=61520938010
टैग : टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!

समान संसाधन