Graph semantic similarity-based automatic assessment for programming exercises

This paper proposes an algorithm for the automatic assessment of programming exercises. The algorithm assigns assessment scores based on the program dependency graph structure and the program semantic similarity, but does not actually need to run the student’s program. By calculating the node simila...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Scientific reports Ročník 14; číslo 1; s. 10530 - 14
Hlavní autoři:	Xiang, Chengguan, Wang, Ying, Zhou, Qiyun, Yu, Zhen
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	London Nature Publishing Group UK 08.05.2024 Nature Publishing Group Nature Portfolio
Témata:	639/705/117 639/705/794 Algorithms Artificial intelligence Automatic assessment Automation Big Data Efficiency Humanities and Social Sciences Internet Learning Methods multidisciplinary Program dependency graph Program semantics Programming exercises Programming languages Python Science Science (multidisciplinary) Semantic analysis Semantics Similarity Software Students Teachers Teaching Program dependency graph Similarity Programming exercises Automatic assessment Program semantics
ISSN:	2045-2322, 2045-2322
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	This paper proposes an algorithm for the automatic assessment of programming exercises. The algorithm assigns assessment scores based on the program dependency graph structure and the program semantic similarity, but does not actually need to run the student’s program. By calculating the node similarity between the student’s program and the teacher’s reference programs in terms of structure and program semantics, a similarity matrix is generated and the optimal similarity node path of this matrix is identified. The proposed algorithm achieves improved computational efficiency, with a time complexity of O ( n 2 ) for a graph with n nodes. The experimental results show that the assessment algorithm proposed in this paper is more reliable and accurate than several comparison algorithms, and can be used for scoring programming exercises in C/C++, Java, Python, and other languages.
AbstractList	This paper proposes an algorithm for the automatic assessment of programming exercises. The algorithm assigns assessment scores based on the program dependency graph structure and the program semantic similarity, but does not actually need to run the student's program. By calculating the node similarity between the student's program and the teacher's reference programs in terms of structure and program semantics, a similarity matrix is generated and the optimal similarity node path of this matrix is identified. The proposed algorithm achieves improved computational efficiency, with a time complexity of O ( n 2 ) for a graph with n nodes. The experimental results show that the assessment algorithm proposed in this paper is more reliable and accurate than several comparison algorithms, and can be used for scoring programming exercises in C/C++, Java, Python, and other languages.This paper proposes an algorithm for the automatic assessment of programming exercises. The algorithm assigns assessment scores based on the program dependency graph structure and the program semantic similarity, but does not actually need to run the student's program. By calculating the node similarity between the student's program and the teacher's reference programs in terms of structure and program semantics, a similarity matrix is generated and the optimal similarity node path of this matrix is identified. The proposed algorithm achieves improved computational efficiency, with a time complexity of O ( n 2 ) for a graph with n nodes. The experimental results show that the assessment algorithm proposed in this paper is more reliable and accurate than several comparison algorithms, and can be used for scoring programming exercises in C/C++, Java, Python, and other languages. This paper proposes an algorithm for the automatic assessment of programming exercises. The algorithm assigns assessment scores based on the program dependency graph structure and the program semantic similarity, but does not actually need to run the student’s program. By calculating the node similarity between the student’s program and the teacher’s reference programs in terms of structure and program semantics, a similarity matrix is generated and the optimal similarity node path of this matrix is identified. The proposed algorithm achieves improved computational efficiency, with a time complexity of O(n2) for a graph with n nodes. The experimental results show that the assessment algorithm proposed in this paper is more reliable and accurate than several comparison algorithms, and can be used for scoring programming exercises in C/C++, Java, Python, and other languages. Abstract This paper proposes an algorithm for the automatic assessment of programming exercises. The algorithm assigns assessment scores based on the program dependency graph structure and the program semantic similarity, but does not actually need to run the student’s program. By calculating the node similarity between the student’s program and the teacher’s reference programs in terms of structure and program semantics, a similarity matrix is generated and the optimal similarity node path of this matrix is identified. The proposed algorithm achieves improved computational efficiency, with a time complexity of $$O(n^2)$$ O ( n 2 ) for a graph with n nodes. The experimental results show that the assessment algorithm proposed in this paper is more reliable and accurate than several comparison algorithms, and can be used for scoring programming exercises in C/C++, Java, Python, and other languages. This paper proposes an algorithm for the automatic assessment of programming exercises. The algorithm assigns assessment scores based on the program dependency graph structure and the program semantic similarity, but does not actually need to run the student’s program. By calculating the node similarity between the student’s program and the teacher’s reference programs in terms of structure and program semantics, a similarity matrix is generated and the optimal similarity node path of this matrix is identified. The proposed algorithm achieves improved computational efficiency, with a time complexity of $$O(n^2)$$ O(n2) for a graph with n nodes. The experimental results show that the assessment algorithm proposed in this paper is more reliable and accurate than several comparison algorithms, and can be used for scoring programming exercises in C/C++, Java, Python, and other languages. This paper proposes an algorithm for the automatic assessment of programming exercises. The algorithm assigns assessment scores based on the program dependency graph structure and the program semantic similarity, but does not actually need to run the student's program. By calculating the node similarity between the student's program and the teacher's reference programs in terms of structure and program semantics, a similarity matrix is generated and the optimal similarity node path of this matrix is identified. The proposed algorithm achieves improved computational efficiency, with a time complexity of for a graph with n nodes. The experimental results show that the assessment algorithm proposed in this paper is more reliable and accurate than several comparison algorithms, and can be used for scoring programming exercises in C/C++, Java, Python, and other languages. This paper proposes an algorithm for the automatic assessment of programming exercises. The algorithm assigns assessment scores based on the program dependency graph structure and the program semantic similarity, but does not actually need to run the student’s program. By calculating the node similarity between the student’s program and the teacher’s reference programs in terms of structure and program semantics, a similarity matrix is generated and the optimal similarity node path of this matrix is identified. The proposed algorithm achieves improved computational efficiency, with a time complexity of O ( n 2 ) for a graph with n nodes. The experimental results show that the assessment algorithm proposed in this paper is more reliable and accurate than several comparison algorithms, and can be used for scoring programming exercises in C/C++, Java, Python, and other languages. This paper proposes an algorithm for the automatic assessment of programming exercises. The algorithm assigns assessment scores based on the program dependency graph structure and the program semantic similarity, but does not actually need to run the student’s program. By calculating the node similarity between the student’s program and the teacher’s reference programs in terms of structure and program semantics, a similarity matrix is generated and the optimal similarity node path of this matrix is identified. The proposed algorithm achieves improved computational efficiency, with a time complexity of $$O(n^2)$$ O ( n 2 ) for a graph with n nodes. The experimental results show that the assessment algorithm proposed in this paper is more reliable and accurate than several comparison algorithms, and can be used for scoring programming exercises in C/C++, Java, Python, and other languages.
ArticleNumber	10530
Author	Wang, Ying Yu, Zhen Zhou, Qiyun Xiang, Chengguan
Author_xml	– sequence: 1 givenname: Chengguan surname: Xiang fullname: Xiang, Chengguan organization: Faculty of Artificial Intelligence in Education, Central China Normal University, School of Mathematics and Big Data, Guizhou Education University – sequence: 2 givenname: Ying surname: Wang fullname: Wang, Ying email: wangyingcncc@163.com organization: Faculty of Artificial Intelligence in Education, Central China Normal University – sequence: 3 givenname: Qiyun surname: Zhou fullname: Zhou, Qiyun organization: Faculty of Artificial Intelligence in Education, Central China Normal University – sequence: 4 givenname: Zhen surname: Yu fullname: Yu, Zhen organization: School of Mathematics and Big Data, Guizhou Education University
BackLink	https://www.ncbi.nlm.nih.gov/pubmed/38719952$$D View this record in MEDLINE/PubMed
BookMark	eNp9Ujtv1jAUtVARLaV_gAFFYukS8PUjiSeEKloqVbDAbNnOTepPSfxhJ4j-e5ymhbZDvdjyeejY97wmB1OYkJC3QD8A5c3HJECqpqRMlBUwUGXzghwxKmTJOGMHD86H5CSlHc1LMiVAvSKHvKlBKcmOyLeLaPbXRcLRTLN3RfKjH0z0801pTcK2MMscRrNCJiVMacRpLroQi30MfTTj6Ke-wD8Ync_wG_KyM0PCk7v9mPw8__Lj7Gt59f3i8uzzVemkgLk0lgsnuFICu7qTXAEyVFRgxdC1VkHrKgeqqjukpq2Noo4rCxJdLaEDy4_J5ebbBrPT--hHE290MF7fXoTYaxNz6AG1qlqU1kqBSorGNY1BS3nHrZSIrHPZ69PmtV_siK3LD4xmeGT6GJn8te7Dbw1Q8RxSZIfTO4cYfi2YZj365HAYzIRhSZpTyYFXULFMff-EugtLnPJfrSzGVNXAynr3MNK_LPdzy4RmI7gYUorYaefnPKWwJvSDBqrXluitJTq3RN-2RDdZyp5I792fFfFNlDJ56jH-j_2M6i8WHtCB
CitedBy_id	crossref_primary_10_37394_232010_2025_22_5
Cites_doi	10.1145/3587102.3588829 10.1002/cae.22317 10.1145/1163405.1163409 10.1016/j.infsof.2006.03.001 10.1145/3289600.3290967 10.1016/0360-1315(93)90086-X 10.1109/ICNISC57059.2022.00179 10.11896/j.issn.1002-137X.2018.04.002 10.1016/S0167-8655(97)00179-7 10.1109/ICCCNT56998.2023.10308341 10.1109/ICETCI58599.2023.10331134 10.1109/ICSE-SEET.2019.00022 10.14778/1687627.1687631 10.1145/3486001.3486228 10.1109/ICCSE51940.2021.9569318 10.21125/iceri.2022.1912 10.1145/2623330.2623377 10.5220/0007711000620069 10.1145/364914.364937 10.1109/MIUCC52538.2021.9447629 10.1109/INNOVATIONS.2011.5893842 10.1016/j.physa.2017.09.042 10.1080/10494820.2021.2006237 10.1109/ICCCI54379.2022.9740769 10.1145/65294.71198 10.3390/su11205568 10.1145/353519.343160 10.13328/j.cnki.jos.006323 10.5555/979968.980011 10.1109/ITSIM.2010.5561488 10.1007/978-981-13-6459-4_6 10.1109/STAIR.2011.5995769 10.1109/CIST.2016.7805112 10.1145/3587102.3588822 10.1109/EDUCON46332.2021.9453889 10.1007/978-3-319-61425-0_14 10.1145/1122018.1122050 10.13334/j.0258-8013.pcsee.191338
ContentType	Journal Article
Copyright	The Author(s) 2024 2024. The Author(s). Copyright Nature Publishing Group 2024 The Author(s) 2024 2024
Copyright_xml	– notice: The Author(s) 2024 – notice: 2024. The Author(s). – notice: Copyright Nature Publishing Group 2024 – notice: The Author(s) 2024 2024
DBID	C6C AAYXX CITATION NPM 3V. 7X7 7XB 88A 88E 88I 8FE 8FH 8FI 8FJ 8FK ABUWG AEUYN AFKRA AZQEC BBNVY BENPR BHPHI CCPQU DWQXO FYUFA GHDGH GNUQQ HCIFZ K9. LK8 M0S M1P M2P M7P PHGZM PHGZT PIMPY PJZUB PKEHL PPXIY PQEST PQGLB PQQKQ PQUKI PRINS Q9U 7X8 5PM DOA
DOI	10.1038/s41598-024-61219-8
DatabaseName	Springer Nature OA Free Journals CrossRef PubMed ProQuest Central (Corporate) Health & Medical Collection ProQuest Central (purchase pre-March 2016) Biology Database (Alumni Edition) Medical Database (Alumni Edition) Science Database (Alumni Edition) ProQuest SciTech Collection ProQuest Natural Science Collection Hospital Premium Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) One Sustainability ProQuest Central UK/Ireland ProQuest Central Essentials Biological Science Database ProQuest Central Natural Science Collection ProQuest One Community College ProQuest Central Korea Health Research Premium Collection Health Research Premium Collection (Alumni) ProQuest Central Student SciTech Premium Collection ProQuest Health & Medical Complete (Alumni) ProQuest Biological Science Collection Health & Medical Collection (Alumni Edition) PML(ProQuest Medical Library) Science Database Biological Science Database ProQuest Central Premium ProQuest One Academic (New) Publicly Available Content Database ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) One Health & Nursing ProQuest One Academic Eastern Edition (DO NOT USE) One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China ProQuest Central Basic MEDLINE - Academic PubMed Central (Full Participant titles) DOAJ Directory of Open Access Journals
DatabaseTitle	CrossRef PubMed Publicly Available Content Database ProQuest Central Student ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest One Health & Nursing ProQuest Natural Science Collection ProQuest Central China ProQuest Biology Journals (Alumni Edition) ProQuest Central ProQuest One Applied & Life Sciences ProQuest One Sustainability ProQuest Health & Medical Research Collection Health Research Premium Collection Health and Medicine Complete (Alumni Edition) Natural Science Collection ProQuest Central Korea Health & Medical Research Collection Biological Science Collection ProQuest Central (New) ProQuest Medical Library (Alumni) ProQuest Science Journals (Alumni Edition) ProQuest Biological Science Collection ProQuest Central Basic ProQuest Science Journals ProQuest One Academic Eastern Edition ProQuest Hospital Collection Health Research Premium Collection (Alumni) Biological Science Database ProQuest SciTech Collection ProQuest Hospital Collection (Alumni) ProQuest Health & Medical Complete ProQuest Medical Library ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) MEDLINE - Academic
DatabaseTitleList	MEDLINE - Academic Publicly Available Content Database PubMed CrossRef
Database_xml	– sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 3 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Biology
EISSN	2045-2322
EndPage	14
ExternalDocumentID	oai_doaj_org_article_96de5bb54e9548c88aeb03f3b55ee2fc PMC11631964 38719952 10_1038_s41598_024_61219_8
Genre	Journal Article
GrantInformation_xml	– fundername: Guizhou Science and Technology Department grantid: QianKeHeJiChu-ZK[2021]YiBan 309 funderid: http://dx.doi.org/10.13039/501100004001 – fundername: Youth Program of the Education Foundation of Guizhou Province grantid: QianJiaoHeKYZi[2021]248 – fundername: Guizhou Science and Technology Department grantid: QianKeHeJiChu-ZK[2021]YiBan 309
GroupedDBID	0R~ 4.4 53G 5VS 7X7 88E 88I 8FE 8FH 8FI 8FJ AAFWJ AAJSJ AAKDD AASML ABDBF ABUWG ACGFS ACUHS ADBBV ADRAZ AENEX AEUYN AFKRA AFPKN ALIPV ALMA_UNASSIGNED_HOLDINGS AOIJS AZQEC BAWUL BBNVY BCNDV BENPR BHPHI BPHCQ BVXVI C6C CCPQU DIK DWQXO EBD EBLON EBS ESX FYUFA GNUQQ GROUPED_DOAJ GX1 HCIFZ HH5 HMCUK HYE KQ8 LK8 M1P M2P M48 M7P M~E NAO OK1 PHGZM PHGZT PIMPY PQQKQ PROAC PSQYO RNT RNTTT RPM SNYQT UKHRP AAYXX AFFHD CITATION PJZUB PPXIY PQGLB 3V. 88A ACSMW AJTQC M0L NPM 7XB 8FK K9. PKEHL PQEST PQUKI PRINS Q9U 7X8 5PM
ID	FETCH-LOGICAL-c541t-ab34c43994ef7f5391e2e904e62ecdb91dc6c1967fe0ad7a90c39b15ec751f1b3
IEDL.DBID	DOA
ISICitedReferencesCount	2
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001216508100043&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	2045-2322
IngestDate	Mon Nov 10 04:32:22 EST 2025 Tue Nov 04 02:05:00 EST 2025 Sun Nov 09 09:54:30 EST 2025 Tue Oct 07 07:57:42 EDT 2025 Wed Feb 19 02:17:51 EST 2025 Tue Nov 18 22:20:28 EST 2025 Sat Nov 29 02:13:00 EST 2025 Thu May 22 04:32:28 EDT 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	Program dependency graph Similarity Programming exercises Automatic assessment Program semantics
Language	English
License	2024. The Author(s). Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c541t-ab34c43994ef7f5391e2e904e62ecdb91dc6c1967fe0ad7a90c39b15ec751f1b3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23
OpenAccessLink	https://doaj.org/article/96de5bb54e9548c88aeb03f3b55ee2fc
PMID	38719952
PQID	3052296812
PQPubID	2041939
PageCount	14
ParticipantIDs	doaj_primary_oai_doaj_org_article_96de5bb54e9548c88aeb03f3b55ee2fc pubmedcentral_primary_oai_pubmedcentral_nih_gov_11631964 proquest_miscellaneous_3053136162 proquest_journals_3052296812 pubmed_primary_38719952 crossref_citationtrail_10_1038_s41598_024_61219_8 crossref_primary_10_1038_s41598_024_61219_8 springer_journals_10_1038_s41598_024_61219_8
PublicationCentury	2000
PublicationDate	2024-05-08
PublicationDateYYYYMMDD	2024-05-08
PublicationDate_xml	– month: 05 year: 2024 text: 2024-05-08 day: 08
PublicationDecade	2020
PublicationPlace	London
PublicationPlace_xml	– name: London – name: England
PublicationTitle	Scientific reports
PublicationTitleAbbrev	Sci Rep
PublicationTitleAlternate	Sci Rep
PublicationYear	2024
Publisher	Nature Publishing Group UK Nature Publishing Group Nature Portfolio
Publisher_xml	– name: Nature Publishing Group UK – name: Nature Publishing Group – name: Nature Portfolio
References	61219_CR7 61219_CR9 61219_CR4 L-C Cheng (61219_CR6) 2021 61219_CR30 D Jackson (61219_CR31) 2000; 32 61219_CR2 61219_CR11 61219_CR33 61219_CR10 61219_CR32 61219_CR13 61219_CR35 61219_CR12 61219_CR34 61219_CR15 61219_CR37 Sara (61219_CR5) 2018; 13 61219_CR14 61219_CR36 61219_CR17 KA Reek (61219_CR26) 1989; 21 61219_CR39 61219_CR16 61219_CR38 61219_CR19 61219_CR18 T Wang (61219_CR3) 2007; 49 A Gordillo (61219_CR1) 2019 Q Zhang (61219_CR42) 2018; 491 P Delgado-Pérez (61219_CR8) 2020; 28 61219_CR40 61219_CR20 61219_CR41 61219_CR22 61219_CR21 S-L Hung (61219_CR25) 1993; 20 61219_CR28 61219_CR27 61219_CR29 GE Forsythe (61219_CR23) 1965; 8 C Douce (61219_CR24) 2005; 5
References_xml	– ident: 61219_CR9 doi: 10.1145/3587102.3588829 – volume: 28 start-page: 1449 year: 2020 ident: 61219_CR8 publication-title: Comput. Appl. Eng. Educ. doi: 10.1002/cae.22317 – volume: 5 start-page: 4 year: 2005 ident: 61219_CR24 publication-title: J. Educ. Resour. Comput. doi: 10.1145/1163405.1163409 – volume: 49 start-page: 99 year: 2007 ident: 61219_CR3 publication-title: Inf. Softw. Technol. doi: 10.1016/j.infsof.2006.03.001 – ident: 61219_CR15 doi: 10.1145/3289600.3290967 – volume: 20 start-page: 183 year: 1993 ident: 61219_CR25 publication-title: Comput. Educ. doi: 10.1016/0360-1315(93)90086-X – ident: 61219_CR34 doi: 10.1109/ICNISC57059.2022.00179 – ident: 61219_CR37 doi: 10.11896/j.issn.1002-137X.2018.04.002 – ident: 61219_CR38 doi: 10.1016/S0167-8655(97)00179-7 – ident: 61219_CR22 doi: 10.1109/ICCCNT56998.2023.10308341 – ident: 61219_CR11 doi: 10.1109/ICETCI58599.2023.10331134 – ident: 61219_CR2 doi: 10.1109/ICSE-SEET.2019.00022 – ident: 61219_CR39 doi: 10.14778/1687627.1687631 – ident: 61219_CR13 doi: 10.1145/3486001.3486228 – ident: 61219_CR7 doi: 10.1109/ICCSE51940.2021.9569318 – ident: 61219_CR30 doi: 10.21125/iceri.2022.1912 – ident: 61219_CR17 doi: 10.1145/2623330.2623377 – ident: 61219_CR19 doi: 10.5220/0007711000620069 – volume: 8 start-page: 275 year: 1965 ident: 61219_CR23 publication-title: Commun. ACM doi: 10.1145/364914.364937 – volume: 13 start-page: 1963 year: 2018 ident: 61219_CR5 publication-title: Int. J. Appl. Eng. Res. – ident: 61219_CR20 doi: 10.1109/MIUCC52538.2021.9447629 – ident: 61219_CR35 doi: 10.1109/INNOVATIONS.2011.5893842 – volume: 491 start-page: 749 year: 2018 ident: 61219_CR42 publication-title: Phys. A Stat. Mech. Appl. doi: 10.1016/j.physa.2017.09.042 – year: 2021 ident: 61219_CR6 publication-title: Interact. Learn. Environ. doi: 10.1080/10494820.2021.2006237 – ident: 61219_CR27 – ident: 61219_CR41 – ident: 61219_CR29 doi: 10.1109/ICCCI54379.2022.9740769 – volume: 21 start-page: 112 year: 1989 ident: 61219_CR26 publication-title: SIGCSE Bull. doi: 10.1145/65294.71198 – year: 2019 ident: 61219_CR1 publication-title: Sustainability doi: 10.3390/su11205568 – volume: 32 start-page: 164 year: 2000 ident: 61219_CR31 publication-title: SIGCSE Bull. doi: 10.1145/353519.343160 – ident: 61219_CR36 doi: 10.13328/j.cnki.jos.006323 – ident: 61219_CR21 doi: 10.1145/2623330.2623377 – ident: 61219_CR32 doi: 10.5555/979968.980011 – ident: 61219_CR33 doi: 10.1109/ITSIM.2010.5561488 – ident: 61219_CR12 doi: 10.1007/978-981-13-6459-4_6 – ident: 61219_CR10 doi: 10.1109/STAIR.2011.5995769 – ident: 61219_CR14 doi: 10.1109/CIST.2016.7805112 – ident: 61219_CR16 doi: 10.1145/3587102.3588822 – ident: 61219_CR4 doi: 10.1109/EDUCON46332.2021.9453889 – ident: 61219_CR18 doi: 10.1007/978-3-319-61425-0_14 – ident: 61219_CR28 doi: 10.1145/1122018.1122050 – ident: 61219_CR40 doi: 10.13334/j.0258-8013.pcsee.191338
SSID	ssj0000529419
Score	2.431053
Snippet	This paper proposes an algorithm for the automatic assessment of programming exercises. The algorithm assigns assessment scores based on the program dependency... Abstract This paper proposes an algorithm for the automatic assessment of programming exercises. The algorithm assigns assessment scores based on the program...
SourceID	doaj pubmedcentral proquest pubmed crossref springer
SourceType	Open Website Open Access Repository Aggregation Database Index Database Enrichment Source Publisher
StartPage	10530
SubjectTerms	639/705/117 639/705/794 Algorithms Artificial intelligence Automatic assessment Automation Big Data Efficiency Humanities and Social Sciences Internet Learning Methods multidisciplinary Program dependency graph Program semantics Programming exercises Programming languages Python Science Science (multidisciplinary) Semantic analysis Semantics Similarity Software Students Teachers Teaching
SummonAdditionalLinks	– databaseName: Science Database dbid: M2P link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwELaggMSFNzRQUJC4gdX4ldgnBIjCAVY9AOrNsp0xRGI37WYXiX-P7TiplkcvXGNHGvubscee8TcIPfNKcAJSYMs4x5xwj2VNPObcCNNY55v0fOzLh2axkCcn6jhfuA05rXJaE9NC3fYu3pEfBr2kVEW2rJenZzhWjYrR1VxC4zK6EjwbElO6PtLj-Y4lRrE4UfmtTMXk4RD2q_imjHIcqbMUljv7UaLt_5uv-WfK5G9x07QdHd3834HcQjeyI1q-GjXnNroEqzvo2lia8uddtHgXmazLAZZh6jtXDt2yC4fg4LPjuPG1pdlu-kT3WpqZ3LMMHnCZM76WQexyKug03EOfj95-evMe59oL2AXwNtgE7Fw8q3DwjRdMEaCgKg41BddaRVpXu2C9jYfKtI1RlWPKEgGuEcQTy-6jvVW_gn1U8lZ4Q5OrwXhlgwqIyhtH26YG0VJRIDIhoF0mJo_1Mb7rFCBnUo-o6YCaTqhpWaDn8z-nIy3Hhb1fR2DnnpFSO33o1191tlCt6haEtYJD5MBzUhqwFfPMCgFAvSvQwYSnznY-6HMwC_R0bg4WGsMuZgX9NvVhhNWkDn0ejFo0S8LCeVUpEVrkjn7tiLrbsuq-JRZwEjzpyKZWoBeTKp7L9e-5eHjxMB6h6zRaR0zplAdob7PewmN01f3YdMP6STKvX0C8LSU priority: 102 providerName: ProQuest
Title	Graph semantic similarity-based automatic assessment for programming exercises
URI	https://link.springer.com/article/10.1038/s41598-024-61219-8 https://www.ncbi.nlm.nih.gov/pubmed/38719952 https://www.proquest.com/docview/3052296812 https://www.proquest.com/docview/3053136162 https://pubmed.ncbi.nlm.nih.gov/PMC11631964 https://doaj.org/article/96de5bb54e9548c88aeb03f3b55ee2fc
Volume	14
WOSCitedRecordID	wos001216508100043&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: DOA dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: M~E dateStart: 20110101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Biological Science Database customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: M7P dateStart: 20110101 isFulltext: true titleUrlDefault: http://search.proquest.com/biologicalscijournals providerName: ProQuest – providerCode: PRVPQU databaseName: Health & Medical Collection customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: 7X7 dateStart: 20110101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: BENPR dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: PIMPY dateStart: 20110101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest – providerCode: PRVPQU databaseName: Science Database customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: M2P dateStart: 20110101 isFulltext: true titleUrlDefault: https://search.proquest.com/sciencejournals providerName: ProQuest
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9QwELagBakXxJtAWQWJG1iNX7F9pKgFJLqKEKDlZDmOLSKx2arZReLfM3ayocvzwmUO8UQZfZ6Jx_L4G4SeBi048UrgmnGOOeEBq5IEzLkVVtYuyHR97ONbOZ-rxUJXl1p9xZqwgR54AO5Il40XdS24j9RkTinr64IFVgvhPQ0u_n0LqS9tpgZWb6o50eMtmYKpox5WqnibjHIcSbM0VjsrUSLs_12W-Wux5E8npmkhOr2JbowZZP5isPwWuuK72-j60FPy2x00fxUpqPPeLwGz1uV9u2xh9wrJNo4rVpPbzXqVeFpzO7Fy5pC65mOp1hK-mm87MfV30YfTk_cvX-OxaQJ2gPoaWwDdxU0G90EGwTTx1OuC-5J619SaNK50EHYy-MI20urCMV0T4Z0UJJCa3UN73arzD1DOGxEsTTkC40UNcyeKYB1tZOlFQ0WGyBZA40ZG8djY4otJJ9tMmQF0A6CbBLpRGXo2vXM-8Gn8Vfs4zsukGbmw0wPwEDN6iPmXh2TocDurZgzQ3sBvjlIdydcy9GQahtCK5yW286tN0mGElaQEnfuDE0yWMNhoai1gRO24x46puyNd-znRdxNIgSMNWoaebz3ph11_xuLh_8DiETqgMQRixaY6RHvri41_jK65r-u2v5ihq3Ihk1QztH98Mq_ezVJcgTyjVZQS5H715qz69B1Enyd8
linkProvider	Directory of Open Access Journals
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VAoIL70egQJDgRK3Gr8Q-IMSrtOqy6qGg3ozj2LASmy2bXVD_FL8R23lUy6O3HrjGTjSxP49nPONvAJ44yRm2gqOSMoYYZg6JHDvEmOa6KI0r4vWxj6NiPBaHh3J_DX72d2FCWmWvE6OirmYmnJFveVwSIgNb1oujbyhUjQrR1b6ERguLPXv8w7tszfPdN35-nxKy_fbg9Q7qqgog48VaIO2lMsEKZ9YVjlOJLbEyYzYn1lSlxJXJjcdl4Wymq0LLzFBZYm5NwbHDJfXfPQfnWWAWC6mCZH840wlRM4Zldzcno2Kr8ftjuMNGGApUXRKJlf0vlgn4m237Z4rmb3HauP1tX_3fBu4aXOkM7fRluzKuw5qtb8DFtvTm8U0YvwtM3Wljpx5aE5M2k-nEO_neJ0FhY69SvVzMIp1tqgfy0tRb-GmX0Tb1w5T2BauaW_DhTH7mNqzXs9rehZRV3GkSTSnKstJDnGdOG1IVueUV4QngfsaV6YjXQ_2PryomAFChWpQojxIVUaJEAs-Gd45a2pFTe78KQBp6Bsrw-GA2_6w6DaRkXllelpzZwPFnhNC2zKijJefWEmcS2Ojxozo91qgT8CTweGj2GiiElXRtZ8vYh2Ka49z3udOidpCEen9cSu5bxAqeV0RdbaknXyLLOfaeQmCLS2Czh_6JXP8ei3un_8YjuLRz8H6kRrvjvftwmYSVGdJXxQasL-ZL-wAumO-LSTN_GJd2Cp_Oekn8Al9pi4c
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lj9MwELaWLiAuvB-FBYIEJ7AavxL7gBCwFKpdqh4ALSfjODZUou3StKD9a_w6xs5jVR572wPX2Ikm9jfjGXv8DUIPvRKcOClwwTjHnHCPZUY85twIkxfW5_H62If9fDyWBwdqsoV-tndhQlplaxOjoS4XNuyRDwCXlKrAljXwTVrEZHf47PAbDhWkwklrW06jhsieO_oB4Vv1dLQLc_2I0uGrdy_f4KbCALYg4gobkNAGj5w7n3vBFHHUqZS7jDpbFoqUNrOA0dy71JS5UallqiDC2VwQTwoG3z2DtsEl57SHtiejt5OP3Q5POEPjRDU3dVImBxWsluFGG-U4EHcpLDdWw1g04G-e7p8Jm7-d2sbFcHjpfx7Gy-hi44Inz2uduYK23PwqOlcX5Ty6hsavA4d3UrkZgG5qk2o6m0L4D9EKDkt-mZj1ahGJbhPT0Zom4PsnTa7bDIYsaUtZVdfR-1P5mRuoN1_M3S2U8FJ4Q6OTxXhaAPhF6o2lZZ45UVLRR6SdfW0bSvZQGeSrjqkBTOoaMRoQoyNitOyjx907hzUhyYm9XwRQdT0DmXh8sFh-1o1t0iornSgKwV1g_7NSGlekzLNCCOeot32002JJNxau0sdA6qMHXTPYpnDgZOZusY59GGEZyaDPzRrBnSQMInWlBLTIDWxviLrZMp9-ifznBGKIwCPXR09aNTiW699jcfvk37iPzoMm6P3ReO8OukCDkoa8VrmDeqvl2t1FZ-331bRa3mv0PEGfTlsnfgFFoZXQ
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Graph+semantic+similarity-based+automatic+assessment+for+programming+exercises&rft.jtitle=Scientific+reports&rft.au=Xiang%2C+Chengguan&rft.au=Wang%2C+Ying&rft.au=Zhou%2C+Qiyun&rft.au=Yu%2C+Zhen&rft.date=2024-05-08&rft.eissn=2045-2322&rft.volume=14&rft.issue=1&rft.spage=10530&rft_id=info:doi/10.1038%2Fs41598-024-61219-8&rft_id=info%3Apmid%2F38719952&rft.externalDocID=38719952
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2045-2322&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2045-2322&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2045-2322&client=summon