{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:46:35Z","timestamp":1740181595737,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T00:00:00Z","timestamp":1723420800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T00:00:00Z","timestamp":1723420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-024-03140-5","type":"journal-article","created":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T13:03:19Z","timestamp":1723467799000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive Prefix Filtering for Accurate Code Clone Detection in Conjunction with Meta-learning"],"prefix":"10.1007","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9036-4876","authenticated-orcid":false,"given":"Chavi","family":"Ralhan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Navneet","family":"Malik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prateek","family":"Agrawal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charu","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nishtha","family":"jatana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Divya","family":"Jatain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geetanjali","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,12]]},"reference":[{"key":"3140_CR1","unstructured":"Sahar H, Liu Y, Hindle A, Barbosa D. An empirical evaluation of the usefulness of tree kernels for commit-time defect detection in large software systems. arXiv preprint. 2021."},{"key":"3140_CR2","doi-asserted-by":"crossref","unstructured":"Sajnani H, Saini V, Svajlenko J, Roy CK, Lopes CV. SourcererCC: scaling code clone detection to big code. arXiv preprint. 2015.","DOI":"10.1145\/2884781.2884877"},{"key":"3140_CR3","doi-asserted-by":"crossref","unstructured":"Wang W, Li G, Ma B, Xia X, Jin Z. Detecting code clones with graph neural network and flow-augmented abstract syntax tree. arXiv preprint. 2020.","DOI":"10.1109\/SANER48275.2020.9054857"},{"key":"3140_CR4","doi-asserted-by":"crossref","unstructured":"Kamiya T. CCFinderX: an interactive code clone analysis environment. In: Code clone analysis: research, tools, and practices, 2021. pp. 31-44.","DOI":"10.1007\/978-981-16-1927-4_2"},{"key":"3140_CR5","unstructured":"Zhang X, Wang T, Yu Y, Zhang Y, Zhong Y, Wang H. The development and prospect of code clone. arXiv preprint. 2022."},{"key":"3140_CR6","doi-asserted-by":"crossref","unstructured":"Xue H, Mei Y, Gogineni K, Venkataramani G, Lan T. Twin-finder: integrated reasoning engine for pointer-related code clone detection. arXiv preprint. 2019.","DOI":"10.1109\/IWSC50091.2020.9047638"},{"key":"3140_CR7","unstructured":"Fu M, Luo G, Zheng X, Zhang T, Yu D, Kim M. An ensemble learning approach for software semantic clone detection. arXiv preprint. 2020."},{"key":"3140_CR8","doi-asserted-by":"publisher","first-page":"11696","DOI":"10.1109\/ACCESS.2022.3145686","volume":"10","author":"M Hammad","year":"2022","unstructured":"Hammad M, Babur \u00d6, Basit HA, Van Den Brand M. Clone-seeker: effective code clone search using annotations. IEEE Access. 2022;10:11696\u2013713.","journal-title":"IEEE Access"},{"key":"3140_CR9","doi-asserted-by":"crossref","unstructured":"Saini V, Farmahinifarahani F, Lu Y, Baldi P, Lopes C. Oreo: detection of clones in the twilight zone. 2018.","DOI":"10.1145\/3236024.3236026"},{"key":"3140_CR10","doi-asserted-by":"crossref","unstructured":"Thaller H, Linsbauer L, Egyed A. Semantic clone detection via probabilistic software modeling. arXiv preprint. 2020.","DOI":"10.1109\/VST50071.2020.9051635"},{"key":"3140_CR11","unstructured":"Kuttal SK, Ghosh A. Source code comments: overlooked in the realm of code clone detection. arXiv preprint. 2020."},{"key":"3140_CR12","doi-asserted-by":"crossref","unstructured":"Nadim M, Mondal M, Roy CK, Schneider K. Evaluating the performance of clone detection tools in detecting cloned co-change candidates. arXiv preprint. 2022.","DOI":"10.1016\/j.jss.2022.111229"},{"key":"3140_CR13","unstructured":"Svajlenko J, Roy CK. A survey on the evaluation of clone detection performance and benchmarking. 2020."},{"key":"3140_CR14","doi-asserted-by":"crossref","unstructured":"White M, Tufano M, Vendome C, Poshyvanyk D. Deep learning code fragments for code clone detection. arXiv preprint. 2016.","DOI":"10.1145\/2970276.2970326"},{"key":"3140_CR15","doi-asserted-by":"crossref","unstructured":"Zubkov M, Spirin E, Bogomolov E, Bryksin T. Evaluation of contrastive learning with various code representations for code clone detection. 2022.","DOI":"10.2139\/ssrn.4159812"},{"key":"3140_CR16","doi-asserted-by":"crossref","unstructured":"Feng Z, Guo D, Tang D, Duan N, Feng X, Gong M, Shou L, Qin B, Liu T, Jiang D, Zhou M. CodeBERT: a pre-trained model for programming and natural languages. 2020.","DOI":"10.18653\/v1\/2020.findings-emnlp.139"},{"key":"3140_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2021.111141","volume":"184","author":"M Lei","year":"2022","unstructured":"Lei M, Zhang Y, Lyu Y, Wang Z, Jiang L. Deep learning application on code clone detection: a review of current knowledge. J Syst Softw. 2022;184: 111141.","journal-title":"J Syst Softw"},{"key":"3140_CR18","unstructured":"Khajezade M, Fard FH, Shehata MS. Evaluating few shot and contrastive learning methods for code clone detection. arXiv preprint arXiv:2204.07501. 2022."},{"key":"3140_CR19","doi-asserted-by":"crossref","unstructured":"Mostaeen G, Roy B, Roy C, Schneider K, Svajlenko J. A machine learning based framework for code clone validation. arXiv preprint. 2020.","DOI":"10.1016\/j.jss.2020.110686"},{"key":"3140_CR20","doi-asserted-by":"publisher","first-page":"204585","DOI":"10.1109\/ACCESS.2020.3037253","volume":"8","author":"MS Anwar","year":"2020","unstructured":"Anwar MS, Wang J, Ahmad S, Khan W, Ullah A, Shah M, Fei Z. Impact of the impairment in 360-degree videos on users VR involvement and machine learning-based QoE predictions. IEEE Access. 2020;8:204585\u201396.","journal-title":"IEEE Access"},{"key":"3140_CR21","unstructured":"Zhang Y, Yang J, Dong H, Wang Q, Shao H, Leach K, Huang Y. ASTRO: an AST-assisted approach for generalizable neural clone detection. 2022."},{"key":"3140_CR22","doi-asserted-by":"crossref","unstructured":"Zhang L, Cui Y, Wang M, Zhu K, Zhu Y, Jiang Y. DeepCC: bridging the gap between congestion control and applications via multi-objective optimization. arXiv preprint. 2021.","DOI":"10.1109\/TNET.2022.3167713"},{"key":"3140_CR23","doi-asserted-by":"crossref","unstructured":"Alalfi MH, Cordy JR, Dean TR, Stephan M, Stevenson A. Models are code too: near-miss clone detection for Simulink models. In: 2012 28th IEEE international conference on software maintenance (ICSM). 2012. pp. 295\u2013304.","DOI":"10.1109\/ICSM.2012.6405285"},{"key":"3140_CR24","doi-asserted-by":"crossref","unstructured":"Jiang L, Misherghi G, Su Z, Glondu S. Deckard: scalable and accurate tree-based detection of code clones. In: 29th International conference on software engineering (ICSE\u201907). 2007. pp. 96\u2013105.","DOI":"10.1109\/ICSE.2007.30"},{"key":"3140_CR25","first-page":"35","volume":"24","author":"S Ahmad","year":"2018","unstructured":"Ahmad S, Li Kan, Eddine Hosni Adil Imad, Khan Muhammad Imran. A biologically inspired cognitive skills measurement approach. Biol Inspired Cogn Archit. 2018;24:35\u201346.","journal-title":"Biol Inspired Cogn Archit"},{"key":"3140_CR26","unstructured":"Freund Y, Schapire RE. Experiments with a new boosting algorithm. Int Conf Mach Learn. 1996:148\u2013156. https:\/\/cseweb.ucsd.edu\/~yfreund\/papers\/boostingexperiments.pdf"},{"issue":"2","key":"3140_CR27","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0893-6080(05)80023-1","volume":"5","author":"DH Wolpert","year":"1992","unstructured":"Wolpert DH. Stacked generalization. Neural Networks. 1992;5(2):241\u201359. https:\/\/www.sciencedirect.com\/science\/article\/abs\/pii\/S0893608005800231\n.","journal-title":"Neural Networks."},{"key":"3140_CR28","doi-asserted-by":"crossref","unstructured":"Chen T, Guestrin C. XGBoost: a scalable tree boosting system. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, 2016. p. 785\u2013794. https:\/\/dl.acm.org\/doi\/10.1145\/2939672.2939785","DOI":"10.1145\/2939672.2939785"},{"key":"3140_CR29","first-page":"3146","volume":"30","author":"G Ke","year":"2017","unstructured":"Ke G, Meng Q, Finley T, Wang T, Chen W, Ma W, Liu T-Y. LightGBM: A highly efficient gradient boosting decision tree. Adv Neural Inf Proc Syst. 2017;30:3146\u201354. https:\/\/papers.nips.cc\/paper\/2017\/hash\/6449f44a102fde848669bdd9eb6b76fa-Abstract.html\n.","journal-title":"Adv Neural Inf Proc Syst."}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-024-03140-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-024-03140-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-024-03140-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T13:04:48Z","timestamp":1723467888000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-024-03140-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,12]]},"references-count":29,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2024,8]]}},"alternative-id":["3140"],"URL":"https:\/\/doi.org\/10.1007\/s42979-024-03140-5","relation":{},"ISSN":["2661-8907"],"issn-type":[{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2024,8,12]]},"assertion":[{"value":"14 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Research involving human and \/or animals"}}],"article-number":"789"}}