Will this Course Increase or Decrease Your GPA? Towards Grade-aware Course Recommendation

In order to help undergraduate students towards successfully completing their degrees, developing tools that can assist students during the course selection process is a significant task in the education domain. The optimal set of courses for each student should include courses that help him/her gra...

Full description

Saved in:
Bibliographic Details
Published inJournal of educational data mining Vol. 11; no. 2; pp. 20 - 46
Main Authors Morsy, Sara, Karypis, George
Format Journal Article
LanguageEnglish
Published International Educational Data Mining 01.09.2019
Subjects
Online AccessGet full text

Cover

Loading…
Abstract In order to help undergraduate students towards successfully completing their degrees, developing tools that can assist students during the course selection process is a significant task in the education domain. The optimal set of courses for each student should include courses that help him/her graduate in a timely fashion and for which he/she is well-prepared for so as to get a good grade in. To this end, we propose two different grade-aware course recommendation approaches to recommend to each student his/her optimal set of courses. The first approach ranks the courses by using an objective function that differentiates between courses that are expected to increase or decrease a student's GPA. The second approach combines the grades predicted by grade prediction methods with the rankings produced by course recommendation methods to improve the final course rankings. To obtain the course rankings in the first approach, we adapt two widely-used representation learning techniques to learn the optimal temporal ordering between courses. Our experiments on a large dataset obtained from the University of Minnesota that includes students from 23 different majors show that the grade-aware course recommendation methods can do better on recommending more courses in which the students are expected to perform well and recommending fewer courses in which they are expected not to perform well in than grade-unaware course recommendation methods.
AbstractList In order to help undergraduate students towards successfully completing their degrees, developing tools that can assist students during the course selection process is a significant task in the education domain. The optimal set of courses for each student should include courses that help him/her graduate in a timely fashion and for which he/she is well-prepared for so as to get a good grade in. To this end, we propose two different "grade-aware course recommendation" approaches to recommend to each student his/her optimal set of courses. The first approach ranks the courses by using an objective function that differentiates between courses that are expected to increase or decrease a student's GPA. The second approach combines the grades predicted by grade prediction methods with the rankings produced by course recommendation methods to improve the final course rankings. To obtain the course rankings in both approaches, we adapt two widely-used representation learning techniques to learn the optimal temporal ordering between courses. Our experiments on a large dataset obtained from the University of Minnesota that includes students from 23 different majors show that the grade-aware course recommendation methods can do better on recommending more courses in which the students are expected to perform well and recommending fewer courses which they are expected not to perform well in than grade-unaware course recommendation methods.
In order to help undergraduate students towards successfully completing their degrees, developing tools that can assist students during the course selection process is a significant task in the education domain. The optimal set of courses for each student should include courses that help him/her graduate in a timely fashion and for which he/she is well-prepared for so as to get a good grade in. To this end, we propose two different grade-aware course recommendation approaches to recommend to each student his/her optimal set of courses. The first approach ranks the courses by using an objective function that differentiates between courses that are expected to increase or decrease a student's GPA. The second approach combines the grades predicted by grade prediction methods with the rankings produced by course recommendation methods to improve the final course rankings. To obtain the course rankings in the first approach, we adapt two widely-used representation learning techniques to learn the optimal temporal ordering between courses. Our experiments on a large dataset obtained from the University of Minnesota that includes students from 23 different majors show that the grade-aware course recommendation methods can do better on recommending more courses in which the students are expected to perform well and recommending fewer courses in which they are expected not to perform well in than grade-unaware course recommendation methods.
Audience Higher Education
Postsecondary Education
Author Morsy, Sara
Karypis, George
Author_xml – sequence: 1
  givenname: Sara
  surname: Morsy
  fullname: Morsy, Sara
– sequence: 2
  givenname: George
  surname: Karypis
  fullname: Karypis, George
BackLink https://doi.org/10.48550/arXiv.1904.11798$$DView paper in arXiv
http://eric.ed.gov/ERICWebPortal/detail?accno=EJ1230292$$DView record in ERIC
BookMark eNpNkNtKAzEQhoNUsNY-gBdiXmBrjs3mSkqttVJQpCK9WmaTCa7sQbL19PaubRXnZr7hm5mL_5j06qZGQk45G6lUa3YB8bN4H3HL1IhzY9MD0hdcm0Rwxnr_-IgM2_aFdaWVsSbtk_VTUZZ081y0dNq8xRbponYRoYMm0ivc87pzdH4_uaSr5gOib-k8gscEugF_Lx_QNVWFtYdN0dQn5DBA2eJw3wfk8Xq2mt4ky7v5YjpZJsD5eJOEMWgZAkPBwVnrLEodBMsdU8YHnyOA8FxJCSbkPDd56lLmgpdach2UkgNytvuLsXDZaywqiF_Z7JYLyYQVnT_f-W1Ifws_YWXbsOQ3pTRfrw
ContentType Journal Article
Copyright http://arxiv.org/licenses/nonexclusive-distrib/1.0
Copyright_xml – notice: http://arxiv.org/licenses/nonexclusive-distrib/1.0
DBID AKY
EPD
GOX
ERI
GA5
DOI 10.48550/arxiv.1904.11798
DatabaseName arXiv Computer Science
arXiv Statistics
arXiv.org
ERIC
ERIC - Full Text Only (Discovery)
DatabaseTitle ERIC
DatabaseTitleList ERIC

