{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T23:08:26Z","timestamp":1768777706161,"version":"3.49.0"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","award":["2017YFB0803301"],"award-info":[{"award-number":["2017YFB0803301"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1836215"],"award-info":[{"award-number":["U1836215"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"DongGuan Innovative Research Team Program","award":["201636000100038"],"award-info":[{"award-number":["201636000100038"]}]},{"DOI":"10.13039\/501100013314","name":"111 Project","doi-asserted-by":"crossref","award":["B18008"],"award-info":[{"award-number":["B18008"]}],"id":[{"id":"10.13039\/501100013314","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2916811","type":"journal-article","created":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T15:53:12Z","timestamp":1557849192000},"page":"62817-62832","source":"Crossref","is-referenced-by-count":2,"title":["Efficiently Approximating Top-$k$  Sequential Patterns in Transactional Graphs"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3881-8487","authenticated-orcid":false,"given":"Mingtao","family":"Lei","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2111-7385","authenticated-orcid":false,"given":"Xi","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jincui","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Binxing","family":"Fang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"107","article-title":"PFP: Parallel FP-growth for query recommendation","author":"haoyuan","year":"2008","journal-title":"Proc ACM Conf Recommender Syst"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91458-9_6"},{"key":"ref12","first-page":"215","article-title":"PrefixSpan,: Mining sequential patterns efficiently by prefix-projected pattern growth","author":"pei","year":"2001","journal-title":"Proc 17th IEEE Int Conf Data Engineering"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806424"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33460-3_7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783265"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.14778\/3055540.3055543"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.14778\/3115404.3115406"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91452-7_31"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.14778\/2732232.2732238"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3041021.3051159"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783267"},{"key":"ref3","year":"2017","journal-title":"The OpenFlights Airport Airline Plane and Route Databases"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91452-7_23"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31750-2_2"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1155\/2000\/19436"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"ref2","year":"2014","journal-title":"Quest synthetic data generation"},{"key":"ref9","author":"lei","year":"2018","journal-title":"Mining top-k sequential patterns in database graphs A new challenging problem and a sampling-based approach"},{"key":"ref1","year":"2019","journal-title":"DataBase Systems and Logic Programming"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/170036.170072"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.chb.2016.07.032"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014140"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488517500180"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2005.850180"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2567993"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098142"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08713866.pdf?arnumber=8713866","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:54:56Z","timestamp":1641988496000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8713866\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2916811","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}