{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:17:22Z","timestamp":1742955442905,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030898199"},{"type":"electronic","value":"9783030898205"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89820-5_12","type":"book-chapter","created":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T20:35:26Z","timestamp":1634762126000},"page":"153-162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Plagiarism Detection in Students\u2019 Answers Using FP-Growth Algorithm"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2967-2201","authenticated-orcid":false,"given":"Sabina","family":"Nurlybayeva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3221-9352","authenticated-orcid":false,"given":"Iskander","family":"Akhmetov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7845-9039","authenticated-orcid":false,"given":"Alexander","family":"Gelbukh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7283-5144","authenticated-orcid":false,"given":"Rustam","family":"Mussabayev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,21]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Bensalem, I., Rosso, P., Chikhi, S.: Intrinsic plagiarism detection using N-gram classes. In: EMNLP 2014 - 2014 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference, pp. 1459\u20131464 (2014). https:\/\/doi.org\/10.3115\/v1\/d14-1153","DOI":"10.3115\/v1\/d14-1153"},{"key":"12_CR2","unstructured":"Clough, P., Stevenson, M.: Developing a corpus of plagiarised short answers. In: 31, pp. 527\u2013540 (2005)"},{"key":"12_CR3","unstructured":"El Tahir Ali, A.M., Dahwa Abdulla, H.M., Sn\u00e1\u0161el, V.: Overview and comparison of plagiarism detection tools. In: CEUR Workshop Proceedings, vol. 706, pp. 161\u2013172 (2011). ISSN: 16130073"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Folt\u00fdnek, T., et al.: Testing of support tools for plagiarism detection. Int. J. Educ. Technol. High. Educ. 17(1), Article no. 46 (2020). https:\/\/doi.org\/10.1186\/s41239-020-00192-4. arXiv: 2002.04279. ISSN: 23659440","DOI":"10.1186\/s41239-020-00192-4"},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Li, Y., Wu, H.: A clustering method based on k-means algorithm. In: Phys. Procedia 25, 1104\u20131109 (2012). https:\/\/doi.org\/10.1016\/j.phpro.2012.03.206. ISSN: 18753892","DOI":"10.1016\/j.phpro.2012.03.206"},{"key":"12_CR6","unstructured":"Liang, P.: Semi-supervised learning for natural language. In: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science, p. 86 (2005). http:\/\/hdl.handle.net\/1721.1\/33296"},{"key":"12_CR7","unstructured":"Mikolov, T., et al.: Distributed representations of words and phrases and their compositionality. In: Advances in Neural Information Processing Systems, October 2013. arXiv: 1310.4546. ISSN: 10495258"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Pennington, J., Richard, S., Manning, C.: GloVe: global vectors for word representation. Br. J. Neurosurg. 31(6), 682\u2013687 (2017). https:\/\/doi.org\/10.1080\/02688697.2017.1354122. ISSN: 1360046X","DOI":"10.1080\/02688697.2017.1354122"},{"key":"12_CR9","unstructured":"Scanlon, P.M., Neumann, D.R.: Internet plagiarism among college students. J. College Stud. Dev. 43(3), 374\u2013385 (2002). ISSN: 08975264"},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Shafiee, A., Karimi, M.: On the relationship between entropy and information. Phys. Essays 20(3), 487\u2013493 (2007). https:\/\/doi.org\/10.4006\/1.3153419. ISSN: 08361398","DOI":"10.4006\/1.3153419"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Su, Z., et al.: Plagiarism detection using the Levenshtein distance and Smith-Waterman algorithm. In: 3rd International Conference on Innovative Computing Information and Control, ICICIC 2008, pp. 1\u20133 (2008). https:\/\/doi.org\/10.1109\/ICICIC.2008.422","DOI":"10.1109\/ICICIC.2008.422"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Sun, Y., Plato\u0161, J.: High-dimensional text clustering by dimensionality reduction and improved density peak. In: Wireless Communications and Mobile Computing 2020 (2020). https:\/\/doi.org\/10.1155\/2020\/8881112. ISSN: 15308677","DOI":"10.1155\/2020\/8881112"}],"container-title":["Lecture Notes in Computer Science","Advances in Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89820-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,22]],"date-time":"2021-10-22T00:57:42Z","timestamp":1634864262000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89820-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030898199","9783030898205"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89820-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"21 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexican International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"micai2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.micai.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"129","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}