18 search results - page 1 / 4 » SPIN: mining maximal frequent subgraphs from graph databases |
KDD
2004
ACM
14 years 4 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
ICDE
2006
IEEE
14 years 5 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...
JCP
2008
13 years 4 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
Graph data are subject to uncertainties in many applications due to incompleteness and imprecision of data. Mining uncertain graph data is semantically different from and computat...
ICDE
2009
IEEE
14 years 6 months ago
2009
IEEE
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...