{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T14:25:26Z","timestamp":1782224726828,"version":"3.54.5"},"reference-count":100,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T00:00:00Z","timestamp":1375315200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-09-1-0607"],"award-info":[{"award-number":["N00014-09-1-0607"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006754","name":"U.S. Army Research Laboratory","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2013,8]]},"abstract":"<jats:p>\n            This article reviews the state-of-the-art in\n            <jats:italic>overlapping<\/jats:italic>\n            community detection algorithms, quality measures, and benchmarks. A thorough comparison of different algorithms (a total of fourteen) is provided. In addition to community-level evaluation, we propose a framework for evaluating algorithms' ability to detect overlapping nodes, which helps to assess overdetection and underdetection. After considering community-level detection performance measured by normalized mutual information, the Omega index, and node-level detection performance measured by F-score, we reached the following conclusions. For low overlapping density networks, SLPA, OSLOM, Game, and COPRA offer better performance than the other tested algorithms. For networks with high overlapping density and high overlapping diversity, both SLPA and Game provide relatively stable performance. However, test results also suggest that the detection in such networks is still not yet fully resolved. A common feature observed by various algorithms in real-world networks is the relatively small fraction of overlapping nodes (typically less than 30%), each of which belongs to only 2 or 3 communities.\n          <\/jats:p>","DOI":"10.1145\/2501654.2501657","type":"journal-article","created":{"date-parts":[[2013,8,27]],"date-time":"2013-08-27T12:58:51Z","timestamp":1377608331000},"page":"1-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":902,"title":["Overlapping community detection in networks"],"prefix":"10.1145","volume":"45","author":[{"given":"Jierui","family":"Xie","sequence":"first","affiliation":[{"name":"Rensselaer Polytechnic Institute, Troy, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen","family":"Kelley","sequence":"additional","affiliation":[{"name":"Oak Ridge National Laboratory, Oak Ridge, TN"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Boleslaw K.","family":"Szymanski","sequence":"additional","affiliation":[{"name":"Rensselaer Polytechnic Institute, Troy, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,8,30]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature09182"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304187"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.96.114102"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.84.036103"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the IADIS International Conference on Applied Computing. 97--104","author":"Baumes J.","unstructured":"Baumes , J. , Goldberg , M. , Krishnamoorthy , M. , Magdon-Ismail , M. , and Preston , N . 2005. Finding communities by clustering a graph into overlapping subgraphs . In Proceedings of the IADIS International Conference on Applied Computing. 97--104 . Baumes, J., Goldberg, M., Krishnamoorthy, M., Magdon-Ismail, M., and Preston, N. 2005. Finding communities by clustering a graph into overlapping subgraphs. In Proceedings of the IADIS International Conference on Applied Computing. 97--104."},{"key":"e_1_2_1_6_1","first-page":"28","article-title":"Assessing the relevance of node features for network structure","volume":"106","author":"Bianconi G.","year":"2008","unstructured":"Bianconi , G. , Pin , P. , and Marsili , M. 2008 . Assessing the relevance of node features for network structure . Proc. Natl. Acad. Sci. USA 106 , 28 , 7. Bianconi, G., Pin, P., and Marsili, M. 2008. Assessing the relevance of node features for network structure. Proc. Natl. Acad. Sci. USA 106, 28, 7.","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.76.3251"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.056122"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05253-8_68"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2006.11.010"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2010.01.002"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom.2010.51"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2010.05.046"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2009.15"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-010-0186-6"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1207\/s15327906mbr2302_6"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200103)18:2%3C116::AID-RSA1001%3E3.0.CO;2-2"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2005\/09\/P09008"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2008.03.001"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the International Workshop on Indoor Spatial Awareness (ISA'10)","author":"Ding F.","unstructured":"Ding , F. , Luo , Z. , Shi , J. , and Fang , X . 2010. Overlapping community detection by kernel-based fuzzy affinity propagation . In Proceedings of the International Workshop on Indoor Spatial Awareness (ISA'10) . 1--4. Ding, F., Luo, Z., Shi, J., and Fang, X. 2010. Overlapping community detection by kernel-based fuzzy affinity propagation. In Proceedings of the International Workshop on Indoor Spatial Awareness (ISA'10). 1--4."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458285"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2010\/12\/P12037"},{"key":"e_1_2_1_23_1","first-page":"265","article-title":"Line graphs of weighted networks for overlapping communities. Euro","volume":"77","author":"Evans T.","year":"2010","unstructured":"Evans , T. and Lambiotte , R. 2010 . Line graphs of weighted networks for overlapping communities. Euro . Phys. J. B 77 , 265 . Evans, T. and Lambiotte, R. 2010. Line graphs of weighted networks for overlapping communities. Euro. Phys. J. B 77, 265.","journal-title":"Phys. J. B"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.016105"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/9\/6\/180"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130411"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1136800"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.103"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02397-2_9"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.72.056135"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/3120747.3120761"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/3120828.3120877"},{"key":"e_1_2_1_35_1","first-page":"47","article-title":"Finding overlapping communities using disjoint community detection algorithms","volume":"207","author":"Gregory S.","year":"2009","unstructured":"Gregory , S. 2009 . Finding overlapping communities using disjoint community detection algorithms . CompleNet 207 , 47 -- 61 . Gregory, S. 2009. Finding overlapping communities using disjoint community detection algorithms. CompleNet 207, 47--61.","journal-title":"CompleNet"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/12\/10\/103018"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2011\/02\/P02017"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.025101"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2011\/01\/P01023"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01908075"},{"key":"e_1_2_1_41_1","volume-title":"Proceedings of the Joint International Fuzzy Systems Association World Congress and European Society of Fuzzy Logic and Technology Conference. 1294--1298","author":"Hullermeier E.","unstructured":"Hullermeier , E. and Rifqi , M . 2009. A fuzzy variant of the rand index for comparing clustering structures . In Proceedings of the Joint International Fuzzy Systems Association World Congress and European Society of Fuzzy Logic and Technology Conference. 1294--1298 . Hullermeier, E. and Rifqi, M. 2009. A fuzzy variant of the rand index for comparing clustering structures. In Proceedings of the Joint International Fuzzy Systems Association World Congress and European Society of Fuzzy Logic and Technology Conference. 1294--1298."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2011\/05\/P05031"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.77.046119"},{"key":"e_1_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Kelley S. Goldberg M. Magdon-Ismail M. Mertsalov K. and Wallace A. 2011. Defining and discovering communities in social networks. In Handbook of Optimization in Complex Networks Springer 139--168.  Kelley S. Goldberg M. Magdon-Ismail M. Mertsalov K. and Wallace A. 2011. Defining and discovering communities in social networks. In Handbook of Optimization in Complex Networks Springer 139--168.","DOI":"10.1007\/978-1-4614-0754-6_6"},{"key":"e_1_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Kim Y. and Jeong H. 2011. The map equation for link community (unpublished). http:\/\/stat.kaist.ac.kr\/&sim;hjeong\/papers\/2011_Map.pdf.  Kim Y. and Jeong H. 2011. The map equation for link community (unpublished). http:\/\/stat.kaist.ac.kr\/&sim;hjeong\/papers\/2011_Map.pdf.","DOI":"10.1103\/PhysRevE.84.026110"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0012528"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.026109"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.056117"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/11\/3\/033015"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.046110"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0018961"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-9-559"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOAS382"},{"key":"e_1_2_1_55_1","volume-title":"Proceedings of the 4th Workshop on Social Network Mining and Analysis held in Conjunction with the International Conference on Knowledge Discovery and Data Mining (SNA\/KDD'10)","author":"Lee C.","unstructured":"Lee , C. , Reid , F. , Mcdaid , A. , and Hurley , N . 2010. Detecting highly overlapping community structure by greedy clique expansion . In Proceedings of the 4th Workshop on Social Network Mining and Analysis held in Conjunction with the International Conference on Knowledge Discovery and Data Mining (SNA\/KDD'10) . 33--42. Lee, C., Reid, F., Mcdaid, A., and Hurley, N. 2010. Detecting highly overlapping community structure by greedy clique expansion. In Proceedings of the 4th Workshop on Social Network Mining and Analysis held in Conjunction with the International Conference on Knowledge Discovery and Data Mining (SNA\/KDD'10). 33--42."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/1232722.1232727"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772755"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.101.168701"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11403-009-0057-7"},{"key":"e_1_2_1_62_1","doi-asserted-by":"crossref","unstructured":"Magdon-Ismail M. and Purnell J. 2011. Fast overlapping clustering of networks using sampled spectral distance embedding and gmms. Tech. rep. Rensselaer Polytechnic Institute Troy NY.  Magdon-Ismail M. and Purnell J. 2011. Fast overlapping clustering of networks using sampled spectral distance embedding and gmms. Tech. rep. Rensselaer Polytechnic Institute Troy NY.","DOI":"10.1109\/PASSAT\/SocialCom.2011.237"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.71.046101"},{"key":"e_1_2_1_64_1","unstructured":"Massen C. and Doye J. 2007. Thermodynamics of community structure. Preprint arXiv:con-mat\/0610077v1.  Massen C. and Doye J. 2007. Thermodynamics of community structure. Preprint arXiv:con-mat\/0610077v1."},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2010.77"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.5555\/259573.259582"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02760024"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.77.016107"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0610537104"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.025102"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2009\/03\/P03024"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1198\/016214501753208735"},{"key":"e_1_2_1_74_1","volume-title":"Proceedings of the 26th International Conference on Data Engineering (ICDE'10)","author":"Padrol-Sureda A.","unstructured":"Padrol-Sureda , A. , Perarnau-Llobet , G. , Pfeifle , J. , and Munts-Mulero , V . 2010. Overlapping community search for social networks . In Proceedings of the 26th International Conference on Data Engineering (ICDE'10) . 992--995. Padrol-Sureda, A., Perarnau-Llobet, G., Pfeifle, J., and Munts-Mulero, V. 2010. Overlapping community search for social networks. In Proceedings of the 26th International Conference on Data Engineering (ICDE'10). 992--995."},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature03607"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.066114"},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2010.28"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.93.218701"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.016110"},{"key":"e_1_2_1_81_1","doi-asserted-by":"crossref","unstructured":"Reichardt J. and Bornholdt S. 2006b. When are networks truly modular&quest; Physica D224 20--26.  Reichardt J. and Bornholdt S. 2006b. When are networks truly modular&quest; Physica D224 20--26.","DOI":"10.1016\/j.physd.2006.09.009"},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2011.36"},{"key":"e_1_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.79.036111"},{"key":"e_1_2_1_84_1","volume-title":"Proceedings of the 2nd International Semantic Web Conference (ISWC'03)","volume":"2870","author":"Richardson M.","unstructured":"Richardson , M. , Agrawal , R. , and Domingos , P . 2003. Trust management for the semantic web . In Proceedings of the 2nd International Semantic Web Conference (ISWC'03) . Lecture Notes in Computer Science , vol. 2870 . Springer, 351--368. Richardson, M., Agrawal, R., and Domingos, P. 2003. Trust management for the semantic web. In Proceedings of the 2nd International Semantic Web Conference (ISWC'03). Lecture Notes in Computer Science, vol. 2870. Springer, 351--368."},{"key":"e_1_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1109\/4236.978369"},{"key":"e_1_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.016109"},{"key":"e_1_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0706851105"},{"key":"e_1_2_1_88_1","first-page":"277","article-title":"Detection of node group membership in networks with group overlap. Euro","volume":"67","author":"Sawardecker E.","year":"2009","unstructured":"Sawardecker , E. , Sales-Pardo , M. , and Amaral , L. 2009 . Detection of node group membership in networks with group overlap. Euro . Phys. J. B67 , 277 . Sawardecker, E., Sales-Pardo, M., and Amaral, L. 2009. Detection of node group membership in networks with group overlap. Euro. Phys. J. B67, 277.","journal-title":"Phys. J."},{"key":"e_1_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2008.12.021"},{"key":"e_1_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2009\/07\/P07042"},{"key":"e_1_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2009.08.032"},{"key":"e_1_2_1_92_1","volume-title":"Proceedings of the SIAM International Conference on Data Mining. 76--84","author":"White S.","unstructured":"White , S. and Smyth , P . 2005. A spectral clustering approach to finding communities in graphs . In Proceedings of the SIAM International Conference on Data Mining. 76--84 . White, S. and Smyth, P. 2005. A spectral clustering approach to finding communities in graphs. In Proceedings of the SIAM International Conference on Data Mining. 76--84."},{"key":"e_1_2_1_93_1","volume-title":"Proceedings of the Conference on Intelligent Systems and Knowledge Engineering (ISKE'10)","author":"Wu Z.","unstructured":"Wu , Z. , Lin , Y. , Wan , H. , and Tian , S . 2010. A fast and reasonable method for community detection with adjustable extent of overlapping . In Proceedings of the Conference on Intelligent Systems and Knowledge Engineering (ISKE'10) . 376--379. Wu, Z., Lin, Y., Wan, H., and Tian, S. 2010. A fast and reasonable method for community detection with adjustable extent of overlapping. In Proceedings of the Conference on Intelligent Systems and Knowledge Engineering (ISKE'10). 376--379."},{"key":"e_1_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1109\/NSW.2011.6004645"},{"key":"e_1_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30220-6_3"},{"key":"e_1_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2011.154"},{"key":"e_1_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2009\/11\/P11013"},{"key":"e_1_2_1_98_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2006.07.023"},{"key":"e_1_2_1_99_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.046103"},{"key":"e_1_2_1_100_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557127"},{"key":"e_1_2_1_101_1","volume-title":"Proceedings of the Chinese Control and Decision Conference (CCDC'10)","author":"Zhao K.","unstructured":"Zhao , K. , Zhang , S.-W. , and Pan , Q . 2010. Fuzzy analysis for overlapping community structure of complex network . In Proceedings of the Chinese Control and Decision Conference (CCDC'10) . 3976--3981. Zhao, K., Zhang, S.-W., and Pan, Q. 2010. Fuzzy analysis for overlapping community structure of complex network. In Proceedings of the Chinese Control and Decision Conference (CCDC'10). 3976--3981."}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2501654.2501657","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2501654.2501657","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:48Z","timestamp":1750231728000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2501654.2501657"}},"subtitle":["The state-of-the-art and comparative study"],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":100,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["10.1145\/2501654.2501657"],"URL":"https:\/\/doi.org\/10.1145\/2501654.2501657","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8]]},"assertion":[{"value":"2011-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-08-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}