{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:20:10Z","timestamp":1740169210629,"version":"3.37.3"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["2016YFB1000901"],"award-info":[{"award-number":["2016YFB1000901"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["91746209"],"award-info":[{"award-number":["91746209"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Program for Changjiang Scholars and Innovative Research Team in University (PCSIRT) of the Ministry of Education of China","award":["IRT17R32"],"award-info":[{"award-number":["IRT17R32"]}]},{"DOI":"10.13039\/501100001809","name":"US National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1815696","IIS-1750911"],"award-info":[{"award-number":["IIS-1815696","IIS-1750911"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3018497","type":"journal-article","created":{"date-parts":[[2020,8,21]],"date-time":"2020-08-21T20:03:51Z","timestamp":1598040231000},"page":"157800-157818","source":"Crossref","is-referenced-by-count":3,"title":["A Framework for Subgraph Detection in Interdependent Networks via Graph Block-Structured Optimization"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4714-4218","authenticated-orcid":false,"given":"Fei","family":"Jie","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3162-4310","authenticated-orcid":false,"given":"Chunpai","family":"Wang","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-5374-7293","authenticated-orcid":false,"given":"Lei","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2396-1704","authenticated-orcid":false,"given":"Xindong","family":"Wu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","article-title":"A primer on coordinate descent algorithms","author":"michael shi","year":"2016","journal-title":"arXiv 1610 00040"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0170-0"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.88.022801"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.86.026106"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1038\/nphys2727"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.88.062816"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.07.049"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1126\/science.1184819"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"877","DOI":"10.3934\/dcdss.2019058","article-title":"An independent set degree condition for fractional critical deleted graphs","volume":"12","author":"gao","year":"2018","journal-title":"Discrete Continuous Dyn Syst Series B"},{"key":"ref34","first-page":"711","article-title":"Tight independent set neighborhood union condition for fractional critical deleted graphs and ID deleted graphs","volume":"12","author":"gao","year":"2018","journal-title":"Discrete Continuous Dyn Syst Series B"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098165"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2017.13"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnu016"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.sjbs.2017.11.022"},{"key":"ref1","first-page":"1633","article-title":"Subgraph detection using eigenvector L1 norms","author":"miller","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.66"},{"key":"ref22","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":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.101"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0082"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.113"},{"key":"ref26","first-page":"1389","article-title":"A generalized matching pursuit approach for graph-structured sparsity","author":"chen","year":"2016","journal-title":"Proc Intern Joint Conf Artificial Intel (IJCAI)"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2457939"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2017.8257906"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1402008"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms7864"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2868097"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2693558"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/120887679"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1038\/nphys2180"},{"key":"ref13","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014","journal-title":"arXiv 1412 6980"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.4"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1038\/msb4100180"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)CP.1943-5487.0000079"},{"key":"ref17","first-page":"796","article-title":"Connected sub-graph detection","volume":"33","author":"qian","year":"2014","journal-title":"Proc 17th Int Conf Artif Intell Statist"},{"key":"ref18","article-title":"Anomalous spatial cluster detection","author":"neill","year":"2005","journal-title":"Proceedings of the KDD2005 Workshop on Data Mining Methods for Anomaly Detection"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2011.01014.x"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485830"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.arabjc.2017.12.024"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623619"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33015433"},{"key":"ref8","first-page":"7563","article-title":"Stochastic iterative hard thresholding for graph-structured sparsity optimization","volume":"97","author":"zhou","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623674"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-9496(2008)134:6(556)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052588"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113344"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS839"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/130949993"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1057-8"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2015.12.008"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-014-0074-y"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via the EM algorithm","volume":"39","author":"dempster","year":"1977","journal-title":"J Roy Statist Soc B Statist Methodol"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/6287639\/8948470\/9173671-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09173671.pdf?arnumber=9173671","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T09:08:06Z","timestamp":1723453686000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9173671\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":53,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3018497","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}