{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T09:19:35Z","timestamp":1772788775457,"version":"3.50.1"},"reference-count":45,"publisher":"Association for Computing Machinery (ACM)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:p>\n            Searching for local communities is an important research problem that supports advanced data analysis in various complex networks, such as social networks, collaboration networks, cellular networks, etc. The evolution of such networks over time has motivated several recent studies to identify local communities in dynamic networks. However, these studies only utilize the aggregation of disjoint structural information to measure the quality and ignore the reliability of the communities in a continuous time interval. To fill this research gap, we propose a novel (\u03b8,\n            <jats:italic>k<\/jats:italic>\n            )-\n            <jats:italic>core<\/jats:italic>\n            reliable community (CRC) model in the weighted dynamic networks, and define the problem of\n            <jats:italic>most reliable community search<\/jats:italic>\n            that couples the desirable properties of connection strength, cohesive structure continuity, and the maximal member engagement. To solve this problem, we first develop a novel edge filtering based online CRC search algorithm that can effectively filter out the trivial edge information from the networks while searching for a\n            <jats:italic>reliable<\/jats:italic>\n            community. Further, we propose an index structure, Weighted Core Forest-Index (WCF-index), and devise an index-based dynamic programming CRC search algorithm, that can prune a large number of insignificant intermediate results and support efficient query processing. Finally, we conduct extensive experiments systematically to demonstrate the efficiency and effectiveness of our proposed algorithms on eight real datasets under various experimental settings.\n          <\/jats:p>","DOI":"10.14778\/3551793.3551834","type":"journal-article","created":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T22:25:03Z","timestamp":1664490303000},"page":"2826-2838","source":"Crossref","is-referenced-by-count":23,"title":["Reliable community search in dynamic networks"],"prefix":"10.14778","volume":"15","author":[{"given":"Yifu","family":"Tang","sequence":"first","affiliation":[{"name":"Deakin University, Geelong, Australia"}]},{"given":"Jianxin","family":"Li","sequence":"additional","affiliation":[{"name":"Deakin University, Geelong, Australia"}]},{"given":"Nur Al Hasan","family":"Haldar","sequence":"additional","affiliation":[{"name":"The University of Western Australia, Perth, Australia"}]},{"given":"Ziyu","family":"Guan","sequence":"additional","affiliation":[{"name":"Xidian University, Xi'an, China"}]},{"given":"Jiajie","family":"Xu","sequence":"additional","affiliation":[{"name":"Soochow University, Suzhou, China"}]},{"given":"Chengfei","family":"Liu","sequence":"additional","affiliation":[{"name":"Swinburne University of Technology, Melbourne, Australia"}]}],"member":"320","published-online":{"date-parts":[[2022,9,29]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2743075"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137640"},{"key":"e_1_2_1_3_1","volume-title":"Efficient and effective community search. Data mining and knowledge discovery 29, 5","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 29, 5 ( 2015 ), 1406--1433. Nicola Barbieri, Francesco Bonchi, Edoardo Galimberti, and Francesco Gullo. 2015. Efficient and effective community search. Data mining and knowledge discovery 29, 5 (2015), 1406--1433."},{"key":"e_1_2_1_4_1","volume-title":"arXiv preprint cs\/0310049","author":"Batagelj Vladimir","year":"2003","unstructured":"Vladimir Batagelj and Matjaz Zaversnik . 2003. An O (m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 ( 2003 ). Vladimir Batagelj and Matjaz Zaversnik. 2003. An O (m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 (2003)."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2017.11"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2018.00016"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2419263"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CASoN.2009.29"},{"key":"e_1_2_1_9_1","volume-title":"Finding local community structure in networks. Physical review E 72, 2","author":"Clauset Aaron","year":"2005","unstructured":"Aaron Clauset . 2005. Finding local community structure in networks. Physical review E 72, 2 ( 2005 ), 026132. Aaron Clauset. 2005. Finding local community structure in networks. Physical review E 72, 2 (2005), 026132."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463722"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612179"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2017.103"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994538"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271767"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2960226"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.211"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-73216-5_23"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67217-5_33"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-020-05042-y"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735484"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00077"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.158"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-021-00917-z"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2021.3071721"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2985327"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380587"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00075"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403069"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1454435.1454438"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2018.2812148"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.95"},{"key":"e_1_2_1_33_1","volume-title":"Distributed Time-Based Local Community Detection. In 24th Pan-Hellenic Conference on Informatics. 390--393","author":"Apostolos","unstructured":"Apostolos N. Papadopoulos and Georgios Tzortzidis. 2020 . Distributed Time-Based Local Community Detection. In 24th Pan-Hellenic Conference on Informatics. 390--393 . Apostolos N. Papadopoulos and Georgios Tzortzidis. 2020. Distributed Time-Based Local Community Detection. In 24th Pan-Hellenic Conference on Informatics. 390--393."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1080\/10507050801985047"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2020.2974849"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-016-0423-8"},{"key":"e_1_2_1_37_1","volume-title":"Network structure and minimum degree. Social networks 5, 3","author":"Seidman Stephen B","year":"1983","unstructured":"Stephen B Seidman . 1983. Network structure and minimum degree. Social networks 5, 3 ( 1983 ), 269--287. Stephen B Seidman. 1983. Network structure and minimum degree. Social networks 5, 3 (1983), 269--287."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2823754"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-015-0378-5"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492517.2492633"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2015.7363809"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/2752939.2752948"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00015"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.93"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3551793.3551834","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:41:29Z","timestamp":1672224089000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3551793.3551834"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":45,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["10.14778\/3551793.3551834"],"URL":"https:\/\/doi.org\/10.14778\/3551793.3551834","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2022,7]]}}}