{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:53:19Z","timestamp":1764784399357,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T00:00:00Z","timestamp":1578614400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,1,10]]},"DOI":"10.1145\/3377644.3377659","type":"proceedings-article","created":{"date-parts":[[2020,2,26]],"date-time":"2020-02-26T08:16:17Z","timestamp":1582704977000},"page":"79-83","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["An Information Intelligent Search Method for Computer Forensics Based on Text Similarity"],"prefix":"10.1145","author":[{"given":"Zhongxin","family":"Yang","sequence":"first","affiliation":[{"name":"State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhifeng","family":"Chen","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Zhang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Liu","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingbao","family":"Li","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,2,26]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"F. James Sensenbrenner. 2006. Federal Rules of Civil Procedure. https:\/\/www.uscourts.gov\/file\/19892\/download.  F. James Sensenbrenner. 2006. Federal Rules of Civil Procedure. https:\/\/www.uscourts.gov\/file\/19892\/download."},{"key":"e_1_3_2_1_2_1","unstructured":"Riadi I. Istiyanto J. E. Ashari A. and Subanar. 2013. Log analysis techniques using clustering in network forensics. International Journal of Computer Science & Information Security 10(7).  Riadi I. Istiyanto J. E. Ashari A. and Subanar. 2013. Log analysis techniques using clustering in network forensics. International Journal of Computer Science & Information Security 10(7)."},{"volume-title":"Windows Registry Forensics: Advanced Digital Forensic Analysis of the Windows Registry","author":"Carvey H.","key":"e_1_3_2_1_3_1","unstructured":"Carvey H. 2011. Windows Registry Forensics: Advanced Digital Forensic Analysis of the Windows Registry . Syngress Publishing . http:\/\/index-of.es\/Varios-2\/Windows%20Registr-y%20Forensics.pdf. Carvey H. 2011. Windows Registry Forensics: Advanced Digital Forensic Analysis of the Windows Registry. Syngress Publishing. http:\/\/index-of.es\/Varios-2\/Windows%20Registr-y%20Forensics.pdf."},{"key":"e_1_3_2_1_4_1","unstructured":"Beebe N. L. and Liu L.. 2014. Ranki ng algorithms for digital forensic string search hits. Elsevier Science Publishers B. V. DOI= http:\/\/doi.acm.org\/ 10.1016\/j.diin.2014.05.007.  Beebe N. L. and Liu L.. 2014. Ranki ng algorithms for digital forensic string search hits. Elsevier Science Publishers B. V. DOI= http:\/\/doi.acm.org\/ 10.1016\/j.diin.2014.05.007."},{"key":"e_1_3_2_1_5_1","article-title":"Thematically Clustering In Digital Forensics Text String Searching: A Survey","author":"Kansagara Nensi","year":"2017","unstructured":"Nensi Kansagara and Shubham Singh . 2017 . Thematically Clustering In Digital Forensics Text String Searching: A Survey . International Journal of Advanced Research in Computer Science, 8 (3) , March-April 2017, 1128--1130. Nensi Kansagara and Shubham Singh. 2017. Thematically Clustering In Digital Forensics Text String Searching: A Survey. International Journal of Advanced Research in Computer Science, 8 (3), March-April 2017, 1128--1130.","journal-title":"International Journal of Advanced Research in Computer Science, 8 (3)"},{"key":"e_1_3_2_1_6_1","unstructured":"Gyu-Sang Cho. 2013. A computer forensic method for detecting timestamp forgery in NTFS.Computers & Security. DOI=10.1016\/j.cose.2012.11.003.  Gyu-Sang Cho. 2013. A computer forensic method for detecting timestamp forgery in NTFS.Computers & Security. DOI=10.1016\/j.cose.2012.11.003."},{"key":"e_1_3_2_1_7_1","unstructured":"Xie Haoyang Jiang Keyu and Yuan Xiaohong etal 2012. Forensic Analysis of Windows Registry Against Intrusion. International Journal of Network Security & Its Applications. DOI=10.5121\/ijnsa.2012.4209.  Xie Haoyang Jiang Keyu and Yuan Xiaohong et al. 2012. Forensic Analysis of Windows Registry Against Intrusion. International Journal of Network Security & Its Applications. DOI=10.5121\/ijnsa.2012.4209."},{"key":"e_1_3_2_1_8_1","volume-title":"Vaughan.","author":"Donald Knuth","year":"1977","unstructured":"Knuth Donald , Jr James and Pratt , Vaughan. 1977 . Fast Pattern Matching in Strings. SIAM J. Comput .. 6. 323--350. DOI=10.1137\/0206024. Knuth Donald, Jr James and Pratt, Vaughan. 1977. Fast Pattern Matching in Strings. SIAM J. Comput.. 6. 323--350. DOI=10.1137\/0206024."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/359842.359859"},{"volume-title":"International Conference on Parallel & Distributed Computing. IEEE. DOI= 10","year":"2011","key":"e_1_3_2_1_10_1","unstructured":"Xiong, Z.. 2011 . A Composite Boyer-Moore algorithm for the string matching problem . International Conference on Parallel & Distributed Computing. IEEE. DOI= 10 .1109\/PDCAT.2010.58. Xiong, Z.. 2011. A Composite Boyer-Moore algorithm for the string matching problem. International Conference on Parallel & Distributed Computing. IEEE. DOI= 10.1109\/PDCAT.2010.58."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Pradhan Nitesh Gyanchandani Manasi and Wadhvani Rajesh. 2015. A Review on Text Similarity Technique used in IR and its Application. International Journal of Computer Applications. 120. 29--34. DOI=10.5120\/21257-4109.  Pradhan Nitesh Gyanchandani Manasi and Wadhvani Rajesh. 2015. A Review on Text Similarity Technique used in IR and its Application. International Journal of Computer Applications. 120. 29--34. DOI=10.5120\/21257-4109.","DOI":"10.5120\/21257-4109"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Farouk M.. 2019. Measuring sentences similarity: a survey. Indian Journal of Science and Technology. DOI=10.17485\/ijst\/2019\/v12i25\/143977.  Farouk M.. 2019. Measuring sentences similarity: a survey. Indian Journal of Science and Technology. DOI=10.17485\/ijst\/2019\/v12i25\/143977.","DOI":"10.17485\/ijst\/2019\/v12i25\/143977"},{"key":"e_1_3_2_1_13_1","first-page":"95","volume-title":"Information and Computation","volume":"237","author":"Peng Yung-Hsing","year":"2014","unstructured":"Yung-Hsing Peng and Chang-Biau Yang . 2014 . Finding the gapped longest common subsequence by incremental suffix maximum queries . Information and Computation , Volume 237 , Pages 95 -- 100 . DOI= https:\/\/doi.org\/10.1016\/j.ic.2014.06.001. 10.1016\/j.ic.2014.06.001 Yung-Hsing Peng and Chang-Biau Yang. 2014. Finding the gapped longest common subsequence by incremental suffix maximum queries. Information and Computation, Volume 237, Pages 95--100. DOI= https:\/\/doi.org\/10.1016\/j.ic.2014.06.001."},{"key":"e_1_3_2_1_14_1","volume-title":"Coling 2010 23rd International Conference on Computational Linguistics, Proceedings of the Conference. 2. 37--45","author":"Alberto Barr\u00f3n-Cede\u00f1o","year":"2010","unstructured":"Barr\u00f3n-Cede\u00f1o Alberto , Rosso Paolo , Agirre Eneko and Labaka, Gorka. 2010 . Plagiarism Detection across Distant Language Pairs . Coling 2010 23rd International Conference on Computational Linguistics, Proceedings of the Conference. 2. 37--45 . Barr\u00f3n-Cede\u00f1o Alberto, Rosso Paolo, Agirre Eneko and Labaka, Gorka. 2010. Plagiarism Detection across Distant Language Pairs. Coling 2010 23rd International Conference on Computational Linguistics, Proceedings of the Conference. 2. 37--45."},{"key":"e_1_3_2_1_15_1","unstructured":"Niu Y. Qiao C. Li H. and Huang M.. 2018. Word embedding based edit distance. https:\/\/arxiv.org\/pdf\/181-0.10752.pdf.  Niu Y. Qiao C. Li H. and Huang M.. 2018. Word embedding based edit distance. https:\/\/arxiv.org\/pdf\/181-0.10752.pdf."},{"volume-title":"Proceedings of the ACM Symposium on Applied Computing. 2. 1232--1237","author":"Gang Qian","key":"e_1_3_2_1_16_1","unstructured":"Qian Gang , Sural Shamik , Gu Yuelong and Pramanik, S .. 2004. Similarity between Euclidean and cosine angle distance for nearest neighbor queries . Proceedings of the ACM Symposium on Applied Computing. 2. 1232--1237 . DOI=10.1145\/967900.968151. Qian Gang, Sural Shamik, Gu Yuelong and Pramanik, S.. 2004. Similarity between Euclidean and cosine angle distance for nearest neighbor queries. Proceedings of the ACM Symposium on Applied Computing. 2. 1232--1237. DOI=10.1145\/967900.968151."},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings, The Twenty-First National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Artificial Intelligence Conference","author":"Mihalcea R, Corley","year":"2006","unstructured":"Mihalcea R, Corley C and Strapparava C . 2006. Corpus-based and Knowledge-based Measures of Text Semantic Similarity . Proceedings, The Twenty-First National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Artificial Intelligence Conference , July 16-20, 2006 , Boston, Massachusetts, USA. DBLP. Mihalcea R, Corley C and Strapparava C. 2006. Corpus-based and Knowledge-based Measures of Text Semantic Similarity. Proceedings, The Twenty-First National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Artificial Intelligence Conference, July 16-20, 2006, Boston, Massachusetts, USA. DBLP."}],"event":{"name":"ICCSP 2020: 2020 4th International Conference on Cryptography, Security and Privacy","sponsor":["NJU Nanjing University"],"location":"Nanjing China","acronym":"ICCSP 2020"},"container-title":["Proceedings of the 2020 4th International Conference on Cryptography, Security and Privacy"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377644.3377659","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3377644.3377659","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:53Z","timestamp":1750203893000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377644.3377659"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,10]]},"references-count":17,"alternative-id":["10.1145\/3377644.3377659","10.1145\/3377644"],"URL":"https:\/\/doi.org\/10.1145\/3377644.3377659","relation":{},"subject":[],"published":{"date-parts":[[2020,1,10]]},"assertion":[{"value":"2020-02-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}