74 search results - page 7 / 15 » Pattern Mining in Frequent Dynamic Subgraphs |
EDBT
2009
ACM
15 years 6 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...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
ICDM
2007
IEEE
15 years 3 months ago
2007
IEEE
Mining frequent patterns in transaction databases has been studied extensively in data mining research. However, most of the existing frequent pattern mining algorithms do not con...
161
click to vote
SIGMOD
2008
ACM
15 years 11 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
PKDD
2010
Springer
14 years 10 months ago
2010
Springer
Pattern mining methods for graph data have largely been restricted to ground features, such as frequent or correlated subgraphs. Kazius et al. have demonstrated the use of elaborat...