Community detection for proximity alignment
Integrated Computer-Aided Engineering
Hi-index | 0.00 |
Community structure is one of non-trivial topological properties ubiquitously demonstrated in real-world complex networks. Related theories and approaches are of fundamental importance for understanding the functions of networks. Previously, we have proposed a probabilistic algorithm called the NCMA to efficiently as well as effectively mine communities from real-world networks. Here, we show that the NCMA can be readily extended and applied to address a wide range of network oriented applications beyond community detection including ranking, characterizing and searching real world networks.