{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:52:56Z","timestamp":1775638376042,"version":"3.50.1"},"reference-count":35,"publisher":"Association for Computing Machinery (ACM)","issue":"13","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2019,9]]},"abstract":"<jats:p>\n            Given a temporal weighted graph that consists of a potentially endless stream of updates, we are interested in finding density bursting subgraphs (DBS for short), where a DBS is a subgraph that accumulates its density at the fastest speed. Online DBS detection enjoys many novel applications. At the same time, it is challenging since the time duration of a DBS can be arbitrarily long but a limited size storage can buffer only up to a certain number of updates. To tackle this problem, we observe the critical decomposability of DBSs and show that a DBS with a long time duration can be decomposed into a set of indecomposable DBSs with equal or larger burstiness. We further prove that the time duration of an indecomposable DBS is upper bounded and propose an efficient method\n            <jats:italic>TopkDBSOL<\/jats:italic>\n            to detect indecomposable DBSs in an online manner. Extensive experiments demonstrate the effectiveness, efficiency and scalability of\n            <jats:italic>TopkDBSOL<\/jats:italic>\n            in detecting significant DBSs from temporal graphs in real applications.\n          <\/jats:p>","DOI":"10.14778\/3358701.3358704","type":"journal-article","created":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T02:58:07Z","timestamp":1599793087000},"page":"2353-2365","source":"Crossref","is-referenced-by-count":37,"title":["Online density bursting subgraph detection from temporal graphs"],"prefix":"10.14778","volume":"12","author":[{"given":"Lingyang","family":"Chu","sequence":"first","affiliation":[{"name":"Huawei Technologies Canada, Burnaby, Canada"}]},{"given":"Yanyan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Fortinet Technology (Canada), Burnaby, Canada"}]},{"given":"Yu","family":"Yang","sequence":"additional","affiliation":[{"name":"City University of Hong Kong, Hong Kong, China"}]},{"given":"Lanjun","family":"Wang","sequence":"additional","affiliation":[{"name":"Huawei Technologies Canada, Burnaby, Canada"}]},{"given":"Jian","family":"Pei","sequence":"additional","affiliation":[{"name":"Simon Fraser University, Burnaby, Canada"}]}],"member":"320","published-online":{"date-parts":[[2019,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45995-2_51"},{"key":"e_1_2_1_2_1","volume-title":"On dense pattern mining in graph streams. PVLDB, 3(1--2):975--984","author":"Aggarwal C. C.","year":"2010","unstructured":"C. C. Aggarwal , Y. Li , P. S. Yu , and R. Jin . On dense pattern mining in graph streams. PVLDB, 3(1--2):975--984 , 2010 . C. C. Aggarwal, Y. Li, P. S. Yu, and R. Jin. On dense pattern mining in graph streams. PVLDB, 3(1--2):975--984, 2010."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/2168651.2168658"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746592"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339726"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.101"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"issue":"1","key":"e_1_2_1_8_1","first-page":"193","article-title":"Infection and immunization: a new class of evolutionary game dynamics","volume":"71","author":"Bul\u00f2 S. R.","year":"2011","unstructured":"S. R. Bul\u00f2 and I. M. Bomze . Infection and immunization: a new class of evolutionary game dynamics . GEB , 71 ( 1 ): 193 -- 211 , 2011 . S. R. Bul\u00f2 and I. M. Bomze. Infection and immunization: a new class of evolutionary game dynamics. GEB, 71(1):193--211, 2011.","journal-title":"GEB"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-30162-4_1"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/2757807.2757808"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939855"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704440430"},{"key":"e_1_2_1_13_1","first-page":"25","article-title":"Calculating a linear-time solution to the densest-segment problem","author":"Curtis S.","year":"2015","unstructured":"S. Curtis and S. C. Mu . Calculating a linear-time solution to the densest-segment problem . Journal of Functional Programming , 25 , 2015 . S. Curtis and S. C. Mu. Calculating a linear-time solution to the densest-segment problem. Journal of Functional Programming, 25, 2015.","journal-title":"Journal of Functional Programming"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741638"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.08.001"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/10.3.219"},{"key":"e_1_2_1_17_1","unstructured":"KAN. DBLP-Citation-Network v10 data set. https:\/\/static.aminer.org\/lab-datasets\/citation\/dblp.v10.zip.  KAN. DBLP-Citation-Network v10 data set. https:\/\/static.aminer.org\/lab-datasets\/citation\/dblp.v10.zip."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(03)00225-4"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(02)00010-7"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.16"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539780"},{"key":"e_1_2_1_22_1","first-page":"671","volume-title":"ICML","author":"Liu H.","year":"2010","unstructured":"H. Liu and S. Yan . Robust graph mode seeking by graph shift . In ICML , pages 671 -- 678 , 2010 . H. Liu and S. Yan. Robust graph mode seeking by graph shift. In ICML, pages 671--678, 2010."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00075"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.95"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2891604"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-053-6"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.250608"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081898"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018676"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098087"},{"key":"e_1_2_1_31_1","unstructured":"TAXI-1 and TAXI-2. Taxi trip data of the city of chicago. https:\/\/data.cityofchicago.org\/Transportation\/Taxi-Trips\/wrvz-psew.  TAXI-1 and TAXI-2. Taxi trip data of the city of chicago. https:\/\/data.cityofchicago.org\/Transportation\/Taxi-Trips\/wrvz-psew."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487645"},{"key":"e_1_2_1_33_1","volume-title":"http:\/\/konect.uni-koblenz.de\/","author":"Konect KL.","year":"2018","unstructured":"U KL. Konect . http:\/\/konect.uni-koblenz.de\/ , 2018 . UKL. Konect. http:\/\/konect.uni-koblenz.de\/, 2018."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311909"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939848"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3358701.3358704","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:55:17Z","timestamp":1672221317000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3358701.3358704"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":35,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["10.14778\/3358701.3358704"],"URL":"https:\/\/doi.org\/10.14778\/3358701.3358704","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2019,9]]}}}