Overlapping communities detection through weighted graph community games.
Where this comes from
- Record sourced from PubMed, PMID 37014883.
- Also identified by DOI 10.1371/journal.pone.0283857 and PMC identifier 10072486.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
We propose a new model to detect the overlapping communities of a network that is based on cooperative games and mathematical programming. More specifically, communities are defined as stable coalitions of a weighted graph community game and they are revealed as the optimal solution of a mixed-integer linear programming problem. Exact optimal solutions are obtained for small and medium sized instances and it is shown that they provide useful information about the network structure, improving on previous contributions. Next, a heuristic algorithm is developed to solve the largest instances and used to compare two variations of the objective function.
Medical subject headings
- Algorithms
- Programming, Linear