{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T18:01:31Z","timestamp":1772042491610,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":65,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T00:00:00Z","timestamp":1654819200000},"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":[[2022,6,10]]},"DOI":"10.1145\/3514221.3526137","type":"proceedings-article","created":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T02:33:49Z","timestamp":1655001229000},"page":"889-903","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["DMCS : Density Modularity based Community Search"],"prefix":"10.1145","author":[{"given":"Junghoon","family":"Kim","sequence":"first","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]},{"given":"Siqiang","family":"Luo","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]},{"given":"Gao","family":"Cong","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]},{"given":"Wenyuan","family":"Yu","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}]}],"member":"320","published-online":{"date-parts":[[2022,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134271.1134277"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137640"},{"key":"e_1_3_2_1_3_1","volume-title":"Scale-free networks: a decade and beyond. science","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","year":"2009","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si. 2009. Scale-free networks: a decade and beyond. science, Vol. 325, 5939 (2009), 412--413."},{"key":"e_1_3_2_1_4_1","volume-title":"Scale-free networks. Scientific american","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","year":"2003","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si and Eric Bonabeau. 2003. Scale-free networks. Scientific american, Vol. 288, 5 (2003), 60--69."},{"key":"e_1_3_2_1_5_1","volume-title":"Efficient and effective community search. Data mining and knowledge discovery","author":"Barbieri Nicola","year":"2015","unstructured":"Nicola Barbieri, Francesco Bonchi, Edoardo Galimberti, and Francesco Gullo. 2015. Efficient and effective community search. Data mining and knowledge discovery, Vol. 29, 5 (2015), 1406--1433."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.86.016107"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_1_9_1","unstructured":"Ulrik Brandes Daniel Delling Marco Gaertler Robert G\u00f6rke Martin Hoefer Zoran Nikoloski and Dorothea Wagner. 2006. Maximizing modularity is hard."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44436-X_10"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2014.2307458"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom.2013.25"},{"key":"e_1_3_2_1_13_1","unstructured":"Mingming Chen Tommy Nguyen and Boleslaw K Szymanski. 2015. A new metric for quality of network community structure."},{"key":"e_1_3_2_1_14_1","volume-title":"The advantages of the Matthews correlation coefficient (MCC) over F1 score and accuracy in binary classification evaluation. BMC genomics","author":"Chicco Davide","year":"2020","unstructured":"Davide Chicco and Giuseppe Jurman. 2020. The advantages of the Matthews correlation coefficient (MCC) over F1 score and accuracy in binary classification evaluation. BMC genomics, Vol. 21, 1 (2020), 1--13."},{"key":"e_1_3_2_1_15_1","volume-title":"Finding the best k in core decomposition: A time and space optimal solution","author":"Chu Deming","unstructured":"Deming Chu, Fan Zhang, Xuemin Lin, Wenjie Zhang, Ying Zhang, Yinglong Xia, and Chenyi Zhang. 2020. Finding the best k in core decomposition: A time and space optimal solution. In ICDE. IEEE, IEEE Computer Society, USA, 685--696."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"e_1_3_2_1_17_1","volume-title":"SIGMOD","author":"Cui Wanyun","unstructured":"Wanyun Cui, Yanghua Xiao, Haixun Wang, and Wei Wang. 2014. Local search of communities in large graphs. In SIGMOD. ACM, New York, NY, USA, 991--1002."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2005\/09\/P09008"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2012.04.003"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.139"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055337"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994538"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00556-x"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/3380750.3380756"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0605965104"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(95)00281-2"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"e_1_3_2_1_28_1","volume-title":"Finding a maximum density subgraph","author":"Goldberg Andrew V","unstructured":"Andrew V Goldberg. 1984. Finding a maximum density subgraph .University of California Berkeley, USA."},{"key":"e_1_3_2_1_29_1","unstructured":"Jiahao Guo Pramesh Singh and Kevin E Bassler. 2020. Resolution limit revisited: community detection using generalized modularity density."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/362248.362272"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983748"},{"key":"e_1_3_2_1_32_1","volume-title":"SIGMOD","author":"Huang Xin","unstructured":"Xin Huang, Hong Cheng, Lu Qin, Wentao Tian, and Jeffrey Xu Yu. 2014. Querying k-truss community in large and dynamic graphs. In SIGMOD. ACM, New York, NY, USA, 1311--1322."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3099622.3099626"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856323"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01908075"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230220105"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-020-00649-y"},{"key":"e_1_3_2_1_38_1","volume-title":"International colloquium on automata, languages, and programming","author":"Khuller Samir","unstructured":"Samir Khuller and Barna Saha. 2009. On finding dense subgraphs. In International colloquium on automata, languages, and programming. Springer, Springer-Verlag, Berlin, Heidelberg, 597--608."},{"key":"e_1_3_2_1_39_1","volume-title":"WWW","author":"Kim Jungeun","unstructured":"Jungeun Kim, Minsoo Choy, Daehoon Kim, and U Kang. 2014. Link prediction based on generalized cluster information. In WWW. ACM, New York, NY, USA, 317--318."},{"key":"e_1_3_2_1_40_1","volume-title":"SIGMOD","author":"Kim Junghoon","unstructured":"Junghoon Kim, Tao Guo, Kaiyu Feng, Gao Cong, Arijit Khan, and Farhana M Choudhury. 2020. Densely connected user community and location cluster search in location-based social networks. In SIGMOD. ACM, New York, NY, USA, 2199--2209."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.056117"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.046110"},{"key":"e_1_3_2_1_43_1","volume-title":"BlackHole: Robust community detection inspired by graph drawing","author":"Lim Sungsu","unstructured":"Sungsu Lim, Junghoon Kim, and Jae-Gil Lee. 2016. BlackHole: Robust community detection inspired by graph drawing. In ICDE. IEEE, IEEE Computer Society, USA, 25--36."},{"key":"e_1_3_2_1_44_1","volume-title":"Efficient community search with size constraint","author":"Liu Boge","unstructured":"Boge Liu, Fan Zhang, Wenjie Zhang, Xuemin Lin, and Ying Zhang. 2021. Efficient community search with size constraint. In ICDE. IEEE, IEEE Computer Society, USA, 97--108."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2006.72"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/1454435.1454438"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00265-003-0651-y"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.72.056107"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0601602103"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-017-1077-6"},{"key":"e_1_3_2_1_52_1","volume-title":"SIGKDD","author":"Sozio Mauro","unstructured":"Mauro Sozio and Aristides Gionis. 2010. The community-search problem and how to plan a successful cocktail party. In SIGKDD. ACM, New York, NY, USA, 939--948."},{"key":"e_1_3_2_1_53_1","volume-title":"Information Retrieval","author":"van Rijsbergen CJ","unstructured":"CJ van Rijsbergen. 1979. Information Retrieval, 2nd edButterworths.","edition":"2"},{"key":"e_1_3_2_1_54_1","volume-title":"Efficient radius-bounded community search in geo-social networks. TKDE","author":"Wang Kai","year":"2020","unstructured":"Kai Wang, Shuting Wang, Xin Cao, and Lu Qin. 2020. Efficient radius-bounded community search in geo-social networks. TKDE (2020)."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00015"},{"key":"e_1_3_2_1_56_1","volume-title":"Six degrees: The science of a connected age","author":"Watts Duncan J","unstructured":"Duncan J Watts. 2004. Six degrees: The science of a connected age .WW Norton & Company."},{"key":"e_1_3_2_1_57_1","volume-title":"Collective dynamics of \"small-world'networks. nature","author":"Watts Duncan J","year":"1998","unstructured":"Duncan J Watts and Steven H Strogatz. 1998. Collective dynamics of \"small-world'networks. nature, Vol. 393, 6684 (1998), 440--442."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.14778\/2752939.2752948"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"e_1_3_2_1_60_1","volume-title":"Effective and efficient truss computation over large heterogeneous information networks","author":"Yang Yixing","unstructured":"Yixing Yang, Yixiang Fang, Xuemin Lin, and Wenjie Zhang. 2020. Effective and efficient truss computation over large heterogeneous information networks. In ICDE. IEEE, IEEE Computer Society, USA, 901--912."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.14778\/3457390.3457407"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2783933"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1086\/jar.33.4.3629752"},{"key":"e_1_3_2_1_64_1","volume-title":"Wagner Meira Jr, and Wagner Meira","author":"Zaki Mohammed J","year":"2014","unstructured":"Mohammed J Zaki, Wagner Meira Jr, and Wagner Meira. 2014. Data mining and analysis: fundamental concepts and algorithms. Cambridge University Press, USA."},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.07.012"}],"event":{"name":"SIGMOD\/PODS '22: International Conference on Management of Data","location":"Philadelphia PA USA","acronym":"SIGMOD\/PODS '22","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2022 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514221.3526137","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3514221.3526137","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:13Z","timestamp":1750183813000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514221.3526137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,10]]},"references-count":65,"alternative-id":["10.1145\/3514221.3526137","10.1145\/3514221"],"URL":"https:\/\/doi.org\/10.1145\/3514221.3526137","relation":{},"subject":[],"published":{"date-parts":[[2022,6,10]]},"assertion":[{"value":"2022-06-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}