43 search results - page 1 / 9 » Mining interesting subgraphs by output space sampling |
SIGKDD
2010
13 years 3 months ago
2010
ICDM
2006
IEEE
13 years 10 months ago
2006
IEEE
The exponential number of possible subgraphs makes the problem of frequent subgraph mining a challenge. Maximal frequent mining has triggered much interest since the size of the s...
SADM
2010
13 years 3 months ago
2010
The goal of frequent subgraph mining is to detect subgraphs that frequently occur in a dataset of graphs. In classification settings, one is often interested in discovering discr...
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
Model- and simulation-designers are often interested not in the optimum output of their system, but in understanding how the output is sensitive to different parameters. This can...
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...