731 search results - page 11 / 147 » Taxonomy-superimposed graph mining |
PKDD
2004
Springer
14 years 1 months ago
2004
Springer
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...
ICDM
2005
IEEE
14 years 1 months ago
2005
IEEE
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
PKDD
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. This paper proposes a novel approach named AGM to eciently mine the association rules among the frequently appearing substructures in a given graph data set. A graph tran...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
How do real, weighted graphs change over time? What patterns, if any, do they obey? Earlier studies focus on unweighted graphs, and, with few exceptions, they focus on static snap...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...