{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T05:27:38Z","timestamp":1775021258942,"version":"3.50.1"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"},{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1613950"],"award-info":[{"award-number":["IIS-1613950"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61229301"],"award-info":[{"award-number":["61229301"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61370144"],"award-info":[{"award-number":["61370144"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61673159"],"award-info":[{"award-number":["61673159"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Graduate Student Innovation Program of Hebei Province","award":["CXZZSS2017037"],"award-info":[{"award-number":["CXZZSS2017037"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1109\/tcyb.2017.2750691","type":"journal-article","created":{"date-parts":[[2017,9,28]],"date-time":"2017-09-28T18:12:02Z","timestamp":1506622322000},"page":"2809-2822","source":"Crossref","is-referenced-by-count":86,"title":["NOSEP: Nonoverlapping Sequence Pattern Mining With Gap Constraints"],"prefix":"10.1109","volume":"48","author":[{"given":"Youxi","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yao","family":"Tong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingquan","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xindong","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1016.2011.01452"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-006-0016-8"},{"key":"ref33","first-page":"109","article-title":"A Nettree for pattern matching with flexible wildcard constraints","author":"wu","year":"2010","journal-title":"Proc IEEE Int Conf Inf Reuse Integr"},{"key":"ref32","article-title":"ROSF: Leveraging information retrieval and supervised learning for recommending code snippets","author":"jiang","year":"0","journal-title":"IEEE Trans Services Comput"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2016.2560165"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-015-0828-5"},{"key":"ref37","first-page":"1096","article-title":"Strict pattern matching with general gaps and one-off condition","volume":"26","author":"chai","year":"2015","journal-title":"J Softw"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90018-7"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-014-0612-3"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1177\/0165551515603286"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-014-0372-y"},{"key":"ref40","author":"chen","year":"2015","journal-title":"The UCR time series classification archive"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-1002-4"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2510010"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2013.02.006"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0977-1"},{"key":"ref15","first-page":"2994","article-title":"Mining top-k distinguishing sequential patterns with gap constraint","volume":"26","author":"yang","year":"2015","journal-title":"J Softw"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-013-0499-4"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1267066.1267068"},{"key":"ref18","first-page":"1979","article-title":"Efficient mining of distinguishing sequential patterns without a predefined gap constraint","volume":"39","author":"wang","year":"2016","journal-title":"Chin J Comput"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.03.029"},{"key":"ref28","first-page":"1024","article-title":"Efficient mining of closed repetitive gapped subsequences from a sequence database","author":"ding","year":"2009","journal-title":"Proc IEEE Int Conf Data Eng"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-014-0630-1"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1002\/sam.11192","article-title":"Mining compressing sequential patterns","volume":"7","author":"lam","year":"2013","journal-title":"Stat Anal Data Min"},{"key":"ref3","first-page":"2","article-title":"Efficient mining of gap-constrained subsequences and its various applications","volume":"6","author":"li","year":"2012","journal-title":"ACM Trans Knowl Disc Data"},{"key":"ref6","first-page":"14","article-title":"Occupancy-based frequent pattern mining*","volume":"10","author":"zhang","year":"2015","journal-title":"ACM Trans Knowl Disc Data"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2381659"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2345579"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2593953"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1504\/IJFIPM.2012.050418"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-33858-3"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2013.2261984"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07821-2"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-014-1464-3"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-015-0935-3"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-012-0394-4"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-8-396"},{"key":"ref24","first-page":"372","article-title":"Efficient mining of density-aware distinguishing sequential patterns with gap constraints","author":"wang","year":"2014","journal-title":"Proc Int Conf Database Syst Adv Appl"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/882085.882086"},{"key":"ref23","first-page":"1748","article-title":"Risk prediction for acute hypotensive patients by using gap constrained sequential contrast patterns","author":"ghosh","year":"2014","journal-title":"Proc Amer Med Inf Assoc Annu Symp"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pgen.0020026"},{"key":"ref26","first-page":"2934","article-title":"Mining complex patterns across sequences with gap requirements","author":"zhu","year":"2007","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref43","first-page":"3389","article-title":"SPMF: A Java open-source pattern mining library","volume":"15","author":"fournier-viger","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-013-0426-8"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/6221036\/8466053\/8053457-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/8466053\/08053457.pdf?arnumber=8053457","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:53:18Z","timestamp":1649443998000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8053457\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":44,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2017.2750691","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"value":"2168-2267","type":"print"},{"value":"2168-2275","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10]]}}}