liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Identifying student stuck states in programmingassignments using machine learning
Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
2014 (English)Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

Intelligent tutors are becoming more popular with the increased use of computersand hand held devices in the education sphere. An area of research isinvestigating how machine learning can be used to improve the precision andfeedback of the tutor. This thesis compares machine learning clustering algorithmswith various distance functions in an attempt to cluster together codesnapshots of students solving a programming task. It investigates whethera general non-problem specific implementation of a distance function canbe used to identify when a student is stuck solving an assignment. Themachine learning algorithms compared are k-medoids, the randomly initializedalgorithm that produces a pre-defined number of clusters and affinitypropagation, a two phase algorithm with dynamic cluster sizes. Distancefunctions tried are based on the Bag of Words approach, lower level APIcalls and a problem specific distance function. This thesis could not find agood algorithm to achieve the sought goal, and lists a number of possibleerror sources linked to the data, preprocessing and algorithm. The methodologyis promising but requires a controlled environment at every level toassure data quality does not detract from the analysis in later stages.

Place, publisher, year, edition, pages
2014. , p. 36
Keywords [en]
education, machine learning, clustering, intelligent tutor
National Category
Computer Engineering
Identifiers
URN: urn:nbn:se:liu:diva-103993ISRN: LIU-IDA/LITH-EX-A--14/003--SEOAI: oai:DiVA.org:liu-103993DiVA, id: diva2:693744
External cooperation
Stanford University
Subject / course
Computer Engineering
Presentation
2014-01-22, Herbert Simon, 16:30 (English)
Supervisors
Examiners
Available from: 2014-02-24 Created: 2014-02-05 Last updated: 2018-01-11Bibliographically approved

Open Access in DiVA

Johan Lindell Thesis(788 kB)258 downloads
File information
File name FULLTEXT01.pdfFile size 788 kBChecksum SHA-512
a9e576e157811766a2db3a8778012aed75f002cec0109c2d8255ae2ee9c11dbb368bdb15ee05d0cd4a7f7c20d3173e2dc3980268b1390209c19a433344ab0517
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Lindell, Johan
By organisation
Department of Computer and Information ScienceThe Institute of Technology
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 258 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 927 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf