A Seed-Expanding Method Based on TOPSIS for Community Detection in Complex Networks
The centrality plays an important role in many community-detection algorithms, which depend on various kinds of centralities to identify seed vertices of communities first and then expand each of communities based on the seeds to get the resulting community structure. The traditional algorithms alwa...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2020/9017239 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832567457001242624 |
|---|---|
| author | Jianjun Cheng Wenbo Zhang Haijuan Yang Xing Su Tao Ma Xiaoyun Chen |
| author_facet | Jianjun Cheng Wenbo Zhang Haijuan Yang Xing Su Tao Ma Xiaoyun Chen |
| author_sort | Jianjun Cheng |
| collection | DOAJ |
| description | The centrality plays an important role in many community-detection algorithms, which depend on various kinds of centralities to identify seed vertices of communities first and then expand each of communities based on the seeds to get the resulting community structure. The traditional algorithms always use a single centrality measure to recognize seed vertices from the network, but each centrality measure has both pros and cons when being used in this circumstance; hence seed vertices identified using a single centrality measure might not be the best ones. In this paper, we propose a framework which integrates advantages of various centrality measures to identify the seed vertices from the network based on the TOPSIS (Technique for Order of Preference by Similarity to Ideal Solution) multiattribute decision-making technology. We take each of the centrality measures involved as an attribute, rank vertices according to the scores which are calculated for them using TOPSIS, and then take vertices with top ranks as the seeds. To put this framework into practice, we concretize it in this paper by considering four centrality measures as attributes to identify the seed vertices of communities first, then expanding communities by iteratively inserting one unclassified vertex into the community to which its most similar neighbor belongs, and the similarity between them is the largest among all pairs of vertices. After that, we obtain the initial community structure. However, the amount of communities might be much more than they should be, and some communities might be too small to make sense. Therefore, we finally consider a postprocessing procedure to merge some initial communities into larger ones to acquire the resulting community structure. To test the effectiveness of the proposed framework and method, we have performed extensive experiments on both some synthetic networks and some real-world networks; the experimental results show that the proposed method can get better results, and the quality of the detected community structure is much higher than those of competitors. |
| format | Article |
| id | doaj-art-816838a716654399a0836c54142480ce |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2020-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-816838a716654399a0836c54142480ce2025-02-03T01:01:23ZengWileyComplexity1076-27871099-05262020-01-01202010.1155/2020/90172399017239A Seed-Expanding Method Based on TOPSIS for Community Detection in Complex NetworksJianjun Cheng0Wenbo Zhang1Haijuan Yang2Xing Su3Tao Ma4Xiaoyun Chen5School of Information Science and Engineering, Lanzhou University, Lanzhou, ChinaSchool of Information Science and Engineering, Lanzhou University, Lanzhou, ChinaSchool of Information Science and Engineering, Lanzhou University, Lanzhou, ChinaSchool of Information Science and Engineering, Lanzhou University, Lanzhou, ChinaSchool of Mathematics and Computer Science, Ningxia Normal University, Guyuan, ChinaSchool of Information Science and Engineering, Lanzhou University, Lanzhou, ChinaThe centrality plays an important role in many community-detection algorithms, which depend on various kinds of centralities to identify seed vertices of communities first and then expand each of communities based on the seeds to get the resulting community structure. The traditional algorithms always use a single centrality measure to recognize seed vertices from the network, but each centrality measure has both pros and cons when being used in this circumstance; hence seed vertices identified using a single centrality measure might not be the best ones. In this paper, we propose a framework which integrates advantages of various centrality measures to identify the seed vertices from the network based on the TOPSIS (Technique for Order of Preference by Similarity to Ideal Solution) multiattribute decision-making technology. We take each of the centrality measures involved as an attribute, rank vertices according to the scores which are calculated for them using TOPSIS, and then take vertices with top ranks as the seeds. To put this framework into practice, we concretize it in this paper by considering four centrality measures as attributes to identify the seed vertices of communities first, then expanding communities by iteratively inserting one unclassified vertex into the community to which its most similar neighbor belongs, and the similarity between them is the largest among all pairs of vertices. After that, we obtain the initial community structure. However, the amount of communities might be much more than they should be, and some communities might be too small to make sense. Therefore, we finally consider a postprocessing procedure to merge some initial communities into larger ones to acquire the resulting community structure. To test the effectiveness of the proposed framework and method, we have performed extensive experiments on both some synthetic networks and some real-world networks; the experimental results show that the proposed method can get better results, and the quality of the detected community structure is much higher than those of competitors.http://dx.doi.org/10.1155/2020/9017239 |
| spellingShingle | Jianjun Cheng Wenbo Zhang Haijuan Yang Xing Su Tao Ma Xiaoyun Chen A Seed-Expanding Method Based on TOPSIS for Community Detection in Complex Networks Complexity |
| title | A Seed-Expanding Method Based on TOPSIS for Community Detection in Complex Networks |
| title_full | A Seed-Expanding Method Based on TOPSIS for Community Detection in Complex Networks |
| title_fullStr | A Seed-Expanding Method Based on TOPSIS for Community Detection in Complex Networks |
| title_full_unstemmed | A Seed-Expanding Method Based on TOPSIS for Community Detection in Complex Networks |
| title_short | A Seed-Expanding Method Based on TOPSIS for Community Detection in Complex Networks |
| title_sort | seed expanding method based on topsis for community detection in complex networks |
| url | http://dx.doi.org/10.1155/2020/9017239 |
| work_keys_str_mv | AT jianjuncheng aseedexpandingmethodbasedontopsisforcommunitydetectionincomplexnetworks AT wenbozhang aseedexpandingmethodbasedontopsisforcommunitydetectionincomplexnetworks AT haijuanyang aseedexpandingmethodbasedontopsisforcommunitydetectionincomplexnetworks AT xingsu aseedexpandingmethodbasedontopsisforcommunitydetectionincomplexnetworks AT taoma aseedexpandingmethodbasedontopsisforcommunitydetectionincomplexnetworks AT xiaoyunchen aseedexpandingmethodbasedontopsisforcommunitydetectionincomplexnetworks AT jianjuncheng seedexpandingmethodbasedontopsisforcommunitydetectionincomplexnetworks AT wenbozhang seedexpandingmethodbasedontopsisforcommunitydetectionincomplexnetworks AT haijuanyang seedexpandingmethodbasedontopsisforcommunitydetectionincomplexnetworks AT xingsu seedexpandingmethodbasedontopsisforcommunitydetectionincomplexnetworks AT taoma seedexpandingmethodbasedontopsisforcommunitydetectionincomplexnetworks AT xiaoyunchen seedexpandingmethodbasedontopsisforcommunitydetectionincomplexnetworks |