Colibri
Colibri: fast mining of large static and dynamic graphs. 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 the low-rank structure as the graph evolves over time, efficiently and within limited storage. Real graphs typically have thousands or millions of nodes, but are usually very sparse. However, standard decompositions such as SVD do not preserve sparsity. This has led to the development of methods such as CUR and CMD, which seek a non-orthogonal basis by sampling the columns and/or rows of the sparse matrix. However, these approaches will typically produce overcomplete bases, which wastes both space and time. In this paper we propose the family of Colibri methods to deal with these challenges. Our version for static graphs, Colibri-S, iteratively finds a non-redundant basis and we prove that it has no loss of accuracy compared to the best competitors (CUR and CMD), while achieving significant savings in space and time: on real data, Colibri-S requires much less space and is orders of magnitude faster (in proportion to the square of the number of non-redundant columns). Additionally, we propose an efficient update algorithm for dynamic, time-evolving graphs, Colibri-D. Our evaluation on a large, real network traffic dataset shows that Colibri-D is over 100 times faster than the best published competitor (CMD).
This software is also peer reviewed by journal TOMS.
This software is also peer reviewed by journal TOMS.
Keywords for this software
References in zbMATH (referenced in 5 articles )
Showing results 1 to 5 of 5.
Sorted by year (- Kaytoue, Mehdi; Plantevit, Marc; Zimmermann, Albrecht; Bendimerad, Anes; Robardet, CĂ©line: Exceptional contextual subgraph mining (2017)
- Aggarwal, Charu; Subbian, Karthik: Evolutionary network analysis: a survey (2014)
- Nettleton, David F.: Data mining of social networks represented as graphs (2013)
- Xu, Kevin S.; Kliger, Mark; Hero, Alfred O. III: A regularized graph layout framework for dynamic network visualization (2013)
- Mahoney, Michael W.: Randomized algorithms for matrices and data (2011)