{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:01:57Z","timestamp":1775815317831,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T00:00:00Z","timestamp":1501804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1408924, CNS-1314632"],"award-info":[{"award-number":["IIS-1408924, CNS-1314632"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-09-2-0053"],"award-info":[{"award-number":["W911NF-09-2-0053"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,4]]},"DOI":"10.1145\/3097983.3098087","type":"proceedings-article","created":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T18:35:54Z","timestamp":1501871754000},"page":"1057-1066","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":51,"title":["DenseAlert"],"prefix":"10.1145","author":[{"given":"Kijung","family":"Shin","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Bryan","family":"Hooi","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Jisu","family":"Kim","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,8,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-95995-3_3"},{"key":"e_1_3_2_1_2_1","unstructured":"Brett W. Bader Tamara G. Kolda etal 2017. MATLAB Tensor Toolbox Version 2.6. Available online. (2017).http:\/\/www.sandia.gov\/~tgkolda\/TensorToolbox\/  Brett W. Bader Tamara G. Kolda et al. 2017. MATLAB Tensor Toolbox Version 2.6. Available online. (2017).http:\/\/www.sandia.gov\/~tgkolda\/TensorToolbox\/"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Bahman Bahmani Ashish Goel and Kamesh Munagala. 2014. Efficient primal-dual graph algorithms for mapreduce WAW.  Bahman Bahmani Ashish Goel and Kamesh Munagala. 2014. Efficient primal-dual graph algorithms for mapreduce WAW.","DOI":"10.1007\/978-3-319-13123-8_6"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140442"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Oana Denisa Balalau Francesco Bonchi TH Chan Francesco Gullo and Mauro Sozio. 2015. Finding subgraphs with maximum total density and limited overlap WSDM.  Oana Denisa Balalau Francesco Bonchi TH Chan Francesco Gullo and Mauro Sozio. 2015. Finding subgraphs with maximum total density and limited overlap WSDM.","DOI":"10.1145\/2684822.2685298"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Alex Beutel Wanhong Xu Venkatesan Guruswami Christopher Palow and Christos Faloutsos 2013. Copycatch: stopping group attacks by spotting lockstep behavior in social networks WWW.  Alex Beutel Wanhong Xu Venkatesan Guruswami Christopher Palow and Christos Faloutsos 2013. Copycatch: stopping group attacks by spotting lockstep behavior in social networks WWW.","DOI":"10.1145\/2488388.2488400"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Sayan Bhattacharya Monika Henzinger Danupon Nanongkai and Charalampos Tsourakakis 2015. Space-and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams STOC.  Sayan Bhattacharya Monika Henzinger Danupon Nanongkai and Charalampos Tsourakakis 2015. Space-and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams STOC.","DOI":"10.1145\/2746539.2746592"},{"key":"e_1_3_2_1_8_1","volume-title":"Data Peeler: Contraint-Based Closed Pattern Mining in n-ary Relations. SDM.","author":"Cerf Lo\u00efc","year":"2008","unstructured":"Lo\u00efc Cerf , J\u00e9r\u00e9my Besson , C\u00e9line Robardet , and Jean-Franccois Boulicaut . 2008 . Data Peeler: Contraint-Based Closed Pattern Mining in n-ary Relations. SDM. Lo\u00efc Cerf, J\u00e9r\u00e9my Besson, C\u00e9line Robardet, and Jean-Franccois Boulicaut. 2008. Data Peeler: Contraint-Based Closed Pattern Mining in n-ary Relations. SDM."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44436-X_10"},{"key":"e_1_3_2_1_10_1","unstructured":"Gideon Dror Noam Koenigstein Yehuda Koren and Markus Weimer 2012. The Yahoo! Music Dataset and KDD-Cup'11. In KDD Cup.  Gideon Dror Noam Koenigstein Yehuda Koren and Markus Weimer 2012. The Yahoo! Music Dataset and KDD-Cup'11. In KDD Cup."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Alessandro Epasto Silvio Lattanzi and Mauro Sozio. 2015. Efficient densest subgraph computation in evolving graphs WWW.  Alessandro Epasto Silvio Lattanzi and Mauro Sozio. 2015. Efficient densest subgraph computation in evolving graphs WWW.","DOI":"10.1145\/2736277.2741638"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-016-0464-z"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939747"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1080\/03081079.2013.798899"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Meng Jiang Alex Beutel Peng Cui Bryan Hooi Shiqiang Yang and Christos Faloutsos. 2015. A general suspiciousness metric for dense blocks in multimodal data ICDM.  Meng Jiang Alex Beutel Peng Cui Bryan Hooi Shiqiang Yang and Christos Faloutsos. 2015. A general suspiciousness metric for dense blocks in multimodal data ICDM.","DOI":"10.1109\/ICDM.2015.61"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623632"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_50"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"e_1_3_2_1_20_1","unstructured":"Richard P Lippmann David J Fried Isaac Graf Joshua W Haines Kristopher R Kendall David McClung Dan Weber Seth E Webster Dan Wyschogrod Robert K Cunningham etal 2000. Evaluating intrusion detection systems: The 1998 DARPA off-line intrusion detection evaluation DISCEX.  Richard P Lippmann David J Fried Isaac Graf Joshua W Haines Kristopher R Kendall David McClung Dan Weber Seth E Webster Dan Wyschogrod Robert K Cunningham et al. 2000. Evaluating intrusion detection systems: The 1998 DARPA off-line intrusion detection evaluation DISCEX."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Koji Maruhashi Fan Guo and Christos Faloutsos 2011. Multiaspectforensics: Pattern mining on large-scale heterogeneous networks with tensor analysis ASONAM.  Koji Maruhashi Fan Guo and Christos Faloutsos 2011. Multiaspectforensics: Pattern mining on large-scale heterogeneous networks with tensor analysis ASONAM.","DOI":"10.1109\/ASONAM.2011.80"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783381"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Andrew McGregor David Tench Sofya Vorotnikova and Hoa T Vu 2015. Densest subgraph in dynamic graph streams. In MFCS.  Andrew McGregor David Tench Sofya Vorotnikova and Hoa T Vu 2015. Densest subgraph in dynamic graph streams. In MFCS.","DOI":"10.1007\/978-3-662-48054-0_39"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Alan Mislove Massimiliano Marcon Krishna P. Gummadi Peter Druschel and Bobby Bhattacharjee. 2007. Measurement and Analysis of Online Social Networks IMC.  Alan Mislove Massimiliano Marcon Krishna P. Gummadi Peter Druschel and Bobby Bhattacharjee. 2007. Measurement and Analysis of Online Social Networks IMC.","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_3_2_1_25_1","volume-title":"Eigenspokes: Surprising patterns and community structure in large graphs. PAKDD.","author":"Prakash B Aditya","year":"2010","unstructured":"B Aditya Prakash , Mukund Seshadri , Ashwin Sridharan , Sridhar Machiraju , and Christos Faloutsos . 2010 . Eigenspokes: Surprising patterns and community structure in large graphs. PAKDD. B Aditya Prakash, Mukund Seshadri, Ashwin Sridharan, Sridhar Machiraju, and Christos Faloutsos. 2010. Eigenspokes: Surprising patterns and community structure in large graphs. PAKDD."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Barna Saha Allison Hoch Samir Khuller Louiqa Raschid and Xiao-Ning Zhang 2010. Dense subgraphs with restrictions and applications to gene annotation graphs RECOMB.  Barna Saha Allison Hoch Samir Khuller Louiqa Raschid and Xiao-Ning Zhang 2010. Dense subgraphs with restrictions and applications to gene annotation graphs RECOMB.","DOI":"10.1007\/978-3-642-12683-3_30"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Jouni K Sepp\u00e4nen and Heikki Mannila 2004. Dense itemsets KDD.  Jouni K Sepp\u00e4nen and Heikki Mannila 2004. Dense itemsets KDD.","DOI":"10.1145\/1014052.1014140"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Neil Shah Alex Beutel Brian Gallagher and Christos Faloutsos 2014. Spotting suspicious link behavior with fbox: An adversarial perspective ICDM.  Neil Shah Alex Beutel Brian Gallagher and Christos Faloutsos 2014. Spotting suspicious link behavior with fbox: An adversarial perspective ICDM.","DOI":"10.1109\/ICDM.2014.36"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Kijung Shin Tina Eliassi-Rad and Christos Faloutsos. 2016. CoreScope: Graph Mining Using k-Core Analysis - Patterns Anomalies and Algorithms ICDM.  Kijung Shin Tina Eliassi-Rad and Christos Faloutsos. 2016. CoreScope: Graph Mining Using k-Core Analysis - Patterns Anomalies and Algorithms ICDM.","DOI":"10.1109\/ICDM.2016.0058"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Kijung Shin Bryan Hooi and Christos Faloutsos. 2016. M-Zoom: Fast Dense-Block Detection in Tensors with Quality Guarantees ECML\/PKDD.  Kijung Shin Bryan Hooi and Christos Faloutsos. 2016. M-Zoom: Fast Dense-Block Detection in Tensors with Quality Guarantees ECML\/PKDD.","DOI":"10.1007\/978-3-319-46128-1_17"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Kijung Shin Bryan Hooi Jisu Kim and Christos Faloutsos. 2017. D-Cube: Dense-Block Detection in Terabyte-Scale Tensors WSDM.  Kijung Shin Bryan Hooi Jisu Kim and Christos Faloutsos. 2017. D-Cube: Dense-Block Detection in Terabyte-Scale Tensors WSDM.","DOI":"10.1145\/3018661.3018676"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150445"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487645"},{"key":"e_1_3_2_1_34_1","volume-title":"James Bailey, Yunzhe Jia, and Ian Davidson","author":"Zhou Shuo","year":"2016","unstructured":"Shuo Zhou , Nguyen Xuan Vinh , James Bailey, Yunzhe Jia, and Ian Davidson 2016 . Accelerating Online CP Decompositions for Higher Order Tensors KDD. Shuo Zhou, Nguyen Xuan Vinh, James Bailey, Yunzhe Jia, and Ian Davidson 2016. Accelerating Online CP Decompositions for Higher Order Tensors KDD."}],"event":{"name":"KDD '17: The 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Halifax NS Canada","acronym":"KDD '17","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098087","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3097983.3098087","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3097983.3098087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:26Z","timestamp":1750217426000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098087"}},"subtitle":["Incremental Dense-Subtensor Detection in Tensor Streams"],"short-title":[],"issued":{"date-parts":[[2017,8,4]]},"references-count":33,"alternative-id":["10.1145\/3097983.3098087","10.1145\/3097983"],"URL":"https:\/\/doi.org\/10.1145\/3097983.3098087","relation":{},"subject":[],"published":{"date-parts":[[2017,8,4]]},"assertion":[{"value":"2017-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}