Comparison of different supervised machine learning algorithms for bead geometry prediction in GMAW process
Bibliographic record
Abstract
Gas Metal Arc Welding (GMAW) is an extensively implemented arc welding process through the control of input process parameters and the metal from the filler wire. Despite its popular use in various industries, the complex interrelationship between the actual bead and the varying welding parameters makes it challenging to predict appropriate bead geometries via mathematical modeling in a continually changing welding process. In this study, the Regression Learner App was used to compare the performance of supervised Machine Learning (ML) predictive models comprising the Linear Regression (LR), Regression Tree (RT), Support Vector Machine (SVM), Ensembles of Tree (ET), Gaussian Process Regression (GPR), and Artificial Neural Network (ANN) using GMAW dataset. The dataset was scaled and normalized at a range of -1 to +1 to facilitate the visualization of the variation effect. The wire feed speed, voltage, weld velocity, unmelted wire length, and melted wire volume were considered as the input parameters to predict the bead geometry. In addition, the five-fold cross-validation was employed to avoid overfitting and poor generalization. Finally, statistical indicators, namely the Coefficient of Determination (R2), Root Mean Squared Error (RMSE), and Mean Absolute Error (MAE), were performed on all developed models to evaluate their performance. Thus, the fine tree and ANN models achieved the highest prediction accuracies of 88–91%, signifying their potential use in future research. In short, the present study demonstrated the performance of various supervised ML algorithms for bead geometry prediction, which would assist the selection of appropriately supervised ML algorithms in future studies.
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.002 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".