Forecasting demand in the residential construction industry using machine learning algorithms in Jordan
Bibliographic record
Abstract
Purpose Demand forecasts are a key component of planning efforts and are crucial for managing core operations. This study aims to evaluate the use of several machine learning (ML) algorithms to forecast demand for residential construction in Jordan. Design/methodology/approach The identification and selection of variables and ML algorithms that are related to the demand for residential construction are indicated using a literature review. Feature selection was done by using a stepwise backward elimination. The developed algorithm’s accuracy has been demonstrated by comparing the ML predictions with real residual values and compared based on the coefficient of determination. Findings Nine economic indicators were selected to develop the demand models. Elastic-Net showed the highest accuracy of (0.838) versus artificial neural networkwith an accuracy of (0.727), followed by Eureqa with an accuracy of (0.715) and the Extra Trees with an accuracy of (0.703). According to the results of the best-performing model forecast, Jordan’s 2023 first-quarter demand for residential construction is anticipated to rise by 11.5% from the same quarter of the year 2022. Originality/value The results of this study extend to the existing body of knowledge through the identification of the most influential variables in the Jordanian residential construction industry. In addition, the models developed will enable users in the fields of construction engineering to make reliable demand forecasts while also assisting in effective financial decision-making.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".