{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T04:27:31Z","timestamp":1688444851814},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,8,3]],"date-time":"2013-08-03T00:00:00Z","timestamp":1375488000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s10115-013-0677-z","type":"journal-article","created":{"date-parts":[[2013,8,2]],"date-time":"2013-08-02T07:35:14Z","timestamp":1375428914000},"page":"727-759","source":"Crossref","is-referenced-by-count":7,"title":["Surfacing code in the dark: an instant clone search approach"],"prefix":"10.1007","volume":"41","author":[{"given":"Jin-woo","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mu-Woong","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jong-Won","family":"Roh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seung-won","family":"Hwang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sunghun","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,8,3]]},"reference":[{"key":"677_CR1","doi-asserted-by":"crossref","unstructured":"Lee M-W, Roh J-W, Hwang SW, Kim S (2010) Instant code clone search. In: ACM SIGSOFT\/FSE","DOI":"10.1145\/1882291.1882317"},{"key":"677_CR2","doi-asserted-by":"crossref","unstructured":"Kim J, Lee S, Hwang SW, Kim S (2009) Adding examples into java documents. In: ASE","DOI":"10.1109\/ASE.2009.39"},{"key":"677_CR3","doi-asserted-by":"crossref","unstructured":"Kim J, Lee S, Hwang SW, Sunghun K (2010) Towards an intelligent code search engine. In: AAAI","DOI":"10.1609\/aaai.v24i1.7503"},{"issue":"1","key":"677_CR4","first-page":"1:1","volume":"31","author":"J Kim","year":"2013","unstructured":"Kim J, Lee S, Hwang S-W, Kim S (2013) Enriching documents with examples: a corpus mining approach. ACM Trans Inf Syst 31(1):1:1\u20131:27","journal-title":"ACM Trans Inf Syst"},{"key":"677_CR5","unstructured":"Kim M, Bergman L, Lau T, Notkin D (2004) An ethnographic study of copy and paste programming practices in oopl. In: ISESE"},{"key":"677_CR6","doi-asserted-by":"crossref","unstructured":"Brandt J, Dontcheva M, Weskamp M, Klemmer S (2010) Example-centric programming: integrating web search into the development environment. In: SIGCHI","DOI":"10.1145\/1753326.1753402"},{"key":"677_CR7","doi-asserted-by":"crossref","unstructured":"Baxter ID, Yahin A, Moura L, Sant\u2019Anna M, Bier L (1998) Clone detection using abstract syntax trees. In: ICSM","DOI":"10.1109\/ICSM.1998.738528"},{"key":"677_CR8","doi-asserted-by":"crossref","unstructured":"Jiang L, Misherghi G, Su Z, Glondu S (2007) Deckard: scalable and accurate tree-based detection of code clones. In: ICSE","DOI":"10.1109\/ICSE.2007.30"},{"issue":"7","key":"677_CR9","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1109\/TSE.2002.1019480","volume":"28","author":"T Kamiya","year":"2002","unstructured":"Kamiya T, Kusumoto S, Inoue K (2002) CCFinder: a multilinguistic token-based code clone detection system for large scale source code. IEEE Trans Softw Eng 28(7):654\u2013670","journal-title":"IEEE Trans Softw Eng"},{"key":"677_CR10","doi-asserted-by":"crossref","unstructured":"Livieri S, Higo Y, Matushita M, Inoue K (2007) Very-large scale code clone analysis and visualization of open source programs using distributed CCFinder: D-CCFinder. In: ICSE","DOI":"10.1109\/ICSE.2007.97"},{"issue":"7","key":"677_CR11","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1016\/j.scico.2009.02.007","volume":"74","author":"CK Roy","year":"2009","unstructured":"Roy CK, Cordy JR, Koschke R (2009) Comparison and evaluation of code clone detection techniques and tools: a qualitative approach. Sci Comput Program 74(7):470\u2013495","journal-title":"Sci Comput Program"},{"key":"677_CR12","doi-asserted-by":"crossref","unstructured":"Wahler V, Seipel D, Wolff J, Fischer G (2004) Clone detection in source code by frequent itemset techniques. In: SCAM","DOI":"10.1109\/SCAM.2004.6"},{"key":"677_CR13","unstructured":"J\u00fcrgens E, Hummel B, Deissenboeck F, Feilkas M (2008) Static bug detection through analysis of inconsistent clones. In: Software Engineering (Workshops), pp 443\u2013446"},{"issue":"5","key":"677_CR14","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/1095430.1081737","volume":"30","author":"M Kim","year":"2005","unstructured":"Kim M, Sazawal V, Notkin D, Murphy G (2005) An empirical study of code clone genealogies. SIGSOFT Softw Eng Notes 30(5):187\u2013196","journal-title":"SIGSOFT Softw Eng Notes"},{"key":"677_CR15","doi-asserted-by":"crossref","unstructured":"Beckmann N, Begel HP, Schneider R, Seeger B (1990) The r*-tree: an efficient and robust access method for points and rectangles. In: SIGMOD","DOI":"10.1145\/93597.98741"},{"key":"677_CR16","doi-asserted-by":"crossref","unstructured":"Wang X-J, Zhang L, Liu M, Li Y, Ma WY (2010) Arista-image search to annotation on billions of web photos. In: CVPR","DOI":"10.1109\/CVPR.2010.5540046"},{"issue":"6","key":"677_CR17","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K Zhang","year":"1989","unstructured":"Zhang K, Shasha D (1989) Simple fast algorithms for the editing distance between trees and related problems. SIAM J Comput 18(6):1245\u20131262","journal-title":"SIAM J Comput"},{"key":"677_CR18","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"GR Hjaltason","year":"1999","unstructured":"Hjaltason GR, Samet H (1999) Distance browsing in spatial databases. ACM TODS 24:265\u2013318","journal-title":"ACM TODS"},{"issue":"6","key":"677_CR19","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1007\/s10115-003-0122-9","volume":"6","author":"C B\u00f6hm","year":"2004","unstructured":"B\u00f6hm C, Krebs F (2004) The k-nearest neighbour join: turbo charging the kdd process. Knowl Inf Syst 6(6):728\u2013749","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"677_CR20","first-page":"96","volume":"13","author":"F Korn","year":"2001","unstructured":"Korn F, Pagel B-U, Faloutsos C (2001) On the \u2018dimensionality curse\u2019 and the \u2018self-similarity blessing\u2019. TKDE 13(1):96\u2013111","journal-title":"TKDE"},{"key":"677_CR21","unstructured":"Korn F, Sidiropoulos N, Faloutsos C, Siegel E, Protopapas Z (1996) Fast nearest neighbor search in medical image databases. In: VLDB"},{"key":"677_CR22","doi-asserted-by":"crossref","unstructured":"Seidl T, Kriegel H-P (1998) Optimal multi-step k-nearest neighbor search. In: SIGMOD","DOI":"10.1145\/276304.276319"},{"key":"677_CR23","doi-asserted-by":"crossref","unstructured":"Faloutsos C, Ranganathan M, Manolopoulos Y (1994) Fast subsequence matching in time-series databases. In: SIGMOD","DOI":"10.1145\/191839.191925"},{"key":"677_CR24","unstructured":"Gionis A, Indyk P, Motwani R (1999) Similarity search in high dimensions via hashing. In: VLDB"},{"key":"677_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5689-3","volume-title":"Feature selection for knowledge discovery and data mining","author":"H Liu","year":"1998","unstructured":"Liu H, Motoda H (1998) Feature selection for knowledge discovery and data mining. Kluwer Academic Publishers, Dordrecht"},{"key":"677_CR26","unstructured":"Bercken J, Seeger B (2001) An evaluation of generic bulk loading techniques. In: VLDB"},{"key":"677_CR27","doi-asserted-by":"crossref","unstructured":"Kamel I, Faloutsos C (1993) On packing r-trees. In: CIKM","DOI":"10.1145\/170088.170403"},{"key":"677_CR28","unstructured":"Leutenegger ST, Edgington JM, Lopez MA (1997) STR: a simple and efficient algorithm for r-tree packing. In: ICDE"},{"key":"677_CR29","doi-asserted-by":"crossref","unstructured":"Berchtold S, B\u00f6hm C, Kriegel H-P(1998) Improving the query performance of high-dimensional index structures by bulk-load operations. In: EDBT","DOI":"10.1007\/BFb0100987"},{"key":"677_CR30","volume-title":"Operating system concepts","author":"A Silberschatz","year":"2008","unstructured":"Silberschatz A, Galvin PB, Gagne G (2008) Operating system concepts, 8th edn. Wiley, New York","edition":"8"},{"key":"677_CR31","volume-title":"Principal component analysis. Springer Series in Statistics","author":"IT Jolliffe","year":"2002","unstructured":"Jolliffe IT (2002) Principal component analysis. Springer Series in Statistics, 2nd edn. Springer, Berlin","edition":"2"},{"key":"677_CR32","unstructured":"Yi B-K, Faloutsos C (2000) Fast time sequence indexing for arbitrary lp norms. In: VLDB"},{"key":"677_CR33","volume-title":"Information retrieval","author":"CJ Rijsbergen Van","year":"1979","unstructured":"Van Rijsbergen CJ (1979) Information retrieval. Butterworth-Heinemann, London"},{"key":"677_CR34","unstructured":"Li Z, Shan L, Myagmar S, Zhou Y (2004) Cp-miner: a tool for finding copy-paste and related bugs in operating system code. In: OSDI"},{"issue":"1","key":"677_CR35","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/1052934.1052938","volume":"5","author":"M Bianchini","year":"2005","unstructured":"Bianchini M, Gori M, Scarselli F (2005) Inside pagerank. ACM Trans Int Technol 5(1):92\u2013128","journal-title":"ACM Trans Int Technol"},{"key":"677_CR36","doi-asserted-by":"crossref","unstructured":"Keivanloo I, Rilling J, Charland P (2011) Internet-scale real-time code clone search via multi-level indexing. In: WCRE","DOI":"10.1109\/WCRE.2011.13"},{"key":"677_CR37","doi-asserted-by":"crossref","unstructured":"Xie T, Acharya M, Thummalapenta S, Taneja K (2008) Improving software reliability and productivity via mining program source code. In: NSFNGS","DOI":"10.1109\/IPDPS.2008.4536384"},{"key":"677_CR38","doi-asserted-by":"crossref","unstructured":"Li Y, Zhang L, Li G, Xie B, Sun J (2008) Recommending typical usage examples for component retrieval in reuse repositories. In: ICSR","DOI":"10.1007\/978-3-540-68073-4_7"},{"key":"677_CR39","doi-asserted-by":"crossref","unstructured":"Holmes R, Murphy GC (2005) Using structural context to recommend source code examples. In: ICSE","DOI":"10.1109\/ICSE.2005.1553554"},{"issue":"12","key":"677_CR40","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1109\/TSE.2006.117","volume":"32","author":"R Holmes","year":"2006","unstructured":"Holmes R, Walker RJ, Murphy GC (2006) Approximate structural context matching: an approach to recommend relevant examples. IEEE Trans Softw Eng 32(12):952\u2013970","journal-title":"IEEE Trans Softw Eng"},{"key":"677_CR41","doi-asserted-by":"crossref","unstructured":"Bajracharya SK, Ngo TC, Linstead E, Dou Y, Rigor P, Baldi P, Lopes CV (2006) Sourcerer: a search engine for open source code supporting structure-based search. In: OOPSLA Companion","DOI":"10.1145\/1176617.1176671"},{"key":"677_CR42","doi-asserted-by":"crossref","unstructured":"Wang X, Lo D, Jiefeng CL, Zhang HM, Jeffrey XY (2010) Matching dependence-related queries in the system dependence graph. In: ASE","DOI":"10.1145\/1858996.1859091"},{"key":"677_CR43","doi-asserted-by":"crossref","unstructured":"McMillan C, Grechanik M, Poshyvanyk D, Xie Q, Chen F (2011) Portfolio: finding relevant functions and their usage. In: ICSE","DOI":"10.1145\/1985793.1985809"},{"key":"677_CR44","doi-asserted-by":"crossref","unstructured":"Wang S, Lo D, Jiang L (2011) Code search via topic-enriched dependence graph matching. In: WCRE","DOI":"10.1109\/WCRE.2011.69"},{"issue":"5","key":"677_CR45","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1109\/TSE.2011.84","volume":"38","author":"C McMillan","year":"2012","unstructured":"McMillan C, Grechanik M, Poshyvanyk D, Fu C, Qing X (2012) Exemplar: a source code search engine for finding highly relevant applications. IEEE Trans Softw Eng 38(5):1069\u20131087","journal-title":"IEEE Trans Softw Eng"},{"key":"677_CR46","doi-asserted-by":"crossref","unstructured":"Chan W-K, Cheng H, Lo D (2012) Searching connected api subgraph via text phrases. In: FSE","DOI":"10.1145\/2393596.2393606"},{"key":"677_CR47","doi-asserted-by":"crossref","unstructured":"McMillan C, Grechanik M, Poshyvanyk D (2012) Detecting similar software applications. In: ICSE","DOI":"10.1109\/ICSE.2012.6227178"},{"key":"677_CR48","unstructured":"Ferdian T, David L, Lingxiao J (2012) Detecting similar applications with collaborative tagging"},{"key":"677_CR49","doi-asserted-by":"crossref","unstructured":"Al-Kofahi JM, Tamrawi A, Nguyen TT, Nguyen HA, Nguyen TN (2010) Fuzzy set approach for automatic tagging in evolving software. In: ICDM","DOI":"10.1109\/ICSM.2010.5609751"},{"key":"677_CR50","doi-asserted-by":"crossref","unstructured":"Preisach C, Marinho LB, Schmidt-Thieme L (2010) Semi-supervised tag recommendation-using untagged resources to mitigate cold-start problems. In: PAKDD","DOI":"10.1007\/978-3-642-13657-3_38"},{"key":"677_CR51","doi-asserted-by":"crossref","unstructured":"Rendle S, Marinho LB, Nanopoulos A, Schmidt-Thieme L (2009) Learning optimal ranking with tensor factorization for tag recommendation. In: KDD","DOI":"10.1145\/1557019.1557100"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0677-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-013-0677-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0677-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T16:55:01Z","timestamp":1688403301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-013-0677-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,3]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["677"],"URL":"https:\/\/doi.org\/10.1007\/s10115-013-0677-z","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,3]]}}}