Journal of Machine and Computing


Community Detection Algorithm Based on High Degree Node Selection in Complex Networks



Journal of Machine and Computing

Received On : 22 March 2025

Revised On : 30 May 2025

Accepted On : 17 June 2025

Published On : 05 July 2025

Volume 05, Issue 03

Pages : 1864-1872


Abstract


Community detection plays a central role in the analysis of social networks, where individuals naturally form structured groups such as neighborhood clusters or small rural communities. A key challenge in this domain is accurately identifying these communities—commonly defined as subsets of nodes that are more densely connected internally than with the rest of the network. Traditional methods often rely on hierarchical clustering for this task. However, recent research has explored alternative approaches involving various clustering strategies and connectivity-based evaluation metrics. In this study, we introduce a novel method called the Biggest Degree Head Node Technique (BDNHT) and evaluate its effectiveness against the conventional Random Head Node Technique. The proposed method focuses on selecting an optimal set of centroids using fitness-based criteria, aiming to achieve more meaningful and well-separated community structures.


Keywords


Network Node, Clustering, Biggest Degree Head, Social Networks, Longest Distance Head, Social Community, Cluster.


  1. B. Kamiński, P. Prałat, and F. Théberge, “Mining Complex Networks,” Nov. 2021, doi: 10.1201/9781003218869.
  2. S. S. Hussein and A. A. Farhan, “On Linear Algebraic and Graph Theoretic Methods,” Journal of Global Scientific Research, vol. 8, no. 11, pp. 3319–3326, 2023.
  3. C. He, X. Fei, Q. Cheng, H. Li, Z. Hu, and Y. Tang, “A Survey of Community Detection in Complex Networks Using Nonnegative Matrix Factorization,” IEEE Transactions on Computational Social Systems, vol. 9, no. 2, pp. 440–457, Apr. 2022, doi: 10.1109/tcss.2021.3114419.
  4. F. Gasparetti, G. Sansonetti, and A. Micarelli, “Community detection in social recommender systems: a survey,” Applied Intelligence, vol. 51, no. 6, pp. 3975–3995, Jun. 2021, doi: 10.1007/S10489-020-01962-3/METRICS.
  5. S. Rani and M. Kumar, “Ranking community detection algorithms for complex social networks using multilayer network design approach,” International Journal of Web Information Systems, vol. 18, no. 5/6, pp. 310–341, Aug. 2022, doi: 10.1108/ijwis-02-2022-0040.
  6. Xiaokaiti, Y. Qian, and J. Wu, “Efficient Data Transmission for Community Detection Algorithm Based on Node Similarity in Opportunistic Social Networks,” Complexity, vol. 2021, no. 1, Jan. 2021, doi: 10.1155/2021/9928771.
  7. S. Mittal, D. Sengupta, and T. Chakraborty, “Hide and Seek: Outwitting Community Detection Algorithms,” IEEE Transactions on Computational Social Systems, vol. 8, no. 4, pp. 799–808, Aug. 2021, doi: 10.1109/tcss.2021.3062711.
  8. S. Souravlas, S. Anastasiadou, and S. Katsavounis, “A Survey on the Recent Advances of Deep Community Detection,” Applied Sciences, vol. 11, no. 16, p. 7179, Aug. 2021, doi: 10.3390/app11167179.
  9. T. Li et al., “Hierarchical Community Detection by Recursive Partitioning,” Journal of the American Statistical Association, vol. 117, no. 538, pp. 951–968, Nov. 2020, doi: 10.1080/01621459.2020.1833888.
  10. K. Berahmand, M. Mohammadi, A. Faroughi, and R. P. Mohammadiani, “A novel method of spectral clustering in attributed networks by constructing parameter-free affinity matrix,” Cluster Computing, vol. 25, no. 2, pp. 869–888, Nov. 2021, doi: 10.1007/s10586-021-03430-0.
  11. F. Öztemiz and A. Karcı, “KO: Modularity optimization in community detection,” Neural Computing and Applications, vol. 35, no. 15, pp. 11073–11087, Jan. 2023, doi: 10.1007/s00521-023-08284-8.
  12. R. Kiruthika and M. S. Vijaya, “Community Detection Using Girvan–Newman and Kernighan–Lin Bipartition Algorithms,” Data Intelligence and Cognitive Informatics, pp. 217–231, 2022, doi: 10.1007/978-981-16-6460-1_16.
  13. X. Zhao, J. Liang, and J. Wang, “A community detection algorithm based on graph compression for large-scale social networks,” Information Sciences, vol. 551, pp. 358–372, Apr. 2021, doi: 10.1016/j.ins.2020.10.057.
  14. Mester, A. Pop, B.-E.-M. Mursa, H. Greblă, L. Dioşan, and C. Chira, “Network Analysis Based on Important Node Selection and Community Detection,” Mathematics, vol. 9, no. 18, p. 2294, Sep. 2021, doi: 10.3390/math9182294.
  15. M. Li, S. Lu, L. Zhang, Y. Zhang, and B. Zhang, “A Community Detection Method for Social Network Based on Community Embedding,” IEEE Transactions on Computational Social Systems, vol. 8, no. 2, pp. 308–318, Apr. 2021, doi: 10.1109/tcss.2021.3050397.
  16. R. Javadpour Boroujeni and S. Soleimani, “The role of influential nodes and their influence domain in community detection: An approximate method for maximizing modularity,” Expert Systems with Applications, vol. 202, p. 117452, Sep. 2022, doi: 10.1016/j.eswa.2022.117452.
  17. W. Zhao, J. Luo, T. Fan, Y. Ren, and Y. Xia, “Analyzing and visualizing scientific research collaboration network with core node evaluation and community detection based on network embedding,” Pattern Recognition Letters, vol. 144, pp. 54–60, Apr. 2021, doi: 10.1016/j.patrec.2021.01.007.
  18. S. Kumar, B. S. Panda, and D. Aggarwal, “Community detection in complex networks using network embedding and gravitational search algorithm,” Journal of Intelligent Information Systems, vol. 57, no. 1, pp. 51–72, Nov. 2020, doi: 10.1007/s10844-020-00625-6.
  19. L. Samandari Masooleh, J. E. Arbogast, W. D. Seider, U. Oktem, and M. Soroush, “An efficient algorithm for community detection in complex weighted networks,” AIChE Journal, vol. 67, no. 7, p. e17205, Jul. 2021, doi: 10.1002/AIC.17205; WGROUP:STRING: PUBLICATION.
  20. M. E. Samie, E. Behbood, and A. Hamzeh, “Local community detection based on influence maximization in dynamic networks,” Applied Intelligence, vol. 53, no. 15, pp. 18294–18318, Aug. 2023, doi: 10.1007/S10489-022-04403-5/METRICS.
  21. M. Al-Andoli, W. P. Cheah, and S. C. Tan, “Deep autoencoder-based community detection in complex networks with particle swarm optimization and continuation algorithms,” Journal of Intelligent & Fuzzy Systems, vol. 40, no. 3, pp. 4517–4533, Mar. 2021, doi: 10.3233/jifs-201342.
  22. M. Al-Andoli, W. P. Cheah, and S. C. Tan, “Deep learning-based community detection in complex networks with network partitioning and reduction of trainable parameters,” Journal of Ambient Intelligence and Humanized Computing, vol. 12, no. 2, pp. 2527–2545, Jul. 2020, doi: 10.1007/s12652-020-02389-x.
  23. M. U. D. Khanday, M. A. Wani, S. T. Rabani, and Q. R. Khan, “Hybrid Approach for Detecting Propagandistic Community and Core Node on Social Networks,” Sustainability, vol. 15, no. 2, p. 1249, Jan. 2023, doi: 10.3390/su15021249.
  24. Aldabobi, A. Sharieh, and R. Jabri, “An improved Louvain algorithm based on Node importance for Community detection,” J Theor Appl Inf Technol, vol. 100, no. 23, pp. 1–14, 2022.
  25. R. Shang, W. Zhang, J. Zhang, L. Jiao, Y. Li, and R. Stolkin, “Local Community Detection Algorithm Based on Alternating Strategy of Strong Fusion and Weak Fusion,” IEEE Trans Cybern, vol. 53, no. 2, pp. 818–831, Feb. 2023, doi: 10.1109/TCYB.2022.3159584.

CRediT Author Statement


The authors confirm contribution to the paper as follows:

Conceptualization:Amedapu Srinivas and Leela Velusamy; Methodology: Amedapu Srinivas; Software: Leela Velusamy; Data Curation: Amedapu Srinivas; Writing- Original Draft Preparation: Amedapu Srinivas and Leela Velusamy; Visualization: Amedapu Srinivas; Investigation: Leela Velusamy; Supervision: Amedapu Srinivas; Validation: Leela Velusamy; Writing- Reviewing and Editing: Amedapu Srinivas and Leela Velusamy;All authors reviewed the results and approved the final version of the manuscript.


Acknowledgements


Author(s) thanks to Dr.Leela Velusamy for this research completion and support.


Funding


No funding was received to assist with the preparation of this manuscript.


Ethics declarations


Conflict of interest

The authors have no conflicts of interest to declare that are relevant to the content of this article.


Availability of data and materials


Data sharing is not applicable to this article as no new data were created or analysed in this study.


Author information


Contributions

All authors have equal contribution in the paper and all authors have read and agreed to the published version of the manuscript.


Corresponding author


Rights and permissions


Open Access This article is licensed under a Creative Commons Attribution NoDerivs is a more restrictive license. It allows you to redistribute the material commercially or non-commercially but the user cannot make any changes whatsoever to the original, i.e. no derivatives of the original work. To view a copy of this license, visit https://creativecommons.org/licenses/by-nc-nd/4.0/


Cite this article


Amedapu Srinivas and Leela Velusamy, “Community Detection Algorithm Based on High Degree Node Selection in Complex Networks”, Journal of Machine and Computing, vol.5, no.3, pp. 1864-1872, July 2025, doi: 10.53759/7669/jmc202505146.


Copyright


© 2025 Amedapu Srinivas and Leela Velusamy. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.