You Are How You Behave-Spatiotemporal Representation Learning for College Student Academic Achievement
作者机构：School of BusinessNanjing UniversityNanjing 210093China Information Technology Services CenterNanjing UniversityNanjing 210093China School of BusinessRutgers UniversityNewarkNJ 07102U.S.A.
出 版 物：《Journal of Computer Science & Technology》 (计算机科学技术学报（英文版）)
年 卷 期：2020年第35卷第2期
页 面：353-367页
核心收录：
学科分类：0808[工学-电气工程] 08[工学] 081203[工学-计算机应用技术] 0835[工学-软件工程] 0701[理学-数学] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）]
基 金：This work was supported by the National Natural Science Foundation of China under Grant Nos.61773199 and 71732002 the National Key Research and Development Program of China under Grant No.2018YFB1004300.
主 题：academic achievement spatiotemporal trajectory feature engineering student segmentation
摘 要：Scholarships are a reflection of academic achievement for college students.The traditional scholarship assignment is strictly based on final grades and cannot recognize students whose performance trend improves or declines during the semester.This paper develops the Trajectory Mining on Clustering for Scholarship Assignment and Academic Warning(TMS)approach to identify the factors that affect the academic achievement of college students and to provide decision support to help low-performing students attain better performance.Specifically,we first conduct feature engineering to generate a set of features to characterize the lifestyles patterns,learning patterns,and Internet usage patterns of students.We then apply the objective and subjective combined weighted k-means(Wosk-means)algorithm to perform clustering analysis to identify the characteristics of different student groups.Considering the difficulty in obtaining the real global positioning system(GPS)records of students,we apply manually generated spatiotemporal trajectories data to quantify the direction of trajectory deviation with the assistance of the PrefixSpan algorithm to identify low-performing students.The experimental results show that the silhouette coefficient and Calinski-Harabasz index of the Wosk-means algorithm are both approximately 1.5 times to that of the best baseline algorithm,and the sum of the squared error of the Wosk-means algorithm is only the half of the best baseline algorithm.
维普期刊数据库