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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
