15 search results - page 2 / 3 » Improving Frequent Subgraph Mining in the Presence of Symmet... |
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
Existing graph mining algorithms typically assume that databases are relatively static and can fit into the main memory. Mining of subgraphs in a dynamic environment is currently ...
EDBT
2009
ACM
13 years 11 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...
HIPC
2003
Springer
13 years 10 months ago
2003
Springer
Traditional methods for data mining typically make the assumption that data is centralized and static. This assumption is no longer tenable. Such methods waste computational and I/...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
PKDD
2010
Springer
13 years 3 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...