Personalizing education with algorithmic course selection

The work presented in this thesis utilizes context-aware recommendation to facilitate personalized education and assist students in selecting courses (or in non-traditional curricula, topics or modules) that meet curricular requirements, leverage their skills and background, and are relevant to their interests. The original research contribution of this thesis is an algorithm that can generate a schedule of courses with consideration of a student\u27s profile, minimization of cost, and complete adherence to institution requirements. The research problem at hand - a constrained optimization problem with potentially conflicting objectives - is solved by first identifying a minimal sets of courses a student can take to graduate and then intelligently placing the selected courses into available semesters. The distinction between the proposed approach and related studies is in its simultaneous achievement of the following: guaranteed fulfillment of curricular requirements; applicability to both traditional and non-traditional curricula; and flexibility in nomenclature - semantics are extracted from syntax to allow the identification of relevant content, despite differences in course or topic titles from one institution to the next. The course selection algorithm presented is developed for the Pervasive Cyberinfrastructure for Personalized eLearning and Instructional Support (PERCEPOLIS), which can assist or supplement the degree planning actions of an academic advisor, with the assurance that recommended selections are always valid. With this algorithm, PERCEPOLIS can recommend the entire trajectory that a student could take to graduation, as opposed to just the next semester, and it does so with consideration of course or topic availability --Abstract, page iii

Algorithms and Techniques for Proactive Search

While search engines have demonstrated improvements in both speed and accuracy, their response time is prohibitively long for applications that require immediate and accurate responses to search queries. Examples include identification of multimedia resources related to the subject matter of a particular class, as it is in session. This paper begins with a survey of collaborative recommendation and prediction algorithms, each of which applies a different method to predict future search engine usage based on the past history of a search engine user. To address the shortcomings identified in existing techniques, we propose a proactive search approach that identifies resources likely to be of interest to the user without requiring a query. The approach is contingent on accurate determination of similarity, which we achieve with local alignment and output-based refinement of similarity neighborhoods. We demonstrate our proposed approach with trials on real-world search engine data. The results support our hypothesis that a majority of users exhibit search engine usage behavior that is predictable, allowing a proactive search engine to bypass the common query-response model and immediately deliver a list of resources of interest to the user