{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:28:17Z","timestamp":1754155697572,"version":"3.41.2"},"reference-count":68,"publisher":"Emerald","issue":"2","license":[{"start":{"date-parts":[[2021,5,5]],"date-time":"2021-05-05T00:00:00Z","timestamp":1620172800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ITP"],"published-print":{"date-parts":[[2024,3,18]]},"abstract":"Purpose<\/jats:title>Communities representing groups of agents with similar interests or functions are one of the essential features of complex networks. Finding communities in real-world networks is critical for analyzing complex systems in various areas ranging from collaborative information to political systems. Given the different characteristics of networks and the capability of community detection in handling a plethora of societal problems, community detection methods represent an emerging area of research. Contributing to this field, the authors propose a new community detection algorithm based on the hybridization of node and link granulation.<\/jats:p><\/jats:sec>Design\/methodology\/approach<\/jats:title>The proposed algorithm utilizes a rough set-theoretic concept called closure on networks. Initial sets are constructed by using neighborhood topology around the nodes as well as links and represented as two different categories of granules. Subsequently, the authors iteratively obtain the constrained closure of these sets. The authors use node mutuality and link mutuality as merging criteria for node and link granules, respectively, during the iterations. Finally, the constrained closure subsets of nodes and links are combined and refined using the Jaccard similarity coefficient and a local density function to obtain communities in a binary network.<\/jats:p><\/jats:sec>Findings<\/jats:title>Extensive experiments conducted on twelve real-world networks followed by a comparison with state-of-the-art methods demonstrate the viability and effectiveness of the proposed algorithm.<\/jats:p><\/jats:sec>Research limitations\/implications<\/jats:title>The study also contributes to the ongoing effort related to the application of soft computing techniques to model complex systems. The extant literature has integrated a rough set-theoretic approach with a fuzzy granular model (Kundu and Pal, 2015) and spectral clustering (Huang and Xiao, 2012) for node-centric community detection in complex networks. In contributing to this stream of work, the proposed algorithm leverages the unexplored synergy between rough set theory, node granulation and link granulation in the context of complex networks. Combined with experiments of network datasets from various domains, the results indicate that the proposed algorithm can effectively reveal co-occurring disjoint, overlapping and nested communities without necessarily assigning each node to a community.<\/jats:p><\/jats:sec>Practical implications<\/jats:title>This study carries important practical implications for complex adaptive systems in business and management sciences, in which entities are increasingly getting organized into communities (Jacucci et al.<\/jats:italic>, 2006). The proposed community detection method can be used for network-based fraud detection by enabling experts to understand the formation and development of fraudulent setups with an active exchange of information and resources between the firms (Van Vlasselaer et al.<\/jats:italic>, 2017). Products and services are getting connected and mapped in every walk of life due to the emergence of a variety of interconnected devices, social networks and software applications.<\/jats:p><\/jats:sec>Social implications<\/jats:title>The proposed algorithm could be extended for community detection on customer trajectory patterns and design recommendation systems for online products and services (Ghose et al.<\/jats:italic>, 2019; Liu and Wang, 2017). In line with prior research, the proposed algorithm can aid companies in investigating the characteristics of implicit communities of bloggers or social media users for their services and products so as to identify peer influencers and conduct targeted marketing (Chau and Xu, 2012; De Matos et al.<\/jats:italic>, 2014; Zhang et al.<\/jats:italic>, 2016). The proposed algorithm can be used to understand the behavior of each group and the appropriate communication strategy for that group. For instance, a group using a specific language or following a specific account might benefit more from a particular piece of content than another group. The proposed algorithm can thus help in exploring the factors defining communities and confronting many real-life challenges.<\/jats:p><\/jats:sec>Originality\/value<\/jats:title>This work is based on a theoretical argument that communities in networks are not only based on compatibility among nodes but also on the compatibility among links. Building up on the aforementioned argument, the authors propose a community detection method that considers the relationship among both the entities in a network (nodes and links) as opposed to traditional methods, which are predominantly based on relationships among nodes only.<\/jats:p><\/jats:sec>","DOI":"10.1108\/itp-10-2020-0682","type":"journal-article","created":{"date-parts":[[2021,5,5]],"date-time":"2021-05-05T09:25:17Z","timestamp":1620206717000},"page":"919-943","source":"Crossref","is-referenced-by-count":11,"title":["Understanding digitally enabled complex networks: a plural granulation based hybrid community detection approach"],"prefix":"10.1108","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3999-1177","authenticated-orcid":false,"given":"Samrat","family":"Gupta","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4371-046X","authenticated-orcid":false,"given":"Swanand","family":"Deodhar","sequence":"additional","affiliation":[]}],"member":"140","published-online":{"date-parts":[[2021,5,5]]},"reference":[{"key":"key2024031800483567900_ref001","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1038\/nature09182","article-title":"Link communities reveal multiscale complexity in networks","volume":"466","year":"2010","journal-title":"Nature"},{"key":"key2024031800483567900_ref002","first-page":"1","article-title":"Network science: introduction","year":"2014","journal-title":"Network science"},{"issue":"2","key":"key2024031800483567900_ref003","doi-asserted-by":"crossref","first-page":"026129","DOI":"10.1103\/PhysRevE.80.026129","article-title":"Detecting network communities by propagating labels under constraints","volume":"80","year":"2009","journal-title":"Physical Review E"},{"first-page":"97","article-title":"Finding communities by clustering a graph into overlapping subgraphs","year":"2005","key":"key2024031800483567900_ref004"},{"key":"key2024031800483567900_ref005","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10115-018-1156-3","article-title":"DFuzzy: a deep learning based fuzzy clustering model for large graphs","volume":"57","year":"2018","journal-title":"Knowledge and Information Systems"},{"key":"key2024031800483567900_ref006","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","year":"2008","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"key":"key2024031800483567900_ref007","first-page":"1189","article-title":"Business intelligence in blogs: understanding consumer interactions and communities","year":"2012","journal-title":"MIS Quarterly"},{"key":"key2024031800483567900_ref008","doi-asserted-by":"crossref","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","article-title":"Finding community structure in very large networks","volume":"70","year":"2004","journal-title":"Physical review E"},{"key":"key2024031800483567900_ref009","first-page":"P09008","article-title":"Comparing community structure identification","volume":"2005","year":"2005","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"issue":"4","key":"key2024031800483567900_ref010","doi-asserted-by":"crossref","first-page":"1103","DOI":"10.25300\/MISQ\/2014\/38.4.08","article-title":"Peer influence in the diffusion of iPhone 3G over a large social network","volume":"38","year":"2014","journal-title":"MIS Quarterly"},{"volume-title":"Comparing Network Covers Using Mutual Information","year":"2012","key":"key2024031800483567900_ref011"},{"issue":"1","key":"key2024031800483567900_ref012","first-page":"1","article-title":"Anatomical networks reveal the musculoskeletal modularity of the human head","volume":"5","year":"2015","journal-title":"Scientific Reports"},{"key":"key2024031800483567900_ref013","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","article-title":"Community detection in graphs","volume":"486","year":"2010","journal-title":"Physics Reports"},{"key":"key2024031800483567900_ref014","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2016.09.002","article-title":"Community detection in networks: a user guide","volume":"659","year":"2016","journal-title":"Physics Reports"},{"issue":"11","key":"key2024031800483567900_ref015","doi-asserted-by":"crossref","first-page":"5027","DOI":"10.1287\/mnsc.2018.3188","article-title":"Mobile targeting using customer trajectory patterns","volume":"65","year":"2019","journal-title":"Management Science"},{"key":"key2024031800483567900_ref016","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","article-title":"Community structure in social and biological networks","volume":"99","year":"2002","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"2","key":"key2024031800483567900_ref017","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1108\/09593841111137322","article-title":"Completely online group formation and development: small groups as socio\u2010technical systems","volume":"24","year":"2011","journal-title":"Information Technology and People"},{"key":"key2024031800483567900_ref018","doi-asserted-by":"crossref","first-page":"103018","DOI":"10.1088\/1367-2630\/12\/10\/103018","article-title":"Finding overlapping communities in networks by label propagation","volume":"12","year":"2010","journal-title":"New Journal of Physics"},{"key":"key2024031800483567900_ref019","doi-asserted-by":"crossref","first-page":"036102","DOI":"10.1103\/PhysRevE.76.036102","article-title":"Module identification in bipartite and directed networks","volume":"76","year":"2007","journal-title":"Physical Review E"},{"key":"key2024031800483567900_ref020","doi-asserted-by":"crossref","first-page":"101777","DOI":"10.1016\/j.datak.2019.101777","article-title":"An overlapping community detection algorithm based on rough clustering of links","volume":"125","year":"2020","journal-title":"Data and Knowledge Engineering"},{"first-page":"34","article-title":"A rough connectedness algorithm for mining communities in complex networks","year":"2016","key":"key2024031800483567900_ref021"},{"key":"key2024031800483567900_ref022","doi-asserted-by":"crossref","first-page":"8638","DOI":"10.1038\/srep08638","article-title":"Identification of hybrid node and link communities in complex networks","volume":"5","year":"2015","journal-title":"Scientific Reports"},{"key":"key2024031800483567900_ref023","first-page":"263","article-title":"Rough spectral clustering algorithm applied to overlapping network communities discovery","volume":"33","year":"2012","journal-title":"Journal of Chinese Computer Systems"},{"key":"key2024031800483567900_ref024","doi-asserted-by":"crossref","first-page":"2160","DOI":"10.1016\/j.physa.2010.10.040","article-title":"Density-based shrinkage for revealing hierarchical and overlapping community structure in networks","volume":"390","year":"2011","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"key2024031800483567900_ref025","first-page":"547","article-title":"\u00c9tude comparative de la distribution florale dans une portion des Alpes et des Jura","volume":"37","year":"1901","journal-title":"Bulletin de la Soci\u00e9t\u00e9 Vaudoise des Sciences Naturelles"},{"issue":"1","key":"key2024031800483567900_ref026","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1108\/09593840610700800","article-title":"Interpreting socio\u2010technical co\u2010evolution","volume":"19","year":"2006","journal-title":"Information Technology and People"},{"key":"key2024031800483567900_ref027","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","year":"2018","journal-title":"Journal of Network and Computer Applications"},{"first-page":"71","article-title":"Community detection in social and biological networks using differential evolution","year":"2012","key":"key2024031800483567900_ref028"},{"issue":"5","key":"key2024031800483567900_ref029","first-page":"P05031","article-title":"A Markov random walk under constraint for discovering overlapping communities in complex networks","volume":"2011","year":"2011","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"volume-title":"The Stanford GraphBase: A Platform for Combinatorial Computing","year":"1993","key":"key2024031800483567900_ref030"},{"key":"key2024031800483567900_ref031","unstructured":"Krebs, V. (2004), \u201cBooks about us politics\u201d, Unpublished, available at: http:\/\/wwworgnet.com."},{"key":"key2024031800483567900_ref032","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.datak.2007.01.003","article-title":"Rough clustering of sequential data","volume":"63","year":"2007","journal-title":"Data & Knowledge Engineering"},{"key":"key2024031800483567900_ref033","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.dss.2017.02.010","article-title":"An upper approximation based community detection algorithm for complex networks","volume":"96","year":"2017","journal-title":"Decision Support Systems"},{"key":"key2024031800483567900_ref034","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.patrec.2015.02.005","article-title":"Fuzzy-rough community in social networks","volume":"67","year":"2015","journal-title":"Pattern Recognition Letters"},{"key":"key2024031800483567900_ref035","doi-asserted-by":"crossref","first-page":"033015","DOI":"10.1088\/1367-2630\/11\/3\/033015","article-title":"Detecting the overlapping and hierarchical community structure in complex networks","volume":"11","year":"2009","journal-title":"New Journal of Physics"},{"key":"key2024031800483567900_ref036","doi-asserted-by":"crossref","first-page":"e18961","DOI":"10.1371\/journal.pone.0018961","article-title":"Finding statistically significant communities in networks","volume":"6","year":"2011","journal-title":"PloS One"},{"key":"key2024031800483567900_ref037","first-page":"309","article-title":"Overlapping stochastic block models with application to the French political blogosphere","volume":"5","year":"2011","journal-title":"Annals of Applied Statistics"},{"first-page":"33","article-title":"Detecting highly overlapping community structure by greedy clique expansion","year":"2010","key":"key2024031800483567900_ref038"},{"key":"key2024031800483567900_ref039","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/978-1-4471-3238-7_31","article-title":"Rough approximate operators: axiomatic rough set theory","volume-title":"Rough Sets, Fuzzy Sets and Knowledge Discovery","year":"1994"},{"issue":"4","key":"key2024031800483567900_ref040","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1109\/TKDE.2016.2637898","article-title":"Trajectory community discovery and recommendation by multi-source diffusion modeling","volume":"29","year":"2017","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"key2024031800483567900_ref041","doi-asserted-by":"crossref","first-page":"22470","DOI":"10.1038\/srep22470","article-title":"Discovering communities in complex networks by edge label propagation","volume":"6","year":"2016","journal-title":"Scientific Reports"},{"issue":"4","key":"key2024031800483567900_ref042","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","year":"2003","journal-title":"Behavioral Ecology and Sociobiology"},{"first-page":"112","article-title":"Detecting highly overlapping communities with model-based overlapping seed expansion","year":"2010","key":"key2024031800483567900_ref043"},{"key":"key2024031800483567900_ref044","doi-asserted-by":"crossref","first-page":"016107","DOI":"10.1103\/PhysRevE.77.016107","article-title":"Fuzzy communities and the concept of bridgeness in complex networks","volume":"77","year":"2008","journal-title":"Physical review E"},{"key":"key2024031800483567900_ref045","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","article-title":"Finding and evaluating community structure in networks","volume":"69","year":"2004","journal-title":"Physical review E"},{"key":"key2024031800483567900_ref046","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":"key2024031800483567900_ref047","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s10618-011-0224-z","article-title":"Community detection in social media","volume":"24","year":"2012","journal-title":"Data Mining and Knowledge Discovery"},{"key":"key2024031800483567900_ref048","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01001956","article-title":"Rough sets","volume":"11","year":"1982","journal-title":"International Journal of Computer and Information Sciences"},{"first-page":"859","article-title":"Overlapped community detection in complex networks","year":"2009","key":"key2024031800483567900_ref049"},{"key":"key2024031800483567900_ref050","doi-asserted-by":"crossref","first-page":"066114","DOI":"10.1103\/PhysRevE.83.066114","article-title":"Overlapping community detection using bayesian non-negative matrix factorization","volume":"83","year":"2011","journal-title":"Physical review E"},{"key":"key2024031800483567900_ref051","doi-asserted-by":"crossref","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","article-title":"Near linear time algorithm to detect community structures in large-scale networks","volume":"76","year":"2007","journal-title":"Physical review E"},{"key":"key2024031800483567900_ref052","doi-asserted-by":"crossref","first-page":"e18209","DOI":"10.1371\/journal.pone.0018209","article-title":"Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems","volume":"6","year":"2011","journal-title":"PloS One"},{"issue":"3","key":"key2024031800483567900_ref053","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1016\/j.ejor.2016.10.033","article-title":"Efficient modularity density heuristics for large graphs","volume":"258","year":"2017","journal-title":"European Journal of Operational Research"},{"key":"key2024031800483567900_ref054","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","article-title":"Graph clustering","volume":"1","year":"2007","journal-title":"Computer science review"},{"key":"key2024031800483567900_ref055","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":"key2024031800483567900_ref056","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/j.datak.2013.05.004","article-title":"A link clustering based overlapping community detection algorithm","volume":"87","year":"2013","journal-title":"Data and Knowledge Engineering"},{"key":"key2024031800483567900_ref057","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/j.patrec.2009.11.001","article-title":"Identifying and evaluating community structure in complex networks","volume":"31","year":"2010","journal-title":"Pattern Recognition Letters"},{"issue":"9","key":"key2024031800483567900_ref058","doi-asserted-by":"crossref","first-page":"3090","DOI":"10.1287\/mnsc.2016.2489","article-title":"Gotcha! Network-based fraud detection for social security fraud","volume":"63","year":"2017","journal-title":"Management Science"},{"key":"key2024031800483567900_ref059","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1109\/JSEE.2014.00125","article-title":"Density-based rough set model for hesitant node clustering in overlapping community detection","volume":"25","year":"2014","journal-title":"Journal of Systems Engineering and Electronics"},{"issue":"3","key":"key2024031800483567900_ref060","first-page":"1011","article-title":"E-book adoption behaviors through an online sharing platform","volume":"33","year":"2019","journal-title":"Information Technology and People"},{"first-page":"344","article-title":"Slpa: uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process","year":"2011","key":"key2024031800483567900_ref061"},{"key":"key2024031800483567900_ref062","first-page":"43","article-title":"Overlapping community detection in networks: the state-of-the-art and comparative study","volume":"45","year":"2013","journal-title":"ACM Computing Surveys (Csur)"},{"key":"key2024031800483567900_ref063","first-page":"452","article-title":"An information flow model for conflict and fission in small groups","year":"1977","journal-title":"Journal of Anthropological Research"},{"key":"key2024031800483567900_ref064","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1016\/j.physa.2006.07.023","article-title":"Identification of overlapping community structure in complex networks using fuzzy c-means clustering","volume":"374","year":"2007","journal-title":"Physica A: Statistical Mechanics and Its Applications"},{"key":"key2024031800483567900_ref065","doi-asserted-by":"crossref","first-page":"062803","DOI":"10.1103\/PhysRevE.87.062803","article-title":"Overlapping community detection in complex networks using symmetric binary matrix factorization","volume":"87","year":"2013","journal-title":"Physical Review E"},{"issue":"4","key":"key2024031800483567900_ref066","doi-asserted-by":"crossref","first-page":"849","DOI":"10.25300\/MISQ\/2016\/40.4.03","article-title":"Large-Scale network analysis for online social brand advertising","volume":"40","year":"2016","journal-title":"MIS Quarterly"},{"issue":"12","key":"key2024031800483567900_ref067","doi-asserted-by":"crossref","first-page":"3613","DOI":"10.1007\/s00521-017-2946-3","article-title":"True-link clustering through signaling process and subcommunity merge in overlapping community detection","volume":"30","year":"2018","journal-title":"Neural Computing and Applications"},{"key":"key2024031800483567900_ref068","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.physa.2015.02.020","article-title":"An ant colony based algorithm for overlapping community detection in complex networks","volume":"427","year":"2015","journal-title":"Physica A: Statistical Mechanics and Its Applications"}],"container-title":["Information Technology & People"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/ITP-10-2020-0682\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/ITP-10-2020-0682\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T21:55:48Z","timestamp":1753394148000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/itp\/article\/37\/2\/919-943\/1225075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,5]]},"references-count":68,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2021,5,5]]},"published-print":{"date-parts":[[2024,3,18]]}},"alternative-id":["10.1108\/ITP-10-2020-0682"],"URL":"https:\/\/doi.org\/10.1108\/itp-10-2020-0682","relation":{},"ISSN":["0959-3845"],"issn-type":[{"type":"print","value":"0959-3845"}],"subject":[],"published":{"date-parts":[[2021,5,5]]}}}