7 search results - page 1 / 2 » Colibri: fast mining of large static and dynamic graphs |
KDD
2008
ACM
14 years 4 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
ICDM
2010
IEEE
13 years 2 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...
IWPC
2006
IEEE
13 years 10 months ago
2006
IEEE
Large software systems have a rich development history. Mining certain aspects of this rich history can reveal interesting insights into the system and its structure. Previous app...
KDD
2009
ACM
14 years 4 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
PKDD
2009
Springer
13 years 10 months ago
2009
Springer
We propose a new, recursive model to generate realistic graphs, evolving over time. Our model has the following properties: it is (a) flexible, capable of generating the cross pro...