Implementation of Machine Learning in Flat Die Extrusion of Polymers
Bibliographic record
Abstract
Achieving a uniform thickness and defect-free production in the flat die extrusion of polymer sheets and films is a major challenge. Dies are designed for one extrusion scenario, for a polymer grade with specified rheological behavior, and for a given throughput rate. The extrusion of different polymer grades and at different flow rates requires trial-and-error procedures. This study investigated the application of machine learning (ML) to provide guidance for the extrusion of sheets and films with a reduced thickness, non-uniformities, and without defects. A dataset of 200 cases was generated using computer simulation software for flat die extrusion. The dataset encompassed variations in die geometry by varying the gap under a restrictor, polymer rheological and thermophysical properties, and processing conditions, including throughput rate and temperatures. The dataset was used to train and evaluate the following three powerful machine learning (ML) algorithms: Random Forest (RF), XGBoost, and Support Vector Regression (SVR). The ML models were trained to predict thickness variations, pressure drops, and the lowest wall shear rate (targets). Using the SHapley Additive exPlanations (SHAP) analysis provided valuable insights into the influence of input features, highlighting the critical roles of polymer rheology, throughput rate, and the gap beneath the restrictor in determining targets. This ML-based methodology has the potential to reduce or even eliminate the use of trial and error procedures.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".