1082 search results - page 67 / 217 » Graph Mining using Graph Pattern Profiles |
132
click to vote
OOPSLA
1999
Springer
15 years 6 months ago
1999
Springer
In this paper we present the Generic Graph Component Library (GGCL), a generic programming framework for graph data structures and graph algorithms. Following the theme of the Sta...
128
Voted
KDD
2010
ACM
15 years 23 days ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
136
click to vote
PAKDD
2011
ACM
14 years 5 months ago
2011
ACM
Abstract. Given a graph with billions of nodes and edges, how can we find patterns and anomalies? Are there nodes that participate in too many or too few triangles? Are there clos...
159
click to vote
ICDM
2006
IEEE
15 years 8 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
125
click to vote
WCRE
2002
IEEE
15 years 7 months ago
2002
IEEE
Over the past few years, we are experiencing a surge of evolution problems related to legacy object-oriented systems. Object orientation provides means for systems to be well-desi...