2 search results - page 1 / 1 » A Quantitative Comparison of the Subgraph Miners MoFa, gSpan... |
PKDD
2005
Springer
14 years 4 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 ...
ECEASST
2006
13 years 11 months ago
2006
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...