{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:13:31Z","timestamp":1779174811150,"version":"3.51.4"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"13","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:p>\n            Temporal graphs are ubiquitous. Mining communities that are bursting in a period of time is essential for seeking real emergency events in temporal graphs. Unfortunately, most previous studies on community mining in temporal networks ignore the bursting patterns of communities. In this paper, we study the problem of seeking bursting communities in a temporal graph. We propose a novel model, called the (\n            <jats:italic>l<\/jats:italic>\n            , \u03b4)-maximal bursting core, to represent a bursting community in a temporal graph. Specifically, an (\n            <jats:italic>l<\/jats:italic>\n            , \u03b4)-maximal bursting core is a temporal subgraph in which each node has an average degree no less than \u03b4 in a time segment with length no less than\n            <jats:italic>l.<\/jats:italic>\n            To compute the (\n            <jats:italic>l<\/jats:italic>\n            , \u03b4)-maximal bursting core, we first develop a novel dynamic programming algorithm that can reduce time complexity of calculating the segment density from\n            <jats:italic>O<\/jats:italic>\n            (|\n            <jats:italic>T<\/jats:italic>\n            |)\n            <jats:sup>2<\/jats:sup>\n            to\n            <jats:italic>O<\/jats:italic>\n            (|\n            <jats:italic>T<\/jats:italic>\n            |). Then, we propose an efficient updating algorithm which can update the segment density in\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>l<\/jats:italic>\n            ) time. In addition, we develop an efficient algorithm to enumerate all (\n            <jats:italic>l<\/jats:italic>\n            , \u03b4)-maximal bursting cores that are not dominated by the others in terms of\n            <jats:italic>l<\/jats:italic>\n            and \u03b4. The results of extensive experiments on 9 real-life datasets demonstrate the effectiveness, efficiency and scalability of our algorithms.\n          <\/jats:p>","DOI":"10.14778\/3565838.3565845","type":"journal-article","created":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T23:09:56Z","timestamp":1674256196000},"page":"3911-3923","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Mining Bursting Core in Large Temporal Graphs"],"prefix":"10.14778","volume":"15","author":[{"given":"Hongchao","family":"Qin","sequence":"first","affiliation":[{"name":"Beijing Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong-Hua","family":"Li","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ye","family":"Yuan","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[{"name":"University of Technology Sydney"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiwei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,1,20]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/2336664.2336671"},{"key":"e_1_2_1_2_1","volume-title":"SIGKDD","author":"Asur Sitaram","year":"2007","unstructured":"Sitaram Asur , Srinivasan Parthasarathy , and Duygu Ucar . 2007 . An event-based framework for characterizing the evolutionary behavior of interaction graphs . In SIGKDD 2007. 913--921. Sitaram Asur, Srinivasan Parthasarathy, and Duygu Ucar. 2007. An event-based framework for characterizing the evolutionary behavior of interaction graphs. In SIGKDD 2007. 913--921."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature03459"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2746478"},{"key":"e_1_2_1_5_1","volume-title":"Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. In STOC","author":"Bhattacharya Sayan","year":"2015","unstructured":"Sayan Bhattacharya , Monika Henzinger , Danupon Nanongkai , and Charalampos E. Tsourakakis . 2015 . Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. In STOC 2015 . 173--182. Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, and Charalampos E. Tsourakakis. 2015. Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. In STOC 2015. 173--182."},{"key":"e_1_2_1_6_1","volume-title":"Mining Heavy Subgraphs in Time-Evolving Networks. In ICDM","author":"Bogdanov Petko","year":"2011","unstructured":"Petko Bogdanov , Misael Mongiov\u00ec , and Ambuj K. Singh . 2011 . Mining Heavy Subgraphs in Time-Evolving Networks. In ICDM 2011 . 81--90. Petko Bogdanov, Misael Mongiov\u00ec, and Ambuj K. Singh. 2011. Mining Heavy Subgraphs in Time-Evolving Networks. In ICDM 2011. 81--90."},{"key":"e_1_2_1_7_1","volume-title":"Distance-generalized Core Decomposition. In SIGMOD","author":"Bonchi Francesco","year":"2019","unstructured":"Francesco Bonchi , Arijit Khan , and Lorenzo Severini . 2019 . Distance-generalized Core Decomposition. In SIGMOD 2019. 1006--1023. Francesco Bonchi, Arijit Khan, and Lorenzo Severini. 2019. Distance-generalized Core Decomposition. In SIGMOD 2019. 1006--1023."},{"key":"e_1_2_1_8_1","volume-title":"Samatova","author":"Chen Zhengzhang","year":"2010","unstructured":"Zhengzhang Chen , Kevin A. Wilson , Ye Jin , William Hendrix , and Nagiza F . Samatova . 2010 . Detecting and Tracking Community Dynamics in Evolutionary Networks. In ICDMW. 318--327. Zhengzhang Chen, Kevin A. Wilson, Ye Jin, William Hendrix, and Nagiza F. Samatova. 2010. Detecting and Tracking Community Dynamics in Evolutionary Networks. In ICDMW. 318--327."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043652.2043654"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/3358701.3358704"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098031"},{"key":"e_1_2_1_13_1","volume-title":"Efficient Densest Subgraph Computation in Evolving Graphs. In WWW","author":"Epasto Alessandro","year":"2015","unstructured":"Alessandro Epasto , Silvio Lattanzi , and Mauro Sozio . 2015 . Efficient Densest Subgraph Computation in Evolving Graphs. In WWW 2015. 300--310. Alessandro Epasto, Silvio Lattanzi, and Mauro Sozio. 2015. Efficient Densest Subgraph Computation in Evolving Graphs. In WWW 2015. 300--310."},{"key":"e_1_2_1_14_1","volume-title":"CIKM","author":"Galimberti Edoardo","year":"2018","unstructured":"Edoardo Galimberti , Alain Barrat , Francesco Bonchi , Ciro Cattuto , and Francesco Gullo . 2018 . Mining (maximal) Span-cores from Temporal Networks . In CIKM 2018. 107--116. Edoardo Galimberti, Alain Barrat, Francesco Bonchi, Ciro Cattuto, and Francesco Gullo. 2018. Mining (maximal) Span-cores from Temporal Networks. In CIKM 2018. 107--116."},{"key":"e_1_2_1_15_1","volume-title":"Core Decomposition and Densest Subgraph in Multilayer Networks. In CIKM 2017. 1807","author":"Galimberti Edoardo","year":"2017","unstructured":"Edoardo Galimberti , Francesco Bonchi , and Francesco Gullo . 2017 . Core Decomposition and Densest Subgraph in Multilayer Networks. In CIKM 2017. 1807 --1816. Edoardo Galimberti, Francesco Bonchi, and Francesco Gullo. 2017. Core Decomposition and Densest Subgraph in Multilayer Networks. In CIKM 2017. 1807--1816."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3369872"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2737791"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2012.03.001"},{"key":"e_1_2_1_19_1","volume-title":"Minimum Spanning Trees in Temporal Graphs. In SIGMOD","author":"Huang Silu","year":"2015","unstructured":"Silu Huang , Ada Wai-Chee Fu , and Ruifeng Liu . 2015 . Minimum Spanning Trees in Temporal Graphs. In SIGMOD 2015. 419--430. Silu Huang, Ada Wai-Chee Fu, and Ruifeng Liu. 2015. Minimum Spanning Trees in Temporal Graphs. In SIGMOD 2015. 419--430."},{"key":"e_1_2_1_20_1","volume-title":"Querying K-truss Community in Large and Dynamic Graphs. In SIGMOD","author":"Huang Xin","year":"2014","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 2014. 1311--1322. Xin Huang, Hong Cheng, Lu Qin, Wentao Tian, and Jeffrey Xu Yu. 2014. Querying K-truss Community in Large and Dynamic Graphs. In SIGMOD 2014. 1311--1322."},{"key":"e_1_2_1_21_1","volume-title":"ECML\/PKDD","author":"Kumar Rohit","year":"2015","unstructured":"Rohit Kumar , Toon Calders , Aristides Gionis , and Nikolaj Tatti . 2015. Maintaining Sliding-Window Neighborhood Profiles in Interaction Networks . In ECML\/PKDD 2015 . 719--735. Rohit Kumar, Toon Calders, Aristides Gionis, and Nikolaj Tatti. 2015. Maintaining Sliding-Window Neighborhood Profiles in Interaction Networks. In ECML\/PKDD 2015. 719--735."},{"key":"e_1_2_1_22_1","volume-title":"Persistent Community Search in Temporal Networks. In ICDE","author":"Li Rong-Hua","year":"2018","unstructured":"Rong-Hua Li , Jiao Su , Lu Qin , Jeffrey Xu Yu , and Qiangqiang Dai . 2018 . Persistent Community Search in Temporal Networks. In ICDE 2018. 797--808. Rong-Hua Li, Jiao Su, Lu Qin, Jeffrey Xu Yu, and Qiangqiang Dai. 2018. Persistent Community Search in Temporal Networks. In ICDE 2018. 797--808."},{"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","volume-title":"Tseng","author":"Lin Yu-Ru","year":"2008","unstructured":"Yu-Ru Lin , Yun Chi , Shenghuo Zhu , Hari Sundaram , and Belle L . Tseng . 2008 . Facetnet: a framework for analyzing communities and their evolutions in dynamic networks. In WWW 2008. 685--694. Yu-Ru Lin, Yun Chi, Shenghuo Zhu, Hari Sundaram, and Belle L. Tseng. 2008. Facetnet: a framework for analyzing communities and their evolutions in dynamic networks. In WWW 2008. 685--694."},{"key":"e_1_2_1_26_1","first-page":"782","article-title":"Finding Densest Lasting Subgraphs in Dynamic Graphs","volume":"2019","author":"Liu Xuanming","year":"2019","unstructured":"Xuanming Liu , Tingjian Ge , and Yinghui Wu . 2019 . Finding Densest Lasting Subgraphs in Dynamic Graphs : A Stochastic Approach. In ICDE 2019. 782 -- 793 . Xuanming Liu, Tingjian Ge, and Yinghui Wu. 2019. Finding Densest Lasting Subgraphs in Dynamic Graphs: A Stochastic Approach. In ICDE 2019. 782--793.","journal-title":"A Stochastic Approach. In ICDE"},{"key":"e_1_2_1_27_1","volume-title":"Fast Computation of Dense Temporal Subgraphs. In ICDE","author":"Ma Shuai","year":"2017","unstructured":"Shuai Ma , Renjun Hu , Luoshu Wang , Xuelian Lin , and Jinpeng Huai . 2017 . Fast Computation of Dense Temporal Subgraphs. In ICDE 2017. 361--372. Shuai Ma, Renjun Hu, Luoshu Wang, Xuelian Lin, and Jinpeng Huai. 2017. Fast Computation of Dense Temporal Subgraphs. In ICDE 2017. 361--372."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00587-4"},{"key":"e_1_2_1_29_1","volume-title":"Mining Periodic Cliques in Temporal Networks. In ICDE","author":"Qin Hongchao","year":"2019","unstructured":"Hongchao Qin , Rong-Hua Li , Guoren Wang , Lu Qin , Yurong Cheng , and Ye Yuan . 2019 . Mining Periodic Cliques in Temporal Networks. In ICDE 2019. 1130--1141. Hongchao Qin, Rong-Hua Li, Guoren Wang, Lu Qin, Yurong Cheng, and Ye Yuan. 2019. Mining Periodic Cliques in Temporal Networks. In ICDE 2019. 1130--1141."},{"key":"e_1_2_1_30_1","volume-title":"Locally Densest Subgraph Discovery. In SIGKDD","author":"Qin Lu","year":"2015","unstructured":"Lu Qin , Rong-Hua Li , Lijun Chang , and Chengqi Zhang . 2015 . Locally Densest Subgraph Discovery. In SIGKDD 2015. 965--974. Lu Qin, Rong-Hua Li, Lijun Chang, and Chengqi Zhang. 2015. Locally Densest Subgraph Discovery. In SIGKDD 2015. 965--974."},{"key":"e_1_2_1_31_1","volume-title":"Community Discovery in Dynamic Networks: A Survey. ACM Comput. Surv. 51, 2","author":"Rossetti Giulio","year":"2018","unstructured":"Giulio Rossetti and R\u00e9my Cazabet . 2018. Community Discovery in Dynamic Networks: A Survey. ACM Comput. Surv. 51, 2 ( 2018 ), 35:1--35:37. Giulio Rossetti and R\u00e9my Cazabet. 2018. Community Discovery in Dynamic Networks: A Survey. ACM Comput. Surv. 51, 2 (2018), 35:1--35:37."},{"key":"e_1_2_1_32_1","first-page":"397","article-title":"Finding Events in Temporal Networks: Segmentation Meets Densest-Subgraph Discovery","volume":"2018","author":"Rozenshtein Polina","year":"2018","unstructured":"Polina Rozenshtein , Francesco Bonchi , Aristides Gionis , Mauro Sozio , and Nikolaj Tatti . 2018 . Finding Events in Temporal Networks: Segmentation Meets Densest-Subgraph Discovery . In ICDM 2018. 397 -- 406 . Polina Rozenshtein, Francesco Bonchi, Aristides Gionis, Mauro Sozio, and Nikolaj Tatti. 2018. Finding Events in Temporal Networks: Segmentation Meets Densest-Subgraph Discovery. In ICDM 2018. 397--406.","journal-title":"ICDM"},{"key":"e_1_2_1_33_1","volume-title":"Finding Dynamic Dense Subgraphs. ACM Transactions on Knowledge Discovery from Data 11, 3","author":"Rozenshtein Polina","year":"2017","unstructured":"Polina Rozenshtein , Nikolaj Tatti , and Aristides Gionis . 2017. Finding Dynamic Dense Subgraphs. ACM Transactions on Knowledge Discovery from Data 11, 3 ( 2017 ), 27:1--27:30. Polina Rozenshtein, Nikolaj Tatti, and Aristides Gionis. 2017. Finding Dynamic Dense Subgraphs. ACM Transactions on Knowledge Discovery from Data 11, 3 (2017), 27:1--27:30."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/3275536.3275540"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"e_1_2_1_36_1","volume-title":"SIGKDD","author":"Tsourakakis Charalampos E.","year":"2013","unstructured":"Charalampos E. Tsourakakis , Francesco Bonchi , Aristides Gionis , Francesco Gullo , and Maria A. Tsiarli . 2013. Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees . In SIGKDD 2013 . 104--112. Charalampos E. Tsourakakis, Francesco Bonchi, Aristides Gionis, Francesco Gullo, and Maria A. Tsiarli. 2013. Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In SIGKDD 2013. 104--112."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498235"},{"key":"e_1_2_1_38_1","volume-title":"Core decomposition in large temporal graphs","author":"Wu Huanhuan","year":"2015","unstructured":"Huanhuan Wu , James Cheng , Yi Lu , Yiping Ke , Yuzhen Huang , Da Yan , and Hejun Wu. 2015. Core decomposition in large temporal graphs . In IEEE BigData 2015 . 649--658. Huanhuan Wu, James Cheng, Yi Lu, Yiping Ke, Yuzhen Huang, Da Yan, and Hejun Wu. 2015. Core decomposition in large temporal graphs. In IEEE BigData 2015. 649--658."},{"key":"e_1_2_1_39_1","volume-title":"Defining and Evaluating Network Communities Based on Ground-Truth. In ICDM","author":"Yang Jaewon","year":"2012","unstructured":"Jaewon Yang and Jure Leskovec . 2012 . Defining and Evaluating Network Communities Based on Ground-Truth. In ICDM 2012. 745--754. Jaewon Yang and Jure Leskovec. 2012. Defining and Evaluating Network Communities Based on Ground-Truth. In ICDM 2012. 745--754."},{"key":"e_1_2_1_40_1","volume-title":"Diversified Temporal Subgraph Pattern Mining. In SIGKDD 2016. 1965","author":"Yang Yi","year":"1974","unstructured":"Yi Yang , Da Yan , Huanhuan Wu , James Cheng , Shuigeng Zhou , and John C. S. Lui . 2016 . Diversified Temporal Subgraph Pattern Mining. In SIGKDD 2016. 1965 -- 1974 . Yi Yang, Da Yan, Huanhuan Wu, James Cheng, Shuigeng Zhou, and John C. S. Lui. 2016. Diversified Temporal Subgraph Pattern Mining. In SIGKDD 2016. 1965--1974."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-013-0204-x"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476260"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3565838.3565845","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T23:12:08Z","timestamp":1674256328000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3565838.3565845"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":42,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["10.14778\/3565838.3565845"],"URL":"https:\/\/doi.org\/10.14778\/3565838.3565845","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2022,9]]},"assertion":[{"value":"2023-01-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}