{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T16:02:15Z","timestamp":1780761735409,"version":"3.54.1"},"reference-count":104,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000774","name":"Defense Threat Reduction Agency (DTRA) Comprehensive National Incident Management System (CNIMS)","doi-asserted-by":"publisher","award":["HDTRA1-11-D-0016-0010"],"award-info":[{"award-number":["HDTRA1-11-D-0016-0010"]}],"id":[{"id":"10.13039\/100000774","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000774","name":"Defense Threat Reduction Agency (DTRA) Comprehensive National Incident Management System (CNIMS)","doi-asserted-by":"publisher","award":["HDTRA1-17-0118"],"award-info":[{"award-number":["HDTRA1-17-0118"]}],"id":[{"id":"10.13039\/100000774","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation (NSF)","doi-asserted-by":"publisher","award":["IIS-1633028"],"award-info":[{"award-number":["IIS-1633028"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation (NSF)","doi-asserted-by":"publisher","award":["ACI-1443054"],"award-info":[{"award-number":["ACI-1443054"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["IIS-1750911"],"award-info":[{"award-number":["IIS-1750911"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["IIS-1441479"],"award-info":[{"award-number":["IIS-1441479"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office (ARO)","doi-asserted-by":"publisher","award":["W911NF1720129"],"award-info":[{"award-number":["W911NF1720129"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. IEEE"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1109\/jproc.2018.2813311","type":"journal-article","created":{"date-parts":[[2018,4,25]],"date-time":"2018-04-25T19:07:13Z","timestamp":1524683233000},"page":"829-845","source":"Crossref","is-referenced-by-count":13,"title":["Graph Anomaly Detection Based on Steiner Connectivity and Density"],"prefix":"10.1109","volume":"106","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6161-7480","authenticated-orcid":false,"given":"Jose","family":"Cadena","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feng","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anil","family":"Vullikanti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010050"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176344559"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1214\/14-STS506"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1214\/009053604000000265"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339670"},{"key":"ref30","first-page":"17","article-title":"A faster implementation of the Goemans-Williamson clustering algorithm","author":"cole","year":"2001","journal-title":"Proc 12th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1080\/00223980.1972.9924813"},{"key":"ref36","article-title":"Graph-based approaches to insider threat detection","author":"eberle","year":"2009","journal-title":"Proc Workshop Cyber Secur Inf Intell Res Cyber Secur Inf Intell Challenges Strategies"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X112396"},{"key":"ref34","author":"downey","year":"2012","journal-title":"Parameterized Complexity"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623619"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.5210\/ojphi.v6i1.5137"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1089\/big.2014.0072"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.101"},{"key":"ref22","first-page":"1","article-title":"Near-optimal and practical algorithms for graph scan statistics","author":"cadena","year":"2017","journal-title":"Proc of SIAM International Conf on Data Mining (SDM)"},{"key":"ref21","first-page":"1","article-title":"The maximum clique problem","author":"bomze","year":"1999","journal-title":"Handbook of Combinatorial Optimization"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0016"},{"key":"ref23","article-title":"Near optimal and practical algorithms for graph scan statistics with connectivity constraints","author":"cadena","year":"2018"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972788.66"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.39"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1016\/j.socscimed.2009.09.058"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44436-X_10"},{"key":"ref50","first-page":"928","article-title":"A nearly-linear time framework for graph-structured sparsity","author":"hegde","year":"2015","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939747"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1080\/03610929708831995"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/PCi.2012.60"},{"key":"ref57","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/978-3-642-02927-1_50","article-title":"On finding dense subgraphs","author":"khuller","year":"2009","journal-title":"International Colloquium on Automata Languages and Programming"},{"key":"ref56","article-title":"Network intrusion detection","author":"keen","year":"2012"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1002\/sim.3951"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1214\/0009053607000000244"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1385\/1-59745-389-7:71"},{"key":"ref52","volume":"53","author":"hwang","year":"1992","journal-title":"The Steiner Tree Problem"},{"key":"ref40","first-page":"2001","article-title":"On the densest k-subgraph problem","volume":"29","author":"feige","year":"1997","journal-title":"Algorithmica"},{"key":"ref4","first-page":"410","article-title":"OddBall: Spotting anomalies in weighted graphs","author":"akoglu","year":"2010","journal-title":"Advances in Knowledge Discovery and Data Mining"},{"key":"ref3","first-page":"77","article-title":"Event detection in time series of mobile communication graphs","author":"akoglu","year":"2010","journal-title":"Proc Army Sci Conf"},{"key":"ref6","first-page":"51","article-title":"Connected subgraph detection with mirror descent on SDPs","author":"aksoylar","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-014-0365-y"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0091225"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOAS329"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/210332.210337"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1080\/23249935.2015.1087229"},{"key":"ref46","article-title":"Finding a maximum density subgraph","author":"goldberg","year":"1984"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"ref48","author":"hauptmann","year":"2013","journal-title":"A Compendium on Steiner Tree Problems"},{"key":"ref47","first-page":"627","article-title":"Clique is hard to approximate within \n$n^{{1}-\\epsilon} $","author":"hastad","year":"1996","journal-title":"Proc 37th Annu Symp Found Comput Sci"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.2307\/2600873"},{"key":"ref41","author":"fisher","year":"1925","journal-title":"Statistical Methods for Research Workers"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793242618"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2011.65"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2011.01014.x"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1186\/1476-072X-8-20"},{"key":"ref71","first-page":"48","article-title":"Fast and flexible outbreak detection by linear-time subset scanning","volume":"5","author":"neill","year":"2008","journal-title":"Advances in Disease Surveillance"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1080\/00401706.2013.822830"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)CP.1943-5487.0000079"},{"key":"ref77","first-page":"2914","article-title":"Detecting change points in the large-scale structure of evolving networks","author":"peel","year":"2015","journal-title":"Proc AAAI"},{"key":"ref74","first-page":"106","article-title":"A nonparametric scan statistic for multivariate disease surveillance","volume":"4","author":"neill","year":"2007","journal-title":"Advances in Disease Surveillance"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956831"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1007\/s10588-005-5378-z"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocrd.2013.12.002"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9473(02)00160-3"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.49"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835816"},{"key":"ref63","first-page":"303","article-title":"A survey of algorithms for dense subgraph discovery","author":"lee","year":"2010","journal-title":"Managing and Mining Graph Data"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.7448\/IAS.18.1.19888"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1016\/S0277-9536(02)00104-1"},{"key":"ref66","first-page":"1533","article-title":"Fast generalized subset scan for anomalous pattern detection","volume":"14","author":"mcfowland","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref67","first-page":"1633","article-title":"Subgraph detection using eigenvector L1 norms","author":"miller","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1016\/j.jspi.2007.03.040"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767885"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.4"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1007\/3-540-45995-2_51","article-title":"Massive quasi-clique detection","author":"abello","year":"2002","journal-title":"LATIN 2002 Theoretical Informatics"},{"key":"ref95","first-page":"1","article-title":"Neighborhood formation and anomaly detection in bipartite graphs","author":"sun","year":"2005","journal-title":"Proc of IEEE Intl Conf on Data Mining (ICDM"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281266"},{"key":"ref93","author":"stouffer","year":"1949","journal-title":"The American Soldier Adjustment During Army Life"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.66"},{"key":"ref91","first-page":"1","article-title":"Fast graph scan for scalable detection of arbitrary connected clusters","author":"speakman","year":"2010","journal-title":"Advances in Disease Surveillance"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0082"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2014.960926"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1080\/07418825.2012.732100"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1002\/0470011815.b2a15064"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487645"},{"key":"ref99","first-page":"55","article-title":"Discovery of mutated subnetworks associated with clinical data in cancer","author":"vandin","year":"2012","journal-title":"Proceedings of BIOCOMP"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1002\/sam.102"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-3-540-95995-3_3","article-title":"Finding dense subgraphs with size bounds","author":"andersen","year":"2009","journal-title":"Algorithms and Models for the Web-Graph"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/978-3-319-06605-9_23","article-title":"Com2: Fast automatic discovery of temporal (‘Comet’) communities","author":"araujo","year":"2014","journal-title":"Advances in Knowledge Discovery and Data Mining"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS839"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00243-8"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1111\/j.1365-3156.2010.02492.x"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2515078"},{"key":"ref16","author":"batagelj","year":"2003","journal-title":"An O(m) Algorithm for Cores Decomposition of Networks"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1002\/wics.1347"},{"key":"ref17","first-page":"81","article-title":"Improved approximation algorithms for (budgeted) node-weighted Steiner problems","author":"bateni","year":"2013","journal-title":"Proc Int Colloq Automata Lang Program (ICALP)"},{"key":"ref81","first-page":"1","article-title":"Connected sub-graph detection","author":"qian","year":"2014","journal-title":"Proc Artif Intell Stat"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1979.10481035"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623674"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ITI.2006.1708474"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72608-1_12"},{"key":"ref80","first-page":"2708","article-title":"Efficient minimax signal detection on graphs","author":"qian","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref89","first-page":"545","article-title":"Changepoint detection over graphs with the spectral scan statistic","author":"sharpnack","year":"2013","journal-title":"Proc Artif Intell Stat"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1145\/3046791"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536344"},{"key":"ref87","first-page":"1959","article-title":"Near-optimal anomaly detection in graphs using Lovasz extended scan statistic","author":"sharpnack","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref88","first-page":"1","article-title":"Sparsistency of the edge lasso over graphs","author":"sharpnack","year":"2012","journal-title":"Proc Artif Intell Stat"}],"container-title":["Proceedings of the IEEE"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/5\/8347155\/8347142-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5\/8347155\/08347142.pdf?arnumber=8347142","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:55:54Z","timestamp":1649444154000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8347142\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5]]},"references-count":104,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/jproc.2018.2813311","relation":{},"ISSN":["0018-9219","1558-2256"],"issn-type":[{"value":"0018-9219","type":"print"},{"value":"1558-2256","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5]]}}}