{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T12:07:00Z","timestamp":1779106020423,"version":"3.51.4"},"reference-count":35,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2938825","type":"journal-article","created":{"date-parts":[[2019,9,2]],"date-time":"2019-09-02T20:23:16Z","timestamp":1567455796000},"page":"125062-125078","source":"Crossref","is-referenced-by-count":37,"title":["Fast Code Clone Detection Based on Weighted Recursive Autoencoders"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0621-6550","authenticated-orcid":false,"given":"Jie","family":"Zeng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kerong","family":"Ben","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaowei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","article-title":"EFANNA: An extremely fast approximate nearest neighbor search algorithm based on kNN graph","author":"fu","year":"2016","journal-title":"arXiv 1609 07228"},{"key":"ref32","first-page":"1287","article-title":"Convolutional neural networks over tree structures for programming language processing","author":"mou","year":"2016","journal-title":"Proc AAAI"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68474-1_3"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICSME.2016.62"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE-C.2017.78"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2015.7332459"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2007.30"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2884781.2884877"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1038\/nature14539","article-title":"Deep learning","volume":"521","author":"lecun","year":"2015","journal-title":"Nature"},{"key":"ref13","first-page":"151","article-title":"Semi-supervised recursive autoencoders for predicting sentiment distributions","author":"socher","year":"2011","journal-title":"Proc EMNLP"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2970276.2970326"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3196398.3196431"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.50"},{"key":"ref17","article-title":"Efficient estimation of word representations in vector space","author":"mikolov","year":"2013","journal-title":"arXiv 1301 3781 [cs]"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"ref19","first-page":"801","article-title":"Dynamic pooling and unfolding recursive autoencoders for paraphrase detection","author":"pennington","year":"2011","journal-title":"Proc NIPS"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3236024.3236068"},{"key":"ref4","first-page":"289","article-title":"CP-miner: A tool for finding copy-paste and related bugs in operating system code","author":"li","year":"2004","journal-title":"Proc OSDI"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/423"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICSME.2017.33"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.62"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1993.5.3.402"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2012.13"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICPC.2011.26"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2007.70725"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SANER.2016.78"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2002.1019480"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2013.01.008"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICSME.2014.77"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2007.97"},{"key":"ref21","first-page":"84","article-title":"DéjàVu: A map of code duplicates on GitHub","author":"lopes","year":"2017","journal-title":"Proc OOPSLA"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3236024.3236026"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICSME.2017.46"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08822436.pdf?arnumber=8822436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:31:32Z","timestamp":1641987092000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8822436\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2938825","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}