Extending Apal To Detect Overlapping Communities in Weighted Networks
Loading...
Files
Date
2022
Authors
Oğuz, Kaya
Doluca, Osman
Journal Title
Journal ISSN
Volume Title
Publisher
Institute of Electrical and Electronics Engineers Inc.
Open Access Color
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
BIP! Indicators
Impulse
Average
Influence
Average
Popularity
Average
Abstract
APAL is an overlapping community detection algorithm that runs on undirected and unweighted graphs of any size. This study extends the algorithm to weighted networks by incorporating the average weight of the community to the evaluation process of the detected communities. Weighted-APAL (WAPAL) is tested with the established LFR benchmark suite against the weighted version of CPM. The resulting normalized mutual information scores show that it can detect weighted communities with a high rate of success. © 2022 IEEE.
Description
3rd International Informatics and Software Engineering Conference, IISEC 2022 -- 15 December 2022 through 16 December 2022 -- 185735
Keywords
overlapping community detection, weighted networks, Undirected graphs, Benchmark suites, Community detection algorithms, High rate, Normalized mutual information, Overlapping communities, Overlapping community detections, Undirected graph, Unweighted graphs, Weighted networks, Population dynamics
Fields of Science
0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 01 natural sciences
Citation
WoS Q
N/A
Scopus Q
N/A
OpenCitations Citation Count
N/A
Source
3rd International Informatics and Software Engineering Conference, IISEC 2022
Volume
579
Issue
Start Page
1
End Page
4
PlumX Metrics
Citations
Scopus : 0
Captures
Mendeley Readers : 1
Google Scholar™
