{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T21:34:34Z","timestamp":1740173674459,"version":"3.37.3"},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"China NSFC Program","doi-asserted-by":"publisher","award":["61872022","61421003"],"award-info":[{"award-number":["61872022","61421003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100015639","name":"Beijing Advanced Innovation Center for Big Data and Brain Computing","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100015639","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Soc. Syst."],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1109\/tcss.2020.2971756","type":"journal-article","created":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T22:30:05Z","timestamp":1582669805000},"page":"161-170","source":"Crossref","is-referenced-by-count":0,"title":["A Bisubmodular Approach to Event Detection and Prediction in Multivariate Social Graphs"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8502-2927","authenticated-orcid":false,"given":"Shuai","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Haoyi","family":"Zhou","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4508-5963","authenticated-orcid":false,"given":"Feng","family":"Chen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8813-450X","authenticated-orcid":false,"given":"Jianxin","family":"Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF00533250"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.5210\/ojphi.v6i1.5137"},{"key":"ref12","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":"ref13","doi-asserted-by":"publisher","DOI":"10.1089\/big.2014.0072"},{"key":"ref14","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":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623674"},{"key":"ref16","volume":"174","author":"garey","year":"1979","journal-title":"Computers and Intractability"},{"key":"ref17","first-page":"2436","article-title":"Submodular optimization with submodular cover and submodular knapsack constraints","author":"iyer","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref18","first-page":"2742","article-title":"Curvature and optimal algorithms for learning and minimizing submodular functions","author":"iyer","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref19","article-title":"Algorithms for approximate minimization of the difference between submodular functions, with applications","author":"iyer","year":"2012","journal-title":"arXiv 1207 0560"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2019.2938954"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.26599\/BDMA.2018.9020004"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/sim.2818"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02416924"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/sim.3881"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311911"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052588"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623619"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.4"},{"key":"ref20","first-page":"1","article-title":"Fast semidifferential-based submodular function optimization: Extended version","author":"iyer","year":"2013","journal-title":"Proc ICML"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963443"},{"key":"ref21","first-page":"1468","author":"ward","year":"2014","journal-title":"Maximizing Bisubmodular and K-Submodular Functions"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/sim.5675"}],"container-title":["IEEE Transactions on Computational Social Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6570650\/9340408\/09011569.pdf?arnumber=9011569","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:53:47Z","timestamp":1652194427000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9011569\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2]]},"references-count":23,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tcss.2020.2971756","relation":{},"ISSN":["2329-924X","2373-7476"],"issn-type":[{"type":"electronic","value":"2329-924X"},{"type":"electronic","value":"2373-7476"}],"subject":[],"published":{"date-parts":[[2021,2]]}}}