59 search results - page 7 / 12 » Frequent subgraph mining in outerplanar graphs |
ICDM
2002
IEEE
14 years 22 days ago
2002
IEEE
We investigate new approaches for frequent graph-based pattern mining in graph datasets and propose a novel algorithm called gSpan (graph-based Substructure pattern mining), which...
ISSTA
2009
ACM
14 years 2 months ago
2009
ACM
Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Al...
SIGMOD
2010
ACM
14 years 18 days ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
PKDD
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Several new miners for frequent subgraphs have been published recently. Whereas new approaches are presented in detail, the quantitative evaluations are often of limited ...