This paper examines a schema for graph-theoretic clustering using node-based resilience measures. Node-based resilience measures optimize an objective based on a critical set of nodes whose removal causes some severity of disconnection in the network. Beyond presenting a general framework for the usage of node-based resilience measures for variations of clustering problems, we experimentally validate the usefulness of such methods in accomplishing the following: (i) clustering a graph in one step without knowing the number of clusters a priori; (ii) removing noise from noisy data; and (iii) detecting overlapping communities. We demonstrate that this clustering schema can be applied successfully using a wide range of data, including both real and synthetic networks, both natively in graph form and also expressed as point sets.
J. Matta et al., "Node-based Resilience Measure Clustering With Applications To Noisy And Overlapping Communities In Complex Networks," Applied Sciences (Switzerland), vol. 8, no. 8, article no. 1307, MDPI, Aug 2018.
The definitive version is available at https://doi.org/10.3390/app8081307
Electrical and Computer Engineering
Keywords and Phrases
Clustering; Complex networks; Data mining; Graph theoretic algorithms
International Standard Serial Number (ISSN)
Article - Journal
© 2023 The Authors, All rights reserved.
Creative Commons Licensing
This work is licensed under a Creative Commons Attribution 4.0 License.
06 Aug 2018