{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T04:02:52Z","timestamp":1775880172685,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T00:00:00Z","timestamp":1751500800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T00:00:00Z","timestamp":1751500800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>ARLClustering is an open-source R package for community detection in social networks. Unlike traditional methods that rely on structural properties such as modularity, degree centrality, and clustering coefficient, ARLClustering leverages association rule mining (ARM) to identify meaningful interaction patterns based on users\u2019 friendship activity. By analyzing frequent interaction rules, it uncovers communities that may be overlooked by purely structural approaches. The package offers a comprehensive set of functions tailored for social network analysis. It has been tested on real-world datasets, including the Karate Club, Dolphins, LesMiserables, NetScience, and Facebook networks. The results demonstrate its effectiveness in detecting communities and provide a comparative analysis against existing methods. ARLClustering is now available on the CRAN repository, with its source code accessible on GitHub. It serves as a valuable tool for researchers and practitioners, not only enhancing community detection techniques in social network analysis but also introducing a novel approach to uncover hidden communities through experimental studies on real-world social network datasets.<\/jats:p>","DOI":"10.1007\/s41109-025-00715-w","type":"journal-article","created":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T09:43:02Z","timestamp":1751535782000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Arlclustering: an R package for community detection in social networks based on user interaction and association rule learning"],"prefix":"10.1007","volume":"10","author":[{"given":"Mohamed","family":"El-Moussaoui","sequence":"first","affiliation":[]},{"given":"Mohamed","family":"Hanine","sequence":"additional","affiliation":[]},{"given":"Ali","family":"Kartit","sequence":"additional","affiliation":[]},{"given":"Tarik","family":"Agouti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,3]]},"reference":[{"issue":"6","key":"715_CR1","doi-asserted-by":"publisher","first-page":"6718","DOI":"10.11591\/ijecedd","volume":"13","author":"M Adraoui","year":"2023","unstructured":"Adraoui M, Souabi S, Retbi A, Idrissi MK, Bennani S (2023) Towards a hybrid recommendation approach using a community detection and evaluation algorithm. Int J Electric Comput Eng (IJECE) 13(6):6718\u20136728. https:\/\/doi.org\/10.11591\/ijecedd","journal-title":"Int J Electric Comput Eng (IJECE)"},{"key":"715_CR2","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s10489-018-1297-9","volume":"49","author":"M Arasteh","year":"2019","unstructured":"Arasteh M, Alizadeh S (2019) A fast divisive community detection algorithm based on edge degree betweenness centrality. Appl Intell 49:689\u2013702","journal-title":"Appl Intell"},{"issue":"6","key":"715_CR3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman ME, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(6):066111","journal-title":"Phys Rev E"},{"key":"715_CR4","doi-asserted-by":"crossref","unstructured":"Douadi A, Kamel N, Sais L (2024) Label propagation algorithm for community discovery based on centrality and common neighbours. J Supercomput 1\u201327","DOI":"10.1007\/s11227-024-05904-5"},{"issue":"2","key":"715_CR5","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s11067-015-9288-4","volume":"16","author":"M Fire","year":"2016","unstructured":"Fire M, Puzis R (2016) Organization mining using online social networks. Netw Spat Econ 16(2):545\u2013578","journal-title":"Netw Spat Econ"},{"key":"715_CR6","doi-asserted-by":"publisher","unstructured":"Gera I, London A, Pluh\u00e1r A (2022) Greedy algorithm for edge-based nested community detection. In: 2022 IEEE 2nd conference on information technology and data science (CITDS), pp 86\u201391. IEEE. https:\/\/doi.org\/10.1109\/CITDS54976.2022.9914051","DOI":"10.1109\/CITDS54976.2022.9914051"},{"issue":"12","key":"715_CR7","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821\u20137826","journal-title":"Proc Natl Acad Sci"},{"key":"715_CR8","doi-asserted-by":"publisher","unstructured":"Karthik VS, Vardhan GPSV, Reddy KLR, Lakshmi TJ (2024) Comparative analysis of community detection algorithms in biological networks. In: 2024 International conference on emerging technologies in computer science for interdisciplinary applications (ICETCS), pp 1\u20135. IEEE. https:\/\/doi.org\/10.1109\/ICETCS61022.2024.10543905","DOI":"10.1109\/ICETCS61022.2024.10543905"},{"key":"715_CR9","unstructured":"Knuth DE (1993) The Stanford GraphBase: a platform for combinatorial computing vol. 37. https:\/\/www-cs-faculty.stanford.edu\/[CDATA[\\sim ]]$$\\sim $$knuth\/sgb.html"},{"key":"715_CR10","doi-asserted-by":"crossref","unstructured":"Li J, Lai S, Shuai Z, Tan Y, Jia Y, Yu M, Song Z, Peng X, Xu Z, Ni Y et al (2024) A comprehensive review of community detection in graphs. Neurocomputing 128169","DOI":"10.1016\/j.neucom.2024.128169"},{"issue":"6","key":"715_CR11","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.3390\/electronics13061119","volume":"13","author":"Y Liu","year":"2024","unstructured":"Liu Y, Liu W, Tang X, Yin H, Yin P, Xu X, Wang Y (2024) Csim: a fast community detection algorithm based on structure information maximization. Electronics 13(6):1119","journal-title":"Electronics"},{"key":"715_CR12","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","volume":"54","author":"D Lusseau","year":"2003","unstructured":"Lusseau D, Schneider K, Boisseau OJ, Haase P, Slooten E, Dawson SM (2003) The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations: can geographic isolation explain this unique trait? Behav Ecol Sociobiol 54:396\u2013405","journal-title":"Behav Ecol Sociobiol"},{"issue":"4","key":"715_CR13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.96.042307","volume":"96","author":"BF Maier","year":"2017","unstructured":"Maier BF, Brockmann D (2017) Cover time for random walks on arbitrary complex networks. Phys Rev E 96(4):042307","journal-title":"Phys Rev E"},{"issue":"5663","key":"715_CR14","doi-asserted-by":"publisher","first-page":"1538","DOI":"10.1126\/science.1089167","volume":"303","author":"R Milo","year":"2004","unstructured":"Milo R, Itzkovitz S, Kashtan N, Levitt R, Shen-Orr S, Ayzenshtat I, Sheffer M, Alon U (2004) Superfamilies of evolved and designed networks. Science 303(5663):1538\u20131542","journal-title":"Science"},{"key":"715_CR15","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1140\/epjb\/e2004-00124-y","volume":"38","author":"ME Newman","year":"2004","unstructured":"Newman ME (2004) Detecting community structure in networks. Eur Phys J B 38:321\u2013330","journal-title":"Eur Phys J B"},{"issue":"3","key":"715_CR16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"ME Newman","year":"2006","unstructured":"Newman ME (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E Nonlinear Soft Matter Phys 74(3):036104","journal-title":"Phys Rev E Nonlinear Soft Matter Phys"},{"issue":"23","key":"715_CR17","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"ME Newman","year":"2006","unstructured":"Newman ME (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577\u20138582","journal-title":"Proc Natl Acad Sci"},{"key":"715_CR18","doi-asserted-by":"publisher","unstructured":"Pan L, Wang C, Xie J (2013) A spin-glass model based local community detection method in social networks. In: 2013 IEEE 25th international conference on tools with artificial intelligence, pp 108\u2013115. IEEE. https:\/\/doi.org\/10.1109\/ICTAI.2013.26","DOI":"10.1109\/ICTAI.2013.26"},{"issue":"5","key":"715_CR19","doi-asserted-by":"publisher","first-page":"2393","DOI":"10.1137\/17M1144143","volume":"78","author":"F Tudisco","year":"2018","unstructured":"Tudisco F, Mercado P, Hein M (2018) Community detection in networks via nonlinear modularity eigenvectors. SIAM J Appl Math 78(5):2393\u20132419","journal-title":"SIAM J Appl Math"},{"key":"715_CR20","unstructured":"Wickham H, Bryan J (2023) R packages: organize. document, and share your code, test"},{"issue":"4","key":"715_CR21","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33(4):452\u2013473","journal-title":"J Anthropol Res"},{"issue":"1","key":"715_CR22","first-page":"1485592","volume":"2021","author":"J Zhang","year":"2021","unstructured":"Zhang J, Fei J, Song X, Feng J (2021) An improved Louvain algorithm for community detection. Math Probl Eng 2021(1):1485592","journal-title":"Math Probl Eng"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00715-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-025-00715-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00715-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T09:43:05Z","timestamp":1751535785000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-025-00715-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,3]]},"references-count":22,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["715"],"URL":"https:\/\/doi.org\/10.1007\/s41109-025-00715-w","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,3]]},"assertion":[{"value":"8 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"25"}}