6 search results - page 1 / 2 » Graph Mining: Repository vs. Canonical Form |
GFKL
2007
Springer
13 years 11 months ago
2007
Springer
SAC
2004
ACM
13 years 10 months ago
2004
ACM
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
IADIS
2008
13 years 6 months ago
2008
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...
KDD
2005
ACM
14 years 5 months ago
2005
ACM
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
SAC
2009
ACM
13 years 11 months ago
2009
ACM
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...