Graph Decomposition Using Self-organizing Trees

Abstract

In this paper, we present a new approach for graph decomposition using topological and hierarchical partitioning of data. Our method called GD-SOM-Tree (Graph Decomposition using Self-Organizing Trees) is based on self-organizing models. The benefit of this novel approach is to represent and visualize hierarchical relations which replace the original graph with a summary and gives a good understanding of the underlying problem.