{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T03:27:20Z","timestamp":1730258840084,"version":"3.28.0"},"reference-count":9,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,10,25]],"date-time":"2022-10-25T00:00:00Z","timestamp":1666656000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,25]],"date-time":"2022-10-25T00:00:00Z","timestamp":1666656000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,10,25]]},"DOI":"10.1109\/icspcc55723.2022.9984437","type":"proceedings-article","created":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T18:42:22Z","timestamp":1671820942000},"page":"1-5","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Subgraph Mining Algorithm for Social Networks"],"prefix":"10.1109","author":[{"given":"Jian","family":"Feng","sequence":"first","affiliation":[{"name":"Xi&#x2019;an University of Science and Technology,College of Computer Science and Technology,Xian,China"}]},{"given":"Yuwen","family":"Wang","sequence":"additional","affiliation":[{"name":"Xi&#x2019;an University of Science and Technology,College of Computer Science and Technology,Xian,China"}]},{"given":"Yajiao","family":"Wang","sequence":"additional","affiliation":[{"name":"Xi&#x2019;an University of Science and Technology,College of Computer Science and Technology,Xian,China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2006.51"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-020-00682-3"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.12.004"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687710"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.56"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SITIS.2013.99"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2012.94"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-013-0303-4"},{"issue":"3","key":"ref9","first-page":"663","article-title":"Survey on dynamic graph pattern matching technologies","volume":"29","author":"Xu","year":"2018","journal-title":"Ruan Jian Xue Bao\/Journal of Software"}],"event":{"name":"2022 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC)","start":{"date-parts":[[2022,10,25]]},"location":"Xi'an, China","end":{"date-parts":[[2022,10,27]]}},"container-title":["2022 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9984156\/9984215\/09984437.pdf?arnumber=9984437","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T04:08:15Z","timestamp":1706760495000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9984437\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,25]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/icspcc55723.2022.9984437","relation":{},"subject":[],"published":{"date-parts":[[2022,10,25]]}}}