This study employs advanced data mining techniques to investigate the DASS-42 questionnaire, a widely used psychological assessment tool. Administered to 680 students at Necmettin Erbakan University's Ahmet Kelesoglu Faculty of Education, the DASS-42 comprises three distinct subscales--depression, anxiety and stress--each consisting of 14 items.…

The rapid development of artificial intelligence has driven the transformation of educational evaluation into big data-driven. This study used a systematic literature review method to analyzed 44 empirical research articles on the evaluation of big data education. Firstly, it has shown an increasing trend year by year, and is mainly published in…

In this paper, a key node mining algorithm of entropy-CRITIC combined weighted GRA-TOPSIS method is proposed, which is based on the network structure features. First, the method obtained multi-dimensional data of students' identities, seating relationships, social relationships, and so on to build a database. Then, the seating similarity among…

In recent years, China has accelerated the process of internationalization and made more and more achievements in transnational communication and cooperation. English learning is very important for contemporary college students. And English reading is an important means to acquire English language knowledge, understand external information and…

With the growing attention on large-scale educational testing and assessment, the ability to process substantial volumes of response data becomes crucial. Current estimation methods within item response theory (IRT), despite their high precision, often pose considerable computational burdens with large-scale data, leading to reduced computational…

Purpose: The paper aims to present a new two stage local causal learning algorithm -- HEISA. In the first stage, the algorithm discoveries the subset of features that better explains a target variable. During the second stage, computes the causal effect, using partial correlation, of each feature of the selected subset. Using this new algorithm,…

The intent of this paper is to generalize the min and max clustering procedures in such a way that the assumption of a symmetric similarity measure is unnecessary. (Author)