Prediction of academic dropout in university students using data mining: Engineering case

Student dropout is considered an important indicator for measuring social mobility and reflecting the social contribution that universities offer. In economic terms, there is evidence that students attribute their decision to defect from their academic programs because of their economic situation. Dropout causes significant waging gaps among people who complete their tertiary studies compared to those who do not, leading to a lack of skilled human capital that pays greater productivity to economic development of a country. Given the above, the objective of this study is to present a tree-based classification of decisions (CBAD) with optimized parameters to predict the dropout of students at Colombian universities. The study analyses 10,486 cases of students from three private universities with similar characteristics. The result of the application of this technique with optimized parameters achieved a precision ratio of 88.14%

Dropout-permanence analysis of university students using data mining

Dropout is a rejection method present in every educational system, related to the various selection processes, academic performance, and the efficiency of the system in general, that is, the result of the combination and effect of different variables. In this sense, the dropout of university students related to their academic performance is a matter of concern since several years ago. Academic information is analyzed in order to identify factors that influence students´ dropout at the University of Mumbai, India, by using a data mining technique. The data source contains information provided to the entrance (personal and educational background) and that is generated during the study period. The data selection and cleansing are made using different criteria of representation and implementation of classification algorithms such as decision trees, Bayesian networks, and rules. the following factors are identified as influential variables in the desertion: approved courses, quantity and results of attended courses, origin and age of entry of the student. Through this process, it was possible to identify the attributes that characterize the dropout cases and their relationship with the academic performance, especially in the first year of the career

Optimization of flow shop scheduling through a hybrid genetic algorithm for manufacturing companies

A task scheduling problem is a process of assigning tasks to a limited set of resources available in a time interval, where certain criteria are optimized. In this way, the sequencing of tasks is directly associated with the executability and optimality of a preset plan and can be found in a wide range of applications, such as: programming flight dispatch at airports, programming production lines in a factory, programming of surgeries in a hospital, repair of equipment or machinery in a workshop, among others. The objective of this study is to analyze the effect of the inclusion of several restrictions that negatively influence the production programming in a real manufacturing environment. For this purpose, an efficient Genetic Algorithm combined with a Local Search of Variable Neighborhood for problems of n tasks and m machines is introduced, minimizing the time of total completion of the tasks. The computational experiments carried out on a set of problem instances with different sizes of complexity show that the proposed hybrid metaheuristics achieves high quality solutions compared to the reported optimal cases

Intelligent and Distributed Data Warehouse for Student’s Academic Performance Analysis

In the academic world, a large amount of data is handled each day, ranging from student’s assessments to their socio-economic data. In order to analyze this historical information, an interesting alternative is to implement a Data Warehouse. However, Data Warehouses are not able to perform predictive analysis by themselves, so machine intelligence techniques can be used for sorting, grouping, and predicting based on historical information to improve the analysis quality. This work describes a Data Warehouse architecture to carry out an academic performance analysis of students

Towards Parallel Constraint-Based Local Search with the X10 Language

International audienceIn this study, we started to investigate how the Partitioned Global Address Space (PGAS) programming language X10 would suit the implementation of a Constraint-Based Local Search solver. We wanted to code in this language because we expect to gain from its ease of use and independence from specifi c parallel architectures. We present the implementation strategy, and search for di fferent sources of parallelism. We discuss the algorithms, their implementations and present a performance evaluation on a representative set of benchmarks

Asynchronous Parallel Construction of Recursive Tree Hierarchies

. Multi-resolution methods are widely used in scientific visualization, image processing, and computer graphics. While many applications only require an one-time construction of these data-structures which can be done in a preprocess, this pre-process can take a significant amount of time. Considering large datasets, this time consumption can range from several minutes up to several hours, especially if this pre-process is frequently needed. Furthermore, numerous new applications, such as visibility queries, arise which often need a dynamic reconstruction of a scene database. In this paper, we address several problems of the construction or reconstruction of recursive tree hierarchies in parallel. In particular, we focus on parallel dynamic memory allocation and the associated synchronization overhead. Keywords: Parallel hierarchies, recursive tree structures, octrees, memory synchronization, shared memory, thread model. 1 Introduction In computer graphics, hierarchical m..