article
Graph clustering is a powerful technique used to identify and group similar nodes within a complex network structure. This procedure involves segmenting the graph into distinct groups, with the nodes in each group having strong interconnections or similar characteristics. In this survey, we will highlight a variety of existing approaches of graph clustering, including spectral clustering, modularity optimization and hierarchical clustering, to efficiently discover meaningful clusters, facilitating analysis and decision-making in diverse fields ranging from data science and network analysis to social sciences and bioinformatics.
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.1109/adacis59737.2023.10424063
Is something wrong with this record? Report it or request removal.
Discussion
Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.
No discussion yet. Open the first thread.
New to MARATTO™? Create a free account.