Sociologists increasingly face choices among competing algorithms that represent reasonable approaches to the same task, with little guidance in choosing among them. We develop a strategy that uses simulated data to identify the conditions under which different methods perform well and applies what is learned from the simulations to predict which…

Knowledge tracing (KT) for evaluating students' knowledge is an essential task in personalized education. More and more researchers have devoted themselves to solving KT tasks, e.g., deep knowledge tracing (DKT), which can capture more sophisticated representations of student knowledge. Nonetheless, these techniques ignore the reconstruction of…

Identifying items with differential item functioning (DIF) in an assessment is a crucial step for achieving equitable measurement. One critical issue that has not been fully addressed with existing studies is how DIF items can be detected when data are multilevel. In the present study, we introduced a Lord's Wald X[superscript 2] test-based…

A shift in primacy from online participatory cultures to algorithmic cultures invites new questions about literacies in digital contexts. This article contributes to the conceptualisation of literacies in algorithmic cultures through sociomaterial and affect theories. It develops a sociomaterial perspective that proposes felt, observable moments…

The interactive learning is a continuous process, which is full of a large number of learning interaction activities. The data generated between learners and learning interaction activities can reflect the online learning behaviors. Through the correlation analysis among learning interaction activities, this paper discusses the potential…

This article seeks to explore different combinations of human and Artificial Intelligence (AI) decision-making in the context of distributed learning. Distributed learning institutions face specific challenges such as high levels of student attrition and ensuring quality, cost-effective student support at scale using a range of technologies, such…

Evaluated the performance of several alternative cluster analytic approaches to initial model specification using population parameter analyses and a Monte Carlo simulation. Of the six cluster approaches evaluated, the one using the correlations of item correlations as a proximity metric and average linking as a clustering algorithm performed the…

An algorithm is presented for the best least-squares fitting correlation matrix approximating a given missing value or improper correlation matrix. The proposed algorithm is based on a solution for C. I. Mosier's oblique Procrustes rotation problem offered by J. M. F. ten Berge and K. Nevels (1977). It is shown that the minimization problem…

An algorithm, based on a solution for C. I. Mosier's oblique Procrustes rotation problem, is presented for the best least-squares fitting correlation matrix approximating a given missing value or improper correlation matrix. Results are of interest for missing value and tetrachoric correlation, indefinite matrix correlation, and constrained…

A Monte Carlo study compared the usefulness of six variable weighting methods for cluster analysis. Data were 100 bivariate observations from 2 subgroups, generated according to a finite normal mixture model. Subgroup size, within-group correlation, within-group variance, and distance between subgroup centroids were manipulated. Of the clustering…

An algorithm for obtaining initial values for the minimization process in covariance structure analysis is developed that is more generally applicable for computing parameters connected to latent variables than the currently existing ones. The algorithm is formulated in terms of the RAM model but can be extended. (SLD)

Monte Carlo studies investigated effects of within-group covariance structure on subgroup recovery by several widely used hierarchical clustering methods. In Study 1, subgroup size, within-group correlation, within-group variance, and distance between subgroup centroids were manipulated. All clustering methods were strongly affected by…

A mathematical formula is introduced for the effect of integrating data. A method is then derived to eliminate the effect from correlations of variables, including mean composites, thus allowing for a clustering algorithm that requires allocation of variables according to the magnitude of their correlations. Examples illustrate the procedure. (SLD)

Seven data sets (namely, clinical data on children) were subjected to clustering by seven algorithms--the B-coefficient, Linear Typal Analysis; elementary linkage analysis, Numerical Taxonomy System, Statistical Analysis System hierarchical clustering method, Taxonomy, and Bolz's Type Analysis. The little-known B-coefficient method compared…

A non-linear version of redundancy analysis is introduced. The technique is called REDUNDALS. It is implemented within the computer program for canonical correlation analysis called CANALS. The REDUNDALS algorithm is of an alternating least square (ALS) type. The technique is defined as minimization of a squared distance between criterion…