Comparison of Linear Regression, Decision Tree Regression, and Random Forest Regression Algorithms in Predicting Baldness Risk

Abstract—Baldness is a common condition affecting both men and women, primarily caused by age, hormones, and genetics. Predicting the risk of baldness is crucial for early diagnosis and prevention of further hair loss. This study aims to compare the performance of Linear Regression (LR), Decision Tree Regression (DTR), and Random Forest Regression (RFR) in predicting baldness risk using data with variables such as age, gender, occupation, stress levels, and other lifestyle factors. A dataset of 5925 samples was processed through a series of steps, including normalization, parameter tuning, cross-validation, and residual analysis. The results show that Random Forest Regression outperformed other models with the lowest MSE (0.0979) and the highest R² (0.9056) on both training and testing data, followed by Decision Tree Regression and Linear Regression. Hyperparameter optimization using Grid Search significantly enhanced model performance. In conclusion, Random Forest Regression is the most suitable model for predicting baldness risk with complex datasets, while Linear Regression remains a viable alternative for simpler datasets.

Authors

Institutions

Publication Details

Journal
Matics Jurnal Ilmu Komputer dan Teknologi Informasi (Journal of Computer Science and Information Technology)
Published
2025-09-29
DOI
https://doi.org/10.18860/mat.v17i2.30256
Primary Topic
Data Mining Algorithms and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Comparison of Linear Regression, Decision Tree Regression, and Random Forest Regression Algorithms in Predicting Baldness Risk

Sebastianus Adi Santoso Mola, Alfonsus Maria De Liguori Goru, Christian Jaquelino Lamapaha, Yoseph Kurubingan Bekayo
Matics Jurnal Ilmu Komputer dan Teknologi Informasi (Journal of Computer Science and Information Technology)
Data Mining Algorithms and Applications
article

Comparison of Linear Regression, Decision Tree Regression, and Random Forest Regression Algorithms in Predicting Baldness Risk

Sebastianus Adi Santoso Mola, Alfonsus Maria De Liguori Goru, Christian Jaquelino Lamapaha, Yoseph Kurubingan Bekayo
article en

Abstract

Abstract—Baldness is a common condition affecting both men and women, primarily caused by age, hormones, and genetics. Predicting the risk of baldness is crucial for early diagnosis and prevention of further hair loss. This study aims to compare the performance of Linear Regression (LR), Decision Tree Regression (DTR), and Random Forest Regression (RFR) in predicting baldness risk using data with variables such as age, gender, occupation, stress levels, and other lifestyle factors. A dataset of 5925 samples was processed through a series of steps, including normalization, parameter tuning, cross-validation, and residual analysis. The results show that Random Forest Regression outperformed other models with the lowest MSE (0.0979) and the highest R² (0.9056) on both training and testing data, followed by Decision Tree Regression and Linear Regression. Hyperparameter optimization using Grid Search significantly enhanced model performance. In conclusion, Random Forest Regression is the most suitable model for predicting baldness risk with complex datasets, while Linear Regression remains a viable alternative for simpler datasets.

Matics Jurnal Ilmu Komputer dan Teknologi Informasi (Journal of Computer Science and Information Technology)Vol. 17(2)
University of Nusa Cendana (ID)
Openalex Percentile: Top 61%
Data Mining Algorithms and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.