19 search results - page 4 / 4 » Mining frequent closed rooted trees |
DIS
2007
Springer
13 years 8 months ago
2007
Springer
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
EDBT
2009
ACM
13 years 11 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
SDM
2009
SIAM
14 years 2 months ago
2009
SIAM
Automotive companies are forced to continuously extend and improve their product line-up. However, increasing diversity, higher design complexity, and shorter development cycles c...
CIKM
2009
Springer
13 years 8 months ago
2009
Springer
Mining generator patterns has raised great research interest in recent years. The main purpose of mining itemset generators is that they can form equivalence classes together with...