Unsupervised clustering analysis: a multiscale complex networks approach
arXiv:1101.1890 · doi:10.1142/S0218127412300236
Abstract
Unsupervised clustering, also known as natural clustering, stands for the classification of data according to their similarities. Here we study this problem from the perspective of complex networks. Mapping the description of data similarities to graphs, we propose to extend two multiresolution modularity based algorithms to the finding of modules (clusters) in general data sets producing a multiscales' solution. We show the performance of these reported algorithms to the classification of a standard benchmark of data clustering and compare their performance.
References in corpus (19)
- Community structure in social and biological networks
- Finding and evaluating community structure in networks
- Modularity and community structure in networks
- Community detection in graphs
- Finding community structure in very large networks
- Fast algorithm for detecting community structure in networks
- Functional cartography of complex metabolic networks
- Resolution limit in community detection
- Comparing community structure identification
- Analysis of weighted networks
- Community detection in complex networks using Extremal Optimization
- Self-similarity of complex networks
- Detecting fuzzy community structures in complex networks with a Potts model
- Community detection in networks with positive and negative links
- Analysis of the structure of complex networks at different resolution levels
- Analysis of community structure in networks of correlated data
- Solving non-uniqueness in agglomerative hierarchical clustering using multidendrograms
- Post-Processing Hierarchical Community Structures: Quality Improvements and Multi-scale View
- Natural clustering: the modularity approach