145 search results - page 2 / 29 » Mining closed relational graphs with connectivity constraint... |
ISM
2005
IEEE
13 years 11 months ago
2005
IEEE
— For efficient video data management, ‘video data mining’ is required to discover ‘semantic patterns’ which are not only previously unknown and interesting, but also as...
IPCO
2004
13 years 6 months ago
2004
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
ICDM
2006
IEEE
13 years 11 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...
FLAIRS
2007
13 years 7 months ago
2007
We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search. We model t...
ICDM
2010
IEEE
13 years 3 months ago
2010
IEEE
How do connected components evolve? What are the regularities that govern the dynamic growth process and the static snapshot of the connected components? In this work, we study pat...