EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-ND 3.0

Course Sequence Recommendation with Course Difficulty Index Using Subset Sum Approximation Algorithms

M. Premalatha, V. Viswanathan

Cybernetics and Information Technologies · 01.09.2019 · 19 (3) · 25-44

DOI: 10.2478/cait-2019-0024 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Cybernetics and Information Technologies, online erschienen am 26.09.2019. Verfasst von M. Premalatha und 1 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 35 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 3.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Choice Based Course Selection (CBCS) allows students to select courses based on their preferred sequence. This preference in selection is normally bounded by constraints set by a university like pre-requisite(s), minimum and maximum number of credits registered per semester. Unplanned course sequence selection affects the performance of the students and may prolong the time to complete the degree. Course Difficulty Index (DI) also contributes to the decline in the performance of the students. To overcome these difficulties, we propose a new Subset Sum Approximation Problem (SSAP) aims to distribute courses to each semester with approximately equal difficulty level using Maximum Prerequisite Weightage (MPW) Algorithm, Difficulty Approximation (DA) algorithm and Adaptive Genetic Algorithm (AGA). The three algorithms have been tested using our university academic dataset and DA algorithm outperforms with 98% accuracy than the MPW and AGA algorithm during course distribution.

Zitieren

APA

Premalatha, M., & Viswanathan, V. (2019). Course Sequence Recommendation with Course Difficulty Index Using Subset Sum Approximation Algorithms. Cybernetics and Information Technologies, 19(3), 25-44. https://doi.org/10.2478/cait-2019-0024

Vancouver

Premalatha M, Viswanathan V. Course Sequence Recommendation with Course Difficulty Index Using Subset Sum Approximation Algorithms. Cybernetics and Information Technologies. 2019;19(3):25-44. doi:10.2478/cait-2019-0024

BibTeX
@article{Premalatha2019,
  author = {Premalatha, M. and Viswanathan, V.},
  title = {Course Sequence Recommendation with Course Difficulty Index Using Subset Sum Approximation Algorithms},
  journal = {Cybernetics and Information Technologies},
  year = {2019},
  volume = {19},
  number = {3},
  pages = {25--44},
  doi = {10.2478/cait-2019-0024}
}
Kostenlos starten →