{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T03:49:31Z","timestamp":1773805771078,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T00:00:00Z","timestamp":1664150400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T00:00:00Z","timestamp":1664150400000},"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":["J Intell Inf Syst"],"published-print":{"date-parts":[[2023,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Community detection in networks is a useful tool for detecting the behavioral and inclinations of users to a specific topic or title. Weighted, unweighted, directed, and undirected networks can all be used for detecting communities depending on the network structure and content. The proposed model framework for community detection is based on weighted networks. We use two important and effective concepts in graph analysis. The structural density between nodes is the first concept, and the second is the weight of edges between nodes. The proposed model advantage is using a probabilistic generative model that estimates the latent parameters of the probabilistic model and detecting the community based on the probability of the presence or absence of weighted edge. The output of the proposed model is the intensity of belonging each weighted node to the communities. A relationship between the observation of a pair of nodes in multiple communities and the probability of an edge with a high weight between them, is one of the important outputs that interpret the detected communities by finding relevancy between membership of nodes to communities and edge weight. Experiments are performed on real-world weighted networks and synthetic weighted networks to evaluate the performance and accuracy of the proposed algorithm. The results will show that the proposed algorithm is more density and accurate than other algorithms in weighted community detection.<\/jats:p>","DOI":"10.1007\/s10844-022-00740-6","type":"journal-article","created":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T19:03:40Z","timestamp":1664219020000},"page":"119-136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Community detection in weighted networks using probabilistic generative model"],"prefix":"10.1007","volume":"60","author":[{"given":"Hossein","family":"Hajibabaei","sequence":"first","affiliation":[]},{"given":"Vahid","family":"Seydi","sequence":"additional","affiliation":[]},{"given":"Abbas","family":"Koochari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,26]]},"reference":[{"key":"740_CR1","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1038\/nature09182","volume":"466","author":"Y Ahn","year":"2010","unstructured":"Ahn, Y., Bagrow, J., & Lehmann, S. (2010). Link communities reveal multiscale complexity in networks. Nature, 466, 761\u2013764.","journal-title":"Nature"},{"key":"740_CR2","doi-asserted-by":"publisher","first-page":"140536","DOI":"10.1098\/rsos.140536","volume":"3","author":"S Beckett","year":"2016","unstructured":"Beckett, S. (2016). Improved community detection in weighted bipartite networks. Royal Society Open Science, 3, 140536.","journal-title":"Royal Society Open Science"},{"key":"740_CR3","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"V Blondel","year":"2008","unstructured":"Blondel, V., Guillaume, J., Lambiotte, R., & Lefebvre, E. (2008). Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 2008, P10008.","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"key":"740_CR4","doi-asserted-by":"crossref","unstructured":"Celebi, M. (2014). Partitional clustering algorithms. Springer.","DOI":"10.1007\/978-3-319-09259-1"},{"key":"740_CR5","doi-asserted-by":"publisher","first-page":"4177","DOI":"10.1016\/j.physa.2010.05.046","volume":"389","author":"D Chen","year":"2010","unstructured":"Chen, D., Shang, M., Lv, Z., & Fu, Y. (2010). Detecting overlapping communities of weighted networks via a local algorithm. Physica A: Statistical Mechanics and its Applications, 389, 4177\u20134187.","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"740_CR6","doi-asserted-by":"publisher","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset, A., Newman, M., & Moore, C. (2004). Finding community structure in very large networks. Physical Review E, 70, 066111.","journal-title":"Physical Review E"},{"key":"740_CR7","doi-asserted-by":"crossref","unstructured":"Donath, W., & Hoffman, A. (2003). Lower bounds for the partitioning of graphs. Selected Papers Of Alan J Hoffman: With Commentary, 437\u2013442.","DOI":"10.1142\/9789812796936_0044"},{"key":"740_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2016.09.002","volume":"659","author":"S Fortunato","year":"2016","unstructured":"Fortunato, S., & Hric, D. (2016). Community detection in networks: A user guide. Physics Reports, 659, 1\u201344.","journal-title":"Physics Reports"},{"key":"740_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S. (2010). Community detection in graphs. Physics Reports, 486, 75\u2013174.","journal-title":"Physics Reports"},{"key":"740_CR10","doi-asserted-by":"crossref","unstructured":"Fu, S., Wang, G., Xu, J., & Xia, S. (2021). IbLT: An effective granular computing framework for hierarchical community detection. Journal Of Intelligent Information Systems, 1\u201322.","DOI":"10.1007\/s10844-021-00668-3"},{"key":"740_CR11","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., & Newman, M. (2002). Community structure in social and biological networks. Proceedings of the National Academy of Sciences, 99, 7821\u20137826.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"740_CR12","doi-asserted-by":"publisher","first-page":"103018","DOI":"10.1088\/1367-2630\/12\/10\/103018","volume":"12","author":"S Gregory","year":"2010","unstructured":"Gregory, S. (2010). Finding overlapping communities in networks by label propagation. New Journal of Physics, 12, 103018.","journal-title":"New Journal of Physics"},{"key":"740_CR13","doi-asserted-by":"crossref","unstructured":"Gleich, D., & Seshadhri, C. (2012). Vertex neighborhoods, low conductance cuts, and good seeds for local community methods. In Proceedings Of The 18th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 597\u2013605).","DOI":"10.1145\/2339530.2339628"},{"key":"740_CR14","doi-asserted-by":"crossref","unstructured":"Hsieh, C., & Dhillon, I. (2011). Fast coordinate descent methods with variable selection for non-negative matrix factorization. In Proceedings Of The 17th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 1064\u20131072).","DOI":"10.1145\/2020408.2020577"},{"key":"740_CR15","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.jnca.2018.02.011","volume":"108","author":"M Javed","year":"2018","unstructured":"Javed, M., Younis, M., Latif, S., Qadir, J., & Baig, A. (2018). Community detection in networks: A multidisciplinary review. Journal of Network and Computer Applications, 108, 87\u2013111.","journal-title":"Journal of Network and Computer Applications"},{"key":"740_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s10844-020-00625-6","volume":"57","author":"S Kumar","year":"2021","unstructured":"Kumar, S., Panda, B., & Aggarwal, D. (2021). Community detection in complex networks using network embedding and gravitational search algorithm. Journal of Intelligent Information Systems, 57, 51\u201372.","journal-title":"Journal of Intelligent Information Systems"},{"key":"740_CR17","doi-asserted-by":"crossref","unstructured":"Kumar, S., Morstatter, F., & Liu, H. (2014). Twitter data analytics. Springer.","DOI":"10.1007\/978-1-4614-9372-3"},{"key":"740_CR18","doi-asserted-by":"publisher","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti, A., Fortunato, S., & Radicchi, F. (2008). Benchmark graphs for testing community detection algorithms. Physical Review E, 78, 046110.","journal-title":"Physical Review E"},{"key":"740_CR19","doi-asserted-by":"publisher","first-page":"016118","DOI":"10.1103\/PhysRevE.80.016118","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti, A., & Fortunato, S. (2009). Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Physical Review E, 80, 016118.","journal-title":"Physical Review E"},{"key":"740_CR20","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"D Lee","year":"1999","unstructured":"Lee, D., & Seung, H. (1999). Learning the parts of objects by non-negative matrix factorization. Nature, 401, 788\u2013791.","journal-title":"Nature"},{"key":"740_CR21","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ipm.2018.10.004","volume":"56","author":"C Li","year":"2019","unstructured":"Li, C., Bai, J., Wenjun, Z., & Xihao, Y. (2019). Community detection using hierarchical clustering based on edge-weighted similarity in cloud environment. Information Processing & Management, 56, 91\u2013109.","journal-title":"Information Processing & Management"},{"key":"740_CR22","doi-asserted-by":"publisher","first-page":"2756","DOI":"10.1162\/neco.2007.19.10.2756","volume":"19","author":"C Lin","year":"2007","unstructured":"Lin, C. (2007). Projected gradient methods for nonnegative matrix factorization. Neural Computation, 19, 2756\u20132779.","journal-title":"Neural Computation"},{"key":"740_CR23","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.procs.2014.05.248","volume":"31","author":"R Liu","year":"2014","unstructured":"Liu, R., Feng, S., Shi, R., & Guo, W. (2014). Weighted graph clustering for community detection of large social networks. Procedia Computer Science, 31, 85\u201394.","journal-title":"Procedia Computer Science"},{"key":"740_CR24","first-page":"281","volume":"1","author":"J MacQueen","year":"1967","unstructured":"MacQueen, J. (1967). Some methods for classification and analysis of multivariate observations. Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, 1, 281\u2013297.","journal-title":"Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability"},{"key":"740_CR25","doi-asserted-by":"crossref","unstructured":"Maqbool, O., & Babri, H. (2004). The weighted combined algorithm: A linkage algorithm for software clustering. In 8th European Conference on Software Maintenance and Reengineering, CSMR 2004. Proceedings.. (pp. 15\u201324).","DOI":"10.1109\/CSMR.2004.1281402"},{"key":"740_CR26","unstructured":"McAuley, J., & Leskovec, J. (2012). Learning to discover social circles in ego networks. NIPS, 548\u201356."},{"key":"740_CR27","doi-asserted-by":"crossref","unstructured":"Morvan, A., Choromanski, K., Gouy-Pailler, C., & Atif, J. (2017). Graph sketching-based massive data clustering. arXiv:1703.02375.","DOI":"10.1137\/1.9781611975321.2"},{"key":"740_CR28","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/S0022-2496(02)00028-7","volume":"47","author":"I Myung","year":"2003","unstructured":"Myung, I. (2003). Tutorial on maximum likelihood estimation. Journal of Mathematical Psychology, 47, 90\u2013100.","journal-title":"Journal of Mathematical Psychology"},{"key":"740_CR29","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"M Newman","year":"2004","unstructured":"Newman, M., & Girvan, M. (2004). Finding and evaluating community structure in networks. Physical Review E, 69, 026113.","journal-title":"Physical Review E"},{"key":"740_CR30","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"M Newman","year":"2006","unstructured":"Newman, M. (2006). Modularity and community structure in networks. Proceedings of the National Academy of Sciences, 103, 8577\u20138582.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"740_CR31","unstructured":"Nie, F., Zhao, X., Wang, R., Li, X., & Li, Z. (2020). Fuzzy K-means clustering with discriminative embedding. IEEE Transactions on Knowledge and Data Engineering."},{"key":"740_CR32","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.neuroimage.2016.11.026","volume":"146","author":"C Nicolini","year":"2017","unstructured":"Nicolini, C., Bordier, C., & Bifone, A. (2017). Community detection in weighted brain connectivity networks beyond the resolution limit. NeuroImage, 146, 28\u201339.","journal-title":"NeuroImage"},{"key":"740_CR33","doi-asserted-by":"crossref","unstructured":"Qi, G., Aggarwal, C., & Huang, T. (2012). Community detection with edge content in social media networks. In 2012 IEEE 28th international conference on data engineering (pp. 534\u2013545).","DOI":"10.1109\/ICDE.2012.77"},{"key":"740_CR34","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"U Raghavan","year":"2007","unstructured":"Raghavan, U., Albert, R., & Kumara, S. (2007). Near linear time algorithm to detect community structures in large-scale networks. Physical Review E, 76, 036106.","journal-title":"Physical Review E"},{"key":"740_CR35","doi-asserted-by":"crossref","unstructured":"Rossi, R., & Ahmed, N. (2015). The network data repository with interactive graph analytics and visualization. In Proceedings Of The AAAI Conference on Artificial Intelligence, 29.","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"740_CR36","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1016\/j.future.2018.06.010","volume":"88","author":"J S\u00e1nchez-Oro","year":"2018","unstructured":"S\u00e1nchez-Oro, J., & Duarte, A. (2018). Iterated Greedy algorithm for performing community detection in social networks. Future Generation Computer Systems, 88, 785\u2013791.","journal-title":"Future Generation Computer Systems"},{"key":"740_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-019-46079-x","volume":"9","author":"J Sia","year":"2019","unstructured":"Sia, J., Jonckheere, E., & Bogdan, P. (2019). Ollivier-ricci curvature-based method to community detection in complex networks. Scientific Reports, 9, 1\u201312.","journal-title":"Scientific Reports"},{"key":"740_CR38","doi-asserted-by":"publisher","first-page":"80716","DOI":"10.1109\/ACCESS.2020.2988796","volume":"8","author":"K Sinaga","year":"2020","unstructured":"Sinaga, K., & Yang, M. (2020). Unsupervised K-means clustering algorithm. IEEE Access, 8, 80716\u201380727.","journal-title":"IEEE Access"},{"key":"740_CR39","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1016\/j.physa.2008.12.021","volume":"388","author":"H Shen","year":"2009","unstructured":"Shen, H., Cheng, X., Cai, K., & Hu, M. (2009). Detect overlapping and hierarchical community structure in networks. Physica A: Statistical Mechanics and its Applications, 388, 1706\u20131712.","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"740_CR40","unstructured":"Shi, J., & Malik, J. (2000). Normalized cuts and image segmentation departmental papers (CIS)."},{"key":"740_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-019-41695-z","volume":"9","author":"V Traag","year":"2019","unstructured":"Traag, V., Waltman, L., & Van Eck, N. (2019). From Louvain to Leiden: guaranteeing well-connected communities. Scientific Reports, 9, 1\u201312.","journal-title":"Scientific Reports"},{"key":"740_CR42","doi-asserted-by":"crossref","unstructured":"Xie, J., Szymanski, B., & Liu, X. (2011). Slpa: Uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. In 2011 IEEE 11th international conference on data mining workshops (pp. 344\u2013349).","DOI":"10.1109\/ICDMW.2011.154"},{"key":"740_CR43","doi-asserted-by":"crossref","unstructured":"Yang, J., & Leskovec, J. (2012). Community-affiliation graph model for overlapping network community detection. In 2012 IEEE 12th international conference on data mining (pp. 1170\u20131175).","DOI":"10.1109\/ICDM.2012.139"},{"key":"740_CR44","doi-asserted-by":"crossref","unstructured":"Yang, J., & Leskovec, J. (2013). Overlapping community detection at scale: a nonnegative matrix factorization approach. In Proceedings of the sixth ACM international conference on web search and data mining (pp. 587\u2013596).","DOI":"10.1145\/2433396.2433471"},{"key":"740_CR45","doi-asserted-by":"crossref","unstructured":"Yang, J., McAuley, J., & Leskovec, J. (2013). Community detection in networks with node attributes. In 2013 IEEE 13th international conference on data mining (pp. 1151\u20131156).","DOI":"10.1109\/ICDM.2013.167"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-022-00740-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10844-022-00740-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-022-00740-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T05:59:15Z","timestamp":1676613555000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10844-022-00740-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,26]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["740"],"URL":"https:\/\/doi.org\/10.1007\/s10844-022-00740-6","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,26]]},"assertion":[{"value":"14 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of interests"}}]}}