Database_xml – sequence: 1
  dbid: GOX
  name: arXiv.org
  url: http://arxiv.org/find
  sourceTypes: Open Access Repository
– sequence: 2
  dbid: ERI
  name: ERIC
  url: https://eric.ed.gov/
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
Discipline Education
EISSN 2157-2100
ERIC EJ1230292
ExternalDocumentID EJ1230292
1904_11798
GeographicLocations Minnesota
GeographicLocations_xml – name: Minnesota
GroupedDBID AKY
EPD
GOX
AAHSB
ABOPQ
ALMA_UNASSIGNED_HOLDINGS
ERI
FRS
GA5
OK1
ID FETCH-LOGICAL-a116t-f6a53ff0e21ac99c9e35f20bc047dfdbeaa2d1433a7fb1b7b8c80cfd35315f443
IEDL.DBID ERI
ISSN 2157-2100
IngestDate Tue Sep 02 19:07:54 EDT 2025
Tue Jul 22 23:10:01 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a116t-f6a53ff0e21ac99c9e35f20bc047dfdbeaa2d1433a7fb1b7b8c80cfd35315f443
OpenAccessLink http://eric.ed.gov/ERICWebPortal/detail?accno=EJ1230292
PageCount 27
ParticipantIDs eric_primary_EJ1230292
arxiv_primary_1904_11798
PublicationCentury 2000
PublicationDate 2019-09-00
PublicationDateYYYYMMDD 2019-09-01
PublicationDate_xml – month: 09
  year: 2019
  text: 2019-09-00
PublicationDecade 2010
PublicationTitle Journal of educational data mining
PublicationYear 2019
Publisher International Educational Data Mining
Publisher_xml – name: International Educational Data Mining
SSID ssj0000547978
Score 2.1794977
SecondaryResourceType preprint
Snippet In order to help undergraduate students towards successfully completing their degrees, developing tools that can assist students during the course selection...
In order to help undergraduate students towards successfully completing their degrees, developing tools that can assist students during the course selection...
SourceID eric
arxiv
SourceType Open Access Repository
StartPage 20
SubjectTerms Accuracy
Computer Science - Information Retrieval
Computer Science - Learning
Course Content
Course Selection (Students)
Difficulty Level
Educational Benefits
Grade Point Average
Majors (Students)
Prediction
Program Effectiveness
Statistics - Machine Learning
Undergraduate Students
SummonAdditionalLinks – databaseName: arXiv.org
  dbid: GOX
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwdV07T0IxFG6AycVolICvdHBtvH1x6WSIwiUM6gAJTqSP08QBMBc0_nzb3qIubn2d5TQn39f26zkI3XIvQTLjSER3IkpJiWFGEAWWBkAyCnwSyD4NpgsxW8plC-HDXxhdf719NvmBze4uoJWIz4pq2EZtxqJkq3peNo-TKRVXXv-7LnDMNJTly3-wYnKCjjPJw6NmV05RCzZn6DVebeBY_xfHQnE7wCE2oyQc8LbGj5DbIfxqXL2M7vE8KVp3uKq1A6JDBw6W8dC4XkMuiHSOFpPx_GFKcmEDoikd7IkfaMm9L4BRbZWyCrj0rDC2EKXzzoDWzAUiw3XpDTWlGdphYb3jIWCkF4J3UWez3UAPYV76wCjAc-2pcFoYWmhbWmejiTKmj3rJH6v3JnnFKrpqlVzVR93oop-Z8SygWMEUu_jf5hIdBcaQRVZXqLOvP-A6oPLe3KSt-QaJEY0m
  priority: 102
  providerName: Cornell University
Title Will this Course Increase or Decrease Your GPA? Towards Grade-aware Course Recommendation
URI https://arxiv.org/abs/1904.11798
http://eric.ed.gov/ERICWebPortal/detail?accno=EJ1230292
Volume 11
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LTwIxEG6UC16MLwK-0oPX6na3S-nJEBUIB_UAyXoifUwjB8AsSPz5TpeKXEy8NNs03cM0M9837ZcZQm4yn0OeGscCujMhc85MagRTYDkCklHgK4Hsc3swFsMiL36vLv6rqBxiwE1ShbF3H11uJ-vZlPQWUlUxGPFMMkxq4ntmVb3rTpfFdH2LQCjCi6Xq1El9-z-kqLr8mq6j-nkHanpH5DByRNrdHOox2YP5SWivHKUYp-Qt3JLQ0ft0SUPPuSVQdPOgLge6KOkjxG_05JL2X7v3dFSJY5e0X2oHrIsT-NkZ8s_ZDGJvpTMy7j2NHgYs9khgmvP2ivm2zjPvE0i5tkpZBVnu08TYREjnnQGtU4ecKNPSG26k6dhOYr3L0PdyL0TWILX5Yg5NQjPpkZyAz7TnwmlheKKttM6GLcqYFmlWtpl8bOpgTIIJJ5UJW6QRzLVd2drz_K-FC3KA1COqtS5JbVV-whXC-8pcV4eJY_-l-AbVIKBT
linkProvider ERIC Clearinghouse on Information & Technology
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=Will+this+Course+Increase+or+Decrease+Your+GPA%3F+Towards+Grade-aware+Course+Recommendation&rft.au=Morsy%2C+Sara&rft.au=Karypis%2C+George&rft.date=2019-09-01&rft_id=info:doi/10.48550%2Farxiv.1904.11798&rft.externalDocID=1904_11798
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2157-2100&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2157-2100&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2157-2100&client=summon