{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T16:03:09Z","timestamp":1762272189213,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,31]],"date-time":"2017-07-31T00:00:00Z","timestamp":1501459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,31]]},"DOI":"10.1145\/3110025.3116193","type":"proceedings-article","created":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T14:40:22Z","timestamp":1510670422000},"page":"652-659","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["MCEIL"],"prefix":"10.1145","author":[{"given":"Prathamesh","family":"Deshpande","sequence":"first","affiliation":[{"name":"Department of CSE, IIT Madras"}]},{"given":"Balaraman","family":"Ravindran","sequence":"additional","affiliation":[{"name":"Department of CSE, IIT Madras"}]}],"member":"320","published-online":{"date-parts":[[2017,7,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature03607"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature09182"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/11\/3\/033015"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.139"},{"key":"e_1_3_2_1_6_1","first-page":"1","volume-title":"MDS '12","author":"Yang J.","year":"2012","unstructured":"J. Yang and J. Leskovec, \"Defining and evaluating network communities based on ground-truth,\" in Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics, ser. MDS '12. New York, NY, USA: ACM, 2012, pp. 3:1--3:8. [Online]. Available: http:\/\/doi.acm.org\/10.1145\/2350190.2350193"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2518687"},{"key":"e_1_3_2_1_8_1","volume-title":"Detecting highly overlapping community structure by greedy clique expansion,\" arXiv preprint arXiv:1002.1827","author":"Lee C.","year":"2010","unstructured":"C. Lee, F. Reid, A. McDaid, and N. Hurley, \"Detecting highly overlapping community structure by greedy clique expansion,\" arXiv preprint arXiv:1002.1827, 2010."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2014.6921552"},{"key":"e_1_3_2_1_10_1","first-page":"2097","volume-title":"IJCAI'15","author":"Sankar M. V.","year":"2015","unstructured":"M. V. Sankar, B. Ravindran, and S. Shivashankar, \"Ceil: A scalable, resolution limit free approach for detecting communities in large networks,\" in Proceedings of the 24th International Conference on Artificial Intelligence, ser. IJCAI'15. AAAI Press, 2015, pp. 2097--2103. [Online]. Available: http:\/\/dl.acm.org\/citation.cfm?id=2832415.2832540"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2501654.2501657"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2011\/01\/P01023"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/511446.511513"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.90.062805"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623621"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339631"},{"key":"e_1_3_2_1_18_1","first-page":"97","article-title":"Finding communities by clustering a graph into overlapping subgraphs","volume":"5","author":"Baumes J.","year":"2005","unstructured":"J. Baumes, M. K. Goldberg, M. S. Krishnamoorthy, M. Magdon-Ismail, and N. Preston, \"Finding communities by clustering a graph into overlapping subgraphs.\" IADIS AC, vol. 5, pp. 97--104, 2005.","journal-title":"IADIS AC"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2012.09.012"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339628"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594454"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.066133"}],"event":{"name":"ASONAM '17: Advances in Social Networks Analysis and Mining 2017","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"],"location":"Sydney Australia","acronym":"ASONAM '17"},"container-title":["Proceedings of the 2017 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining 2017"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3110025.3116193","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3110025.3116193","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:09Z","timestamp":1750217409000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3110025.3116193"}},"subtitle":["An Improved Scoring Function for Overlapping Community Detection using Seed Expansion Methods"],"short-title":[],"issued":{"date-parts":[[2017,7,31]]},"references-count":22,"alternative-id":["10.1145\/3110025.3116193","10.1145\/3110025"],"URL":"https:\/\/doi.org\/10.1145\/3110025.3116193","relation":{},"subject":[],"published":{"date-parts":[[2017,7,31]]},"assertion":[{"value":"2017-07-31","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}