{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T07:25:53Z","timestamp":1772609153913,"version":"3.50.1"},"reference-count":26,"publisher":"Emerald","issue":"2","license":[{"start":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T00:00:00Z","timestamp":1578441600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["LHT"],"published-print":{"date-parts":[[2020,1,8]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>The state-of-the-art methods designed for overlapping community detection are limited by their high execution time as in CPM or the need to provide some parameters like the number of communities in Bigclam and Nise_sph, which is a nontrivial information. Hence, there is a need to develop the accuracy that represents the primordial goal, where the actual state-of-the-art methods do not succeed to achieve high correspondence with the ground truth for many instances of networks. The paper aims to discuss this issue.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>The authors offer a new method that explore the union of all maximum spanning trees (UMST) and models the strength of links between nodes. Also, each node in the UMST is linked with its most similar neighbor. From this model, the authors extract local community for each node, and then they combine the produced communities according to their number of shared nodes.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n<jats:p>The experiments on eight real-world data sets and four sets of artificial networks show that the proposed method achieves obvious improvements over four state-of-the-art (BigClam, OSLOM, Demon, SE, DMST and ST) methods in terms of the F-score and ONMI for the networks with ground truth (Amazon, Youtube, LiveJournal and Orkut). Also, for the other networks, it provides communities with a good overlapping modularity.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>In this paper, the authors investigate the UMST for the overlapping community detection.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/lht-01-2019-0003","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T07:28:36Z","timestamp":1578641316000},"page":"276-292","source":"Crossref","is-referenced-by-count":23,"title":["Overlapping community detection based on the union of all maximum spanning trees"],"prefix":"10.1108","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6624-1016","authenticated-orcid":false,"given":"Khawla","family":"Asmi","sequence":"first","affiliation":[]},{"given":"Dounia","family":"Lotfi","sequence":"additional","affiliation":[]},{"given":"Mohamed","family":"El Marraki","sequence":"additional","affiliation":[]}],"member":"140","reference":[{"key":"key2020061114431815800_ref001","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.jnca.2013.08.008","article-title":"Community detection in social networks using hybrid merging of sub-communities","volume":"40","year":"2014","journal-title":"Journal of Network and Computer Applications"},{"issue":"5439","key":"key2020061114431815800_ref002","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","year":"1999","journal-title":"Science"},{"key":"key2020061114431815800_ref003","doi-asserted-by":"crossref","unstructured":"Basuchowdhuri, P., Anand, S., Srivastava, D.R., Mishra, K. and Saha, S.K. (2014), \u201cDetection of communities in social networks using spanning tree\u201d, Advanced Computing, Networking and Informatics, Vol. 2, pp. 589-597.","DOI":"10.1007\/978-3-319-07350-7_65"},{"key":"key2020061114431815800_ref004","volume-title":"Introduction to Algorithms","year":"2009"},{"key":"key2020061114431815800_ref005","first-page":"615","article-title":"Demon: a local-first discovery method for overlapping communities","year":"2012"},{"key":"key2020061114431815800_ref006","first-page":"597","article-title":"Vertex neighborhoods, low conductance cuts, and good seeds for local community methods","year":"2012"},{"key":"key2020061114431815800_ref007","first-page":"167","article-title":"Generating scale-free networks with adjustable clustering coefficient via random walks","year":"2011","journal-title":"IEEE Network Science Workshop"},{"key":"key2020061114431815800_ref008","unstructured":"Khawla, A. (2019), UMSTMO, available at: https:\/\/github.com\/khawka\/UMSTMO"},{"key":"key2020061114431815800_ref009","first-page":"e18961","article-title":"Finding statistically significant communities in networks","volume-title":"PloS One","year":"2011"},{"key":"key2020061114431815800_ref010","article-title":"Detecting highly overlapping community structure by greedy clique expansion","year":"2010"},{"key":"key2020061114431815800_ref011","unstructured":"Leskovec, J. (2010), \u201cStanford network analysis\u201d, available at: http:\/\/snap.stanford.edu"},{"key":"key2020061114431815800_ref012","first-page":"448","article-title":"Structure-preserving sparsification of social networks","year":"2015"},{"key":"key2020061114431815800_ref013","article-title":"Normalized mutual information to evaluate overlapping community finding algorithms","year":"2011"},{"issue":"2","key":"key2020061114431815800_ref014","doi-asserted-by":"crossref","first-page":"595","DOI":"10.7155\/jgaa.00370","article-title":"Untangling the hairballs of multi- centered, small-world online social media networks","volume":"19","year":"2015","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"7043","key":"key2020061114431815800_ref015","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1038\/nature03607","article-title":"Uncovering the overlapping community structure of complex networks in nature and society","volume":"435","year":"2005","journal-title":"Nature"},{"key":"key2020061114431815800_ref016","first-page":"284","article-title":"Computing communities in large networks using random walks","year":"2005"},{"key":"key2020061114431815800_ref017","first-page":"73","article-title":"Graph theory analysis of protein-protein interactions","volume":"8","year":"2005","journal-title":"Knowledge Discovery in Proteomics"},{"issue":"4","key":"key2020061114431815800_ref018","doi-asserted-by":"crossref","first-page":"1118","DOI":"10.1073\/pnas.0706851105","article-title":"Maps of random walks on complex networks reveal community structure","volume":"105","year":"2008","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"key2020061114431815800_ref019","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/j.physa.2016.05.014","article-title":"Community detection in networks based on minimum spanning tree and modularity","volume":"460","year":"2016","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"key2020061114431815800_ref020","first-page":"721","article-title":"Local graph sparsification for scalable clustering","year":"2011"},{"issue":"8","key":"key2020061114431815800_ref021","doi-asserted-by":"crossref","first-page":"1706","DOI":"10.1016\/j.physa.2008.12.021","article-title":"Detect overlapping and hierarchical community structure in networks","volume":"388","year":"2009","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"key2020061114431815800_ref022","first-page":"2099","article-title":"Overlapping community detection using seed set expansion","year":"2013"},{"issue":"5","key":"key2020061114431815800_ref023","doi-asserted-by":"crossref","first-page":"1272","DOI":"10.1109\/TKDE.2016.2518687","article-title":"Overlapping community detection using neighborhood-inated seed expansion","volume":"28","year":"2016","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"key2020061114431815800_ref024","first-page":"705","article-title":"Scalable and memory-effcient clustering of large-scale social networks","year":"2012"},{"key":"key2020061114431815800_ref025","first-page":"43","article-title":"Overlapping community detection in networks: the state-of-the-art and comparative study","volume-title":"ACM Computing Surveys (CSUR)","year":"2013"},{"key":"key2020061114431815800_ref026","first-page":"587","article-title":"Overlapping community detection at scale: a non- negative matrix factorization approach","year":"2013"}],"container-title":["Library Hi Tech"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/LHT-01-2019-0003\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/LHT-01-2019-0003\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T22:13:53Z","timestamp":1753395233000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/lht\/article\/38\/2\/276-292\/271634"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,8]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,1,8]]}},"alternative-id":["10.1108\/LHT-01-2019-0003"],"URL":"https:\/\/doi.org\/10.1108\/lht-01-2019-0003","relation":{},"ISSN":["0737-8831"],"issn-type":[{"value":"0737-8831","type":"print"}],"subject":[],"published":{"date-parts":[[2020,1,8]]}}}