Machine Learning for Identifying Potential Participants in Uruguayan Social Programs
- URL: http://arxiv.org/abs/2504.01045v1
- Date: Mon, 31 Mar 2025 15:30:36 GMT
- Title: Machine Learning for Identifying Potential Participants in Uruguayan Social Programs
- Authors: Christian Beron Curti, Rodrigo Vargas Sainz, Yitong Tseo,
- Abstract summary: This research project explores the optimization of the family selection process for participation in Uruguay's Crece Contigo Family Support Program (PAF) through machine learning.<n>An anonymized database of 15,436 previous referral cases was analyzed, focusing on pregnant women and children under four years of age.<n>The main objective was to develop a predictive algorithm capable of determining whether a family meets the conditions for acceptance into the program.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This research project explores the optimization of the family selection process for participation in Uruguay's Crece Contigo Family Support Program (PAF) through machine learning. An anonymized database of 15,436 previous referral cases was analyzed, focusing on pregnant women and children under four years of age. The main objective was to develop a predictive algorithm capable of determining whether a family meets the conditions for acceptance into the program. The implementation of this model seeks to streamline the evaluation process and allow for more efficient resource allocation, allocating more team time to direct support. The study included an exhaustive data analysis and the implementation of various machine learning models, including Neural Networks (NN), XGBoost (XGB), LSTM, and ensemble models. Techniques to address class imbalance, such as SMOTE and RUS, were applied, as well as decision threshold optimization to improve prediction accuracy and balance. The results demonstrate the potential of these techniques for efficient classification of families requiring assistance.
Related papers
- An experimental survey and Perspective View on Meta-Learning for Automated Algorithms Selection and Parametrization [0.0]
We provide an overview of the state of the art in this continuously evolving field.
AutoML makes machine learning techniques accessible to domain scientists who are interested in applying advanced analytics.
arXiv Detail & Related papers (2025-04-08T16:51:22Z) - Accurate Multi-Category Student Performance Forecasting at Early Stages of Online Education Using Neural Networks [2.195766695109612]
This study introduces a novel neural network-based approach capable of accurately predicting student performance.
The proposed model predicts outcomes in Distinction, Fail, Pass, and Withdrawn categories.
The results indicate that the prediction accuracy of the proposed method is about 25% more than the existing state-of-the-art.
arXiv Detail & Related papers (2024-12-08T13:37:30Z) - Predictive Analytics of Varieties of Potatoes [2.336821989135698]
We explore the application of machine learning algorithms specifically to enhance the selection process of Russet potato clones in breeding trials.
This study addresses the challenge of efficiently identifying high-yield, disease-resistant, and climate-resilient potato varieties.
arXiv Detail & Related papers (2024-04-04T00:49:05Z) - Leveraging AI for Enhanced Software Effort Estimation: A Comprehensive
Study and Framework Proposal [2.8643479919807433]
The study aims to improve accuracy and reliability by overcoming the limitations of traditional methods.
The proposed AI-based framework holds the potential to enhance project planning and resource allocation.
arXiv Detail & Related papers (2024-02-08T08:25:41Z) - A Survey of Contextual Optimization Methods for Decision Making under
Uncertainty [47.73071218563257]
This review article identifies three main frameworks for learning policies from data and discusses their strengths and limitations.
We present the existing models and methods under a uniform notation and terminology and classify them according to the three main frameworks.
arXiv Detail & Related papers (2023-06-17T15:21:02Z) - A Reinforcement Learning-assisted Genetic Programming Algorithm for Team
Formation Problem Considering Person-Job Matching [70.28786574064694]
A reinforcement learning-assisted genetic programming algorithm (RL-GP) is proposed to enhance the quality of solutions.
The hyper-heuristic rules obtained through efficient learning can be utilized as decision-making aids when forming project teams.
arXiv Detail & Related papers (2023-04-08T14:32:12Z) - ASPEST: Bridging the Gap Between Active Learning and Selective
Prediction [56.001808843574395]
Selective prediction aims to learn a reliable model that abstains from making predictions when uncertain.
Active learning aims to lower the overall labeling effort, and hence human dependence, by querying the most informative examples.
In this work, we introduce a new learning paradigm, active selective prediction, which aims to query more informative samples from the shifted target domain.
arXiv Detail & Related papers (2023-04-07T23:51:07Z) - The Neural Process Family: Survey, Applications and Perspectives [40.800706337651526]
The Neural Processes Family (NPF) intends to offer the best of both worlds by leveraging neural networks for meta-learning predictive uncertainties.
We shed light on their potential to bring several recent advances in other deep learning domains under one umbrella.
arXiv Detail & Related papers (2022-09-01T15:01:32Z) - A Survey of Learning on Small Data: Generalization, Optimization, and
Challenge [101.27154181792567]
Learning on small data that approximates the generalization ability of big data is one of the ultimate purposes of AI.
This survey follows the active sampling theory under a PAC framework to analyze the generalization error and label complexity of learning on small data.
Multiple data applications that may benefit from efficient small data representation are surveyed.
arXiv Detail & Related papers (2022-07-29T02:34:19Z) - Towards Explainable Metaheuristic: Mining Surrogate Fitness Models for
Importance of Variables [69.02115180674885]
We use four benchmark problems to train a surrogate model and investigate the learning of the search space by the surrogate model.
We show that the surrogate model picks out key characteristics of the problem as it is trained on population data from each generation.
arXiv Detail & Related papers (2022-05-31T09:16:18Z) - Resource Planning for Hospitals Under Special Consideration of the
COVID-19 Pandemic: Optimization and Sensitivity Analysis [87.31348761201716]
Crises like the COVID-19 pandemic pose a serious challenge to health-care institutions.
BaBSim.Hospital is a tool for capacity planning based on discrete event simulation.
We aim to investigate and optimize these parameters to improve BaBSim.Hospital.
arXiv Detail & Related papers (2021-05-16T12:38:35Z) - A User's Guide to Calibrating Robotics Simulators [54.85241102329546]
This paper proposes a set of benchmarks and a framework for the study of various algorithms aimed to transfer models and policies learnt in simulation to the real world.
We conduct experiments on a wide range of well known simulated environments to characterize and offer insights into the performance of different algorithms.
Our analysis can be useful for practitioners working in this area and can help make informed choices about the behavior and main properties of sim-to-real algorithms.
arXiv Detail & Related papers (2020-11-17T22:24:26Z) - An evaluation of machine learning techniques to predict the outcome of
children treated for Hodgkin-Lymphoma on the AHOD0031 trial: A report from
the Children's Oncology Group [0.0]
We explore the potential of machine learning algorithms in a survival analysis context.
We discuss the weaknesses of the CoxPH model we would like to improve upon.
We produce recommendations for practitioners that would like to benefit from the recent advances in artificial intelligence.
arXiv Detail & Related papers (2020-01-15T20:03:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.