{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T18:22:48Z","timestamp":1769019768816,"version":"3.49.0"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key R&D Plan","award":["2018YFC0809800"],"award-info":[{"award-number":["2018YFC0809800"]}]},{"name":"NSFC program","award":["61872022"],"award-info":[{"award-number":["61872022"]}]},{"name":"NSFC program","award":["61421003"],"award-info":[{"award-number":["61421003"]}]},{"name":"Beijing Advanced Innovation Center for Big Data and Brain Computing"},{"name":"NSF","award":["IIS-1441479"],"award-info":[{"award-number":["IIS-1441479"]}]},{"name":"NSF","award":["IIS- 1815696"],"award-info":[{"award-number":["IIS- 1815696"]}]},{"name":"NSF","award":["1815696"],"award-info":[{"award-number":["1815696"]}]},{"name":"NSF","award":["IIS-1633363"],"award-info":[{"award-number":["IIS-1633363"]}]},{"name":"NSF","award":["DGE-1545362"],"award-info":[{"award-number":["DGE-1545362"]}]},{"name":"NSF CAREER","award":["IIS-1750911"],"award-info":[{"award-number":["IIS-1750911"]}]},{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-17-1-0021"],"award-info":[{"award-number":["W911NF-17-1-0021"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2019,10,1]]},"DOI":"10.1109\/tkde.2018.2868097","type":"journal-article","created":{"date-parts":[[2018,8,31]],"date-time":"2018-08-31T18:50:13Z","timestamp":1535741413000},"page":"1849-1862","source":"Crossref","is-referenced-by-count":12,"title":["A Nonparametric Approach to Uncovering Connected Anomalies by Tree Shaped Priors"],"prefix":"10.1109","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9074-0827","authenticated-orcid":false,"given":"Nannan","family":"Wu","sequence":"first","affiliation":[]},{"given":"Feng","family":"Chen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4034-0400","authenticated-orcid":false,"given":"Jianxin","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jinpeng","family":"Huai","sequence":"additional","affiliation":[]},{"given":"Baojian","family":"Zhou","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6297-712X","authenticated-orcid":false,"given":"Bo","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1821-9743","authenticated-orcid":false,"given":"Naren","family":"Ramakrishnan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1287\/educ.1053.0017"},{"key":"ref32","article-title":"Beijing transport institute.","year":"2010"},{"key":"ref31","article-title":"Mep of China.","year":"2014"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00015-I"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2011.01014.x"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081897"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1080\/03610929708831995"},{"key":"ref13","first-page":"1959","article-title":"Near-optimal anomaly detection in graphs using lovasz extended scan statistic","author":"sharpnack","year":"2013","journal-title":"Proc 26th Int Conf Neural Inf Process Syst - Vol 2"},{"key":"ref14","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":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF00533250"},{"key":"ref16","first-page":"962","article-title":"Higher criticism for detecting sparse heterogeneous mixtures","author":"donoho","year":"2004","journal-title":"Ann Statist"},{"key":"ref17","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":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.101"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39206-1_8"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/90.893870"},{"key":"ref4","first-page":"545","article-title":"Changepoint detection over graphs with the spectral scan statistic","author":"sharpnack","year":"2013","journal-title":"Proc 16th Int Conf Artif Intell Statist"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.290"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1186\/1476-072X-7-14"},{"key":"ref6","first-page":"796","article-title":"Connected sub-graph detection","author":"qian","year":"2014","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref29","article-title":"Improved fully polynomial time approximation scheme for the 0-1 multiple-choice knapsack problem","author":"bansal","year":"2004","journal-title":"Int Inst Inf Technol Rep"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2014.960926"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1541880.1541882"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1081443229"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X112396"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623619"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9473(02)00302-X"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2011.01014.x"},{"key":"ref22","first-page":"760","article-title":"The prize collecting steiner tree problem: Theory and practice","author":"johnson","year":"2000","journal-title":"SODA"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.66"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BF00533250"},{"key":"ref23","first-page":"962","article-title":"Higher criticism for detecting sparse heterogeneous mixtures","author":"donoho","year":"2004","journal-title":"Ann Statist"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113364"},{"key":"ref25","first-page":"81","article-title":"Improved approximation algorithms for (budgeted) node-weighted steiner problems","author":"bateni","year":"2013","journal-title":"Proc Colloq Autom Lang Program"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8832290\/08452980.pdf?arnumber=8452980","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:49:50Z","timestamp":1657745390000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8452980\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,1]]},"references-count":33,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2018.2868097","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,1]]}}}