Detecting Overlapping Communities in Modularity Optimization by Reweighting Vertices
| Autor: | Hann-Jang Ho, Tien-Wei Chang, Chien-Yu Chen, Sing-Ling Lee, Chen-Kun Tsung |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Theoretical computer science
Computer science Property (programming) General Physics and Astronomy lcsh:Astrophysics 02 engineering and technology Fuzzy logic Measure (mathematics) Article lcsh:QB460-466 Genetic algorithm community detection 0202 electrical engineering electronic engineering information engineering overlapping communities lcsh:Science modularity Structure (mathematical logic) Modularity (networks) Node (networking) 020206 networking & telecommunications data mining Function (mathematics) lcsh:QC1-999 lcsh:Q 020201 artificial intelligence & image processing lcsh:Physics |
| Zdroj: | Entropy Volume 22 Issue 8 Entropy, Vol 22, Iss 819, p 819 (2020) |
| ISSN: | 1099-4300 |
| Popis: | On the purpose of detecting communities, many algorithms have been proposed for the disjointed community sets. The major challenge of detecting communities from the real-world problems is to determine the overlapped communities. The overlapped vertices belong to some communities, so it is difficult to be detected using the modularity maximization approach. The major problem is that the overlapping structure barely be found by maximizing the fuzzy modularity function. In this paper, we firstly introduce a node weight allocation problem to formulate the overlapping property in the community detection. We propose an extension of modularity, which is a better measure for overlapping communities based on reweighting nodes, to design the proposed algorithm. We use the genetic algorithm for solving the node weight allocation problem and detecting the overlapping communities. To fit the properties of various instances, we introduce three refinement strategies to increase the solution quality. In the experiments, the proposed method is applied on both synthetic and real networks, and the results show that the proposed solution can detect the nontrivial valuable overlapping nodes which might be ignored by other algorithms. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|