{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T14:13:02Z","timestamp":1730297582483,"version":"3.28.0"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"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":[[2021,10,17]]},"DOI":"10.1109\/smc52423.2021.9658790","type":"proceedings-article","created":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T20:34:35Z","timestamp":1641501275000},"page":"1992-1999","source":"Crossref","is-referenced-by-count":0,"title":["A Deep Reinforcement Learning Approach to Learning Tree Edit Policies on Binary Trees"],"prefix":"10.1109","author":[{"given":"Shirin","family":"Shirvani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manfred","family":"Huber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1006\/jtbi.1996.0188"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01896811"},{"key":"ref10","first-page":"322","article-title":"Reinforcement learning","volume":"3","author":"sutton","year":"2012","journal-title":"Learning"},{"key":"ref6","first-page":"427","article-title":"On distances between phylogenetic trees","author":"dasgupta","year":"1997","journal-title":"Proc of the 8th Annual ACM-SIAM Symp on Discrete Algorithms (SODA ’97)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(71)90020-7"},{"key":"ref8","article-title":"Walklets: Multiscale graph embeddings for interpretable network classification","author":"perozzi","year":"2016","journal-title":"CoRR"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref2","article-title":"Representation learning on graphs: Methods and applications","author":"hamilton","year":"2017","journal-title":"CoRR"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00026-001-8006-8"}],"event":{"name":"2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","start":{"date-parts":[[2021,10,17]]},"location":"Melbourne, Australia","end":{"date-parts":[[2021,10,20]]}},"container-title":["2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9658572\/9658575\/09658790.pdf?arnumber=9658790","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:56:25Z","timestamp":1652201785000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9658790\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,17]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/smc52423.2021.9658790","relation":{},"subject":[],"published":{"date-parts":[[2021,10,17]]}}}