{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:16:48Z","timestamp":1760710608669,"version":"3.37.3"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71472081"],"award-info":[{"award-number":["71472081"]}],"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":[[2021]]},"DOI":"10.1109\/access.2021.3089699","type":"journal-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T19:45:01Z","timestamp":1623872701000},"page":"88970-88980","source":"Crossref","is-referenced-by-count":6,"title":["Large Graph Sampling Algorithm for Frequent Subgraph Mining"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6549-8204","authenticated-orcid":false,"given":"Tianyu","family":"Zheng","sequence":"first","affiliation":[{"name":"School of Computer and Software Engineering, University of Science and Technology Liaoning, Anshan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer and Software Engineering, University of Science and Technology Liaoning, Anshan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794373"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113345"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732289"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0900282106"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1830252.1830274"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2601438"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2017.02.048"},{"key":"ref17","article-title":"A walk in Facebook: Uniform sampling of users in online social networks","author":"gjoka","year":"2009","journal-title":"arXiv 0906 0060"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2010.5466698"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0501179102"},{"key":"ref28","first-page":"1966","article-title":"A sampling algorithm based on frequent edges in single large-scale graph under spark","volume":"54","author":"longyang","year":"2017","journal-title":"J Comput Res Develop"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007607"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879192"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956784"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.12.004"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-020-00682-3"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3390\/app8020230"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2011.12.002"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00090"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250900"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103539"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"11","DOI":"10.25080\/TCWV9851","article-title":"Exploring network structure, dynamics, and function using NetworkX","author":"hagberg","year":"2008","journal-title":"Proc 7th Python Sci Conf"},{"key":"ref24","first-page":"4292","article-title":"The network data repository with interactive graph analytics and visualization","author":"rossi","year":"2015","journal-title":"Proc AAAI"},{"journal-title":"SNAP Datasets Stanford large network dataset collection","year":"2014","author":"leskovec","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.124"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2000172.2000178"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09456952.pdf?arnumber=9456952","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T23:57:45Z","timestamp":1725235065000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9456952\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3089699","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2021]]}}}