128 search results - page 11 / 26 » Towards proximity pattern mining in large graphs |
PKDD
2010
Springer
13 years 6 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...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
ICDM
2010
IEEE
13 years 5 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...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
ALMOB
2007
13 years 7 months ago
2007
Understanding the protein folding mechanism remains a grand challenge in structural biology. In the past several years, computational theories in molecular dynamics have been empl...