Search arXivSearch

arXiv · 1901.03696

Key Factor Not to Drop Out is to Attend the Lecture

Abstract

In addition to the learning check testing results performed at each lectures, we have extended the factors to find the key dropping out factors. Among them are, the number of successes in the learning check testing, the number of attendances to the follow-up program classes, and etc. Then, we have found key factors strongly related to the students at risk. They are the following. 1) Badly failed students (score range is 0-39 in the final examination) tend to be absent for the regular classes and fail in the learning check testing even if they attended, and they are very reluctant to attend the follow-up program classes. 2) Successful students (score range is 60-100 in the final examination) attend classes and get good scores in every learning check testing. 3) Failed students but not so badly (score range is 40-59 in the final examination) reveal both sides of features appeared in score range of 0-39 and score range of 60-100. Therefore, it is crucial to attend the lectures in order not to drop out. Students who failed in learning check testing more than half out of all testing times almost absolutely failed in the final examination, which could cause the drop out. Also, students who were successful to learning check testing more than two third out of all testing times took better score in the final examination.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hideo Hirose. 2018-12-12. Key Factor Not to Drop Out is to Attend the Lecture. https://arxiv.org/abs/1901.03696

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

See You at the Posterior Line: Learning Bayesian Modeling Through a Car Racing Game

We present an interactive classroom activity designed to address a central challenge in teaching introductory Bayesian statistics: how to formalize subjective knowledge and available information into prior distributions and then update them with empirical data. Role-playing as data analysts for a racing team, students evaluate candidate tires by converting qualitative engineering reports into prior distributions, collecting primary data via a virtual racing game, and using a Beta-Binomial model to inform team strategy. This discovery-based exercise allows small groups to observe directly how different prior choices and sample data jointly shape posterior inference. Student feedback ($n=32$) highlights high enjoyment, engagement and improved conceptual clarity. Open-access materials to implement the activity are provided, alongside recommendations for adapting it to other teaching contexts.

stat.OT

Why is Regularization Underused? An Empirical Study on Trust and Adoption of Statistical Methods

Statistical practice does not automatically follow methodological innovation. Regularization methods, widely advocated to reduce overfitting and stabilize inference, are readily available in modern software, but are not consistently used by data analysts. We investigate this implementation gap in a large-scale empirical study of trust in, and acceptance of, regularization techniques, based on $N = 606$ data analysts. Drawing on measurement frameworks from technology acceptance research, we survey practitioners and embed a randomized experiment to test whether written recommendation of regularization methods increases trust or intended use. We find no evidence of such an effect. Instead, adoption intentions are strongly associated with analysts' perceptions of ease of implementation and practical benefit, such as improved bias control or interpretability. Perceived social norms also emerge as a central driver. These results indicate that uptake of statistical methodology depends less on formal recommendations than on usability, perceived utility, and community practice.

stat.OT

Exact analysis of a split--merge queue with latent Erlang-factor dependent subtask times

This paper studies a two-server split--merge queue with positively dependent subtask service times modeled through a latent-factor bivariate Erlang construction. An exact characterization of the split--merge completion time is obtained, including explicit formulas for its first two moments and the resulting mean waiting time. Under fixed marginal service-time distributions, independence is shown to stochastically increase the completion time and hence overestimate mean waiting time. Numerical illustrations show that this benchmark gap can be substantial.

stat.OT