Sciweavers

2 search results - page 1 / 1
» Full Perfect Extension Pruning for Frequent Graph Mining
Sort
View
ICDM
2006
IEEE
81views Data Mining» more  ICDM 2006»
13 years 11 months ago
Full Perfect Extension Pruning for Frequent Graph Mining
Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algo...
Christian Borgelt, Thorsten Meinl
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
13 years 11 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu