Several graph visualization tools exist. However, they are not able to handle large graphs, and/or they do not allow interaction. We are interested on large graphs, with hundreds of thousands of nodes. Such graphs bring two challenges: the first one is that any straightforward interactive manipulation will be prohibitively slow. The second one is sensory overload: even if we could plot and replot the graph quickly, the user would be overwhelmed with the vast volume of information because the screen would be too cluttered as nodes and edges overlap each other. GMine system addresses both these issues, by using summarization and multi-resolution. GMine offers multi-resolution graph exploration by partitioning a given graph into a hierarchy of com-munities-within-communities and storing it into a novel R-tree-like structure which we name G-Tree. GMine offers summarization by implementing an innovative subgraph extraction algorithm and then visualizing its output.
- Pub Date:
- June 2015
- Computer Science - Social and Information Networks
- 4 pages, Proceedings of the 32nd international conference on Very Large Data Bases, 2006. Specifically: Jose Rodrigues, Hanghang Tong, Agma Traina, Christos Faloutsos, Jure Leskovec (2006), GMine: A System for Scalable, Interactive Graph Visualization and Mining