{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:41:47Z","timestamp":1766137307351,"version":"build-2065373602"},"reference-count":50,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T00:00:00Z","timestamp":1576540800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61473073, 61433014"],"award-info":[{"award-number":["61473073, 61433014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["N161702001, N171706003, 182608003, 181706001"],"award-info":[{"award-number":["N161702001, N171706003, 182608003, 181706001"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012591","name":"Program for Liaoning Innovative Talents in University","doi-asserted-by":"publisher","award":["LJQ2014028"],"award-info":[{"award-number":["LJQ2014028"]}],"id":[{"id":"10.13039\/501100012591","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Patterns of connectivity among nodes on networks can be revealed by community detection algorithms. The great significance of communities in the study of clustering patterns of nodes in different systems has led to the development of various methods for identifying different node types on diverse complex systems. However, most of the existing methods identify only either disjoint nodes or overlapping nodes. Many of these methods rarely identify disjunct nodes, even though they could play significant roles on networks. In this paper, a new method, which distinctly identifies disjoint nodes (node clusters), disjunct nodes (single node partitions) and overlapping nodes (nodes binding overlapping communities), is proposed. The approach, which differs from existing methods, involves iterative computation of bridging centrality to determine nodes with the highest bridging centrality value. Additionally, node similarity is computed between the bridge-node and its neighbours, and the neighbours with the least node similarity values are disconnected. This process is sustained until a stoppage criterion condition is met. Bridging centrality metric and Jaccard similarity coefficient are employed to identify bridge-nodes (nodes at cut points) and the level of similarity between the bridge-nodes and their direct neighbours respectively. Properties that characterise disjunct nodes are equally highlighted. Extensive experiments are conducted with artificial networks and real-world datasets and the results obtained demonstrate efficiency of the proposed method in distinctly detecting and classifying multi-type nodes in network communities. This method can be applied to vast areas such as examination of cell interactions and drug designs, disease control in epidemics, dislodging organised crime gangs and drug courier networks, etc.<\/jats:p>","DOI":"10.3390\/e21121237","type":"journal-article","created":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T03:19:36Z","timestamp":1576811976000},"page":"1237","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Multi-Type Node Detection in Network Communities"],"prefix":"10.3390","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9235-2024","authenticated-orcid":false,"given":"Chinenye","family":"Ezeh","sequence":"first","affiliation":[{"name":"Software College, Northeastern University, Shenyang 110000, China"},{"name":"Department of Computer Engineering, Michael Okpara University of Agriculture, Umudike 440109, Nigeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0087-1730","authenticated-orcid":false,"given":"Ren","family":"Tao","sequence":"additional","affiliation":[{"name":"Software College, Northeastern University, Shenyang 110000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Zhe","sequence":"additional","affiliation":[{"name":"Software College, Northeastern University, Shenyang 110000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wang","family":"Yiqun","sequence":"additional","affiliation":[{"name":"Software College, Northeastern University, Shenyang 110000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qu","family":"Ying","sequence":"additional","affiliation":[{"name":"Software College, Northeastern University, Shenyang 110000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,12,17]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","article-title":"Community detection in graphs","volume":"486","author":"Fortunato","year":"2010","journal-title":"Phys. Rep."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Sonia, C., Gilles, C., Pierre, H., Sylvain, P., and Alberto, C. (2012). Finding communities in networks in the strong and almost-strong sense. Phys. Rev. E, 85.","DOI":"10.1103\/PhysRevE.85.046113"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1016\/j.physa.2018.02.212","article-title":"Community detection in complex networks using structural similarity","volume":"503","author":"Zarandi","year":"2018","journal-title":"Phys. A"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","article-title":"Community structure in social and biological networks","volume":"99","author":"Girvan","year":"2002","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","article-title":"Finding and evaluating community structure in networks","volume":"69","author":"Newman","year":"2004","journal-title":"Phys. Rev. E"},{"key":"ref_6","unstructured":"Hwang, W., Cho, Y., Zhang, A., and Ramanathan, M. (2006, January 20\u201323). Bridging centrality: Identifying bridging nodes in scale-free networks. Proceedings of the KDD-06, Philadelphia, PA, USA."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Hwang, W., Ramanathan, M., Kim, T., and Zhang, A. (2008, January 24\u201327). Bridging centrality: Graph mining from element level to group level. Proceedings of the 14th ACM SIGKDD International Conference on KDD, Las Vegas, NV, USA.","DOI":"10.1145\/1401890.1401934"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Thai, M., and Pardalos, P. (2012). Localized bridging centrality. Handbook of Optimization in Complex Networks, SOIA.","DOI":"10.1007\/978-1-4614-0857-4"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"026121","DOI":"10.1103\/PhysRevE.78.026121","article-title":"Comparative definition of community and corresponding identifying algorithm","volume":"78","author":"Yanqing","year":"2008","journal-title":"Phys. Rev. E"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"278","DOI":"10.17812\/IJRA\/2(6)\/50","article-title":"Community detection in dynamic social networks: A survey","volume":"2","author":"Enugala","year":"2015","journal-title":"IJRA"},{"key":"ref_11","first-page":"3669","article-title":"Bridging centrality: Identifying bridging nodes in transportation networks","volume":"9","author":"Baruah","year":"2018","journal-title":"IJANA"},{"key":"ref_12","unstructured":"Aloise, D., Caporossi, G., Hansen, P., Liberti, L., Perron, S., and Ruiz, M. (2012, January 13\u201314). Modularity maximization in networks by variable neighborhood search. Proceedings of the 10th DIMACS Implementation Challenge Workshop, Atlanta, GA, USA."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/TCSS.2014.2307458","article-title":"Community detection via maximization of modularity and its variants","volume":"1","author":"Chen","year":"2014","journal-title":"IEEE Trans. Comp. Soc. Syst."},{"key":"ref_14","unstructured":"Greeshma, V., and Vani, K.S. (2015). Community detection in networks using page rank vectors. IJBB, 5."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Scripps, J., and Tan, P. (2006, January 20\u201322). Clustering in the presence of bridge-nodes. Proceedings of the 2006 SIAM International Conference on Data Mining, Bethesda, MD, USA.","DOI":"10.1137\/1.9781611972764.24"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1958","DOI":"10.1016\/j.physa.2017.11.110","article-title":"Node similarity and modularity for finding communities in networks","volume":"492","author":"Saoud","year":"2018","journal-title":"Phys. A"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Asano, S.N., Okamoto, Y., and Watanabe, O. (2011). Asymptotic modularity of some graph classes. Algorithms and Computation, Springer.","DOI":"10.1007\/978-3-642-25591-5"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Chen, M., Kuzmin, K., and Szymanski, B.K. (2014, January 17\u201320). Extension of modularity density for overlapping community structure. Proceedings of the IEEE\/ACM ASONAM, Beijing, China.","DOI":"10.1109\/ASONAM.2014.6921686"},{"key":"ref_19","first-page":"604","article-title":"Feature analysis and modeling of the network community structure","volume":"58","author":"Yuan","year":"2012","journal-title":"CTP"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"2182","DOI":"10.1016\/j.physa.2012.12.013","article-title":"An efficient community detection method based on rank centrality","volume":"392","author":"Jiang","year":"2013","journal-title":"Phys. A"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.physa.2017.07.028","article-title":"Framework for detecting communities of unbalanced sizes in networks","volume":"490","author":"Zalik","year":"2018","journal-title":"Phys. A"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1038\/nature09182","article-title":"Link communities reveal multiscale complexity in networks","volume":"466","author":"Ahn","year":"2010","journal-title":"Nature"},{"key":"ref_23","unstructured":"We use interchangeably disjoint nodes for cluster nodes and disjunct nodes for isolated or neutral nodes. In this context, disjunct nodes refer to nodes that do not belong to any communities after network divisions. They appear to be neutral in adhering to clusters or communities. What we refer to as disjunct nodes in this paper is quite different from singleton nodes with degree value of 1."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Peel, L., Larremore, D.B., and Clauset, A. (2017). The ground truth about metadata and community detection in networks. Sci. Adv., 3.","DOI":"10.1126\/sciadv.1602548"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","article-title":"Fast algorithm for detecting community structure in networks","volume":"69","author":"Newman","year":"2004","journal-title":"Phys. Rev. E Stat. Nonlinear Soft. Matter Phys."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","article-title":"Finding community structure in very large networks","volume":"70","author":"Clauset","year":"2004","journal-title":"Phys. Rev. E"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast unfolding of communities in large networks","volume":"2008","author":"Blondel","year":"2008","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Raghavan, U.N., Albert, R., and Kumara, S. (2007). Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E, 76.","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","article-title":"Normalized cuts and image segmentation","volume":"22","author":"Shi","year":"2000","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_30","unstructured":"Ng, A.Y., Jordan, M.I., and Weiss, Y. (2001, January 3\u20138). On Spectral Clustering: Analysis and an Algorithm. Proceedings of the 14th International Conference on Neural Information Processing Systems: Natural and Synthetic, Vancouver, BC, Canada."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.jnca.2018.02.011","article-title":"Community detection in networks: A multidisciplinary review","volume":"108","author":"Javed","year":"2018","journal-title":"J. Netw. Comput. Appl."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Malliaros, F., and Vazirgiannis, M. (2013). Clustering and Community Detection in Directed Networks: A Survey. Phys. Rep., 533.","DOI":"10.1016\/j.physrep.2013.08.002"},{"key":"ref_33","unstructured":"The bridging centrality of a node is the product of the betweeness centrality of the node and its bridging coefficient [6,7]."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"2658","DOI":"10.1073\/pnas.0400054101","article-title":"Defining and identifying communities in networks","volume":"101","author":"Radicchi","year":"2004","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","article-title":"A set of measures of centrality based on betweenness","volume":"40","author":"Freeman","year":"1977","journal-title":"Sociometry"},{"key":"ref_36","unstructured":"Varoquaux, T.V., and Millman, J. (2008, January 19\u201324). Exploring network structure, dynamics, and function using networkx. Proceedings of the 7th Python in Science Conference, Pasadena, CA, USA."},{"key":"ref_37","unstructured":"Oliphant, T.E. (2019, December 03). A Guide to NumPy. Available online: https:\/\/www.scipy.org\/citing.html."},{"key":"ref_38","first-page":"22","article-title":"The numpy array: A structure for efficient numerical computation","volume":"13","author":"Walt","year":"2011","journal-title":"MCSE"},{"key":"ref_39","first-page":"90","article-title":"Matplotlib: A 2D graphics environment","volume":"9","author":"Hunter","year":"2007","journal-title":"MCSE"},{"key":"ref_40","unstructured":"Jones, E., Oliphant, E., and Peterson, P. (2019, November 29). Scipy: Open Source Scientific Tools for Python. Available online: https:\/\/www.bibsonomy.org\/bibtex\/24b71448b262807648d60582c036b8e02\/neurokernel."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","article-title":"Benchmark graphs for testing community detection algorithms","volume":"78","author":"Lancichinetti","year":"2008","journal-title":"Phys. Rev. E"},{"key":"ref_42","first-page":"473","article-title":"An information flow model for conflict and fission in small groups","volume":"33","author":"Zachary","year":"1976","journal-title":"JAR"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","article-title":"The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations","volume":"54","author":"Lusseau","year":"2003","journal-title":"Behav. Ecol. Sociobiol."},{"key":"ref_44","unstructured":"Krebs, V. (2019). Krebs Amazon Political Books Dataset, Unpublished work."},{"key":"ref_45","unstructured":"(2019, December 03). Available online: http:\/\/www-personal.umich.edu\/~mejn\/netdata\/football.zip."},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Yin, H., Benson, A., Leskovec, J., and Gleich, D. (2017, January 13\u201317). Local Higher-Order Graph Clustering. Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada.","DOI":"10.1145\/3097983.3098069"},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., and Faloutsos, C. (2007). Graph Evolution: Densification and Shrinking Diameters. arXiv.","DOI":"10.1145\/1217299.1217301"},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1038\/524038a","article-title":"Destruction Perfected","volume":"524","author":"Kovacs","year":"2015","journal-title":"Nature"},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Akabane, A.T., Immich, R., Pazzi, R.W., Madeira, E.R.M., and Villas, L.A. (2018). Distributed Egocentric Betweenness Measure as a Vehicle Selection Mechanism in VANETs: A Performance Evaluation Study. Sensors, 18.","DOI":"10.3390\/s18082731"},{"key":"ref_50","unstructured":"Butcher, N. (2019, November 29). Jaccard Coefficients. Available online: https:\/\/www3.nd.edu\/~kogge\/courses\/cse60742-Fall2018\/Public\/StudentWork\/KernelPaperFinal\/jaccard-butcher3.pdf."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/12\/1237\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:42:54Z","timestamp":1760190174000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/12\/1237"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,17]]},"references-count":50,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2019,12]]}},"alternative-id":["e21121237"],"URL":"https:\/\/doi.org\/10.3390\/e21121237","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2019,12,17]]}}}