18 search results - page 2 / 4 » SPIN: mining maximal frequent subgraphs from graph databases |
KDD
2006
ACM
14 years 6 months ago
2006
ACM
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
EDBT
2009
ACM
14 years 29 days 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...
EDBT
2012
ACM
11 years 8 months ago
2012
ACM
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
SIGMOD
2010
ACM
13 years 11 months 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...
ISSTA
2009
ACM
14 years 21 days 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...