{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T11:04:27Z","timestamp":1725707067125},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T00:00:00Z","timestamp":1700611200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T00:00:00Z","timestamp":1700611200000},"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":[[2023,11,22]]},"DOI":"10.1109\/sita60746.2023.10373698","type":"proceedings-article","created":{"date-parts":[[2024,1,3]],"date-time":"2024-01-03T19:26:16Z","timestamp":1704309976000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Identifying Near-Duplicate Pairs in Exams: Similarity Detection Using Kshingling, Minhashing, and LSH"],"prefix":"10.1109","author":[{"given":"El Rhezzali","family":"Nabila","sequence":"first","affiliation":[{"name":"Information Sciences School,ITQAN Team, LyRica Lab,Rabat,Morocco"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hilal","family":"Imane","sequence":"additional","affiliation":[{"name":"Information Sciences School,ITQAN Team, LyRica Lab,Rabat,Morocco"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hnida","family":"Meriem","sequence":"additional","affiliation":[{"name":"Information Sciences School,ITQAN Team, LyRica Lab,Rabat,Morocco"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.14569\/IJACSA.2017.080425"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1207\/S15327019EB1103_2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3200\/JECE.39.2.116-125"},{"key":"ref4","article-title":"Academic integrity in web-based distance education","author":"Barron","year":"2005","journal-title":"Tech Trends Link Res Pract Improve Learn"},{"journal-title":"Int J Comput Appl","first-page":"201368","article-title":"A Survey of Text Similarity Approaches","key":"ref5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/356827.356830"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/359038.359041"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1080\/01621459.1989.10478785","article-title":"Advances in record linkage methodology as applied to the 1985 census of Tampa Florida","author":"Jaro","year":"1989","journal-title":"J Am Stat Soc"},{"article-title":"Semantic and associative priming in a high-dimensional semantic space","volume-title":"Cognitive Science Proceedings (LEA)","author":"Lund","key":"ref9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3758\/BF03204766"},{"article-title":"String Comparator Metrics and Enhanced Decision Rules in the Fellegi-Sunter Model of Record Linkage","volume-title":"Proceedings of the Section on Survey Research Methods","author":"Winkler","key":"ref11"},{"article-title":"Corpus based and knowledge-based measures of text semantic similarity","volume-title":"Proceedings of the American Association for Artificial Intelligence","author":"Mihalcea","key":"ref12"},{"journal-title":"Levenshtein Distance Technique in Dictionary Lookup Methods: An Improved Approach","author":"Haldar","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1361\/1\/012080"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CITSM.2016.7577578"},{"article-title":"How to measure the semantic similarities between scientific papers and patents in order to discover uncommercialized research fonts: A case study of solar cells","volume-title":"Proc PICMET Technol Manag Glob Econ Growth Phuket","author":"Shibata","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2015.7364028"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/BIGCOM.2017.53"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.5120\/11638-7118"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45123-4_1"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SEQUEN.1997.666900"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139058452"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1690"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/69.908981"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.49"},{"key":"ref26","first-page":"518","article-title":"Similarity search in high dimensions via hashing","volume-title":"Proc Int Conf Very Large Data Bases","author":"Gionis"}],"event":{"name":"2023 14th International Conference on Intelligent Systems: Theories and Applications (SITA)","start":{"date-parts":[[2023,11,22]]},"location":"Casablanca, Morocco","end":{"date-parts":[[2023,11,23]]}},"container-title":["2023 14th International Conference on Intelligent Systems: Theories and Applications (SITA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10373588\/10373590\/10373698.pdf?arnumber=10373698","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T03:55:04Z","timestamp":1706068504000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10373698\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,22]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/sita60746.2023.10373698","relation":{},"subject":[],"published":{"date-parts":[[2023,11,22]]}}}