Implementation of Visual Clustering Strategy in Self-Organizing Map for Wear Studies Samples Printed Using FDM
Bibliographic record
Abstract
In general, visual clusters are preferred over large data sets; this is an attempt to take advantage of cluster techniques to reduce the mathematical complexity of small data sets. To identify the possibility of implementing the clustering technique in a small dataset, the wear observations of PLA/Cu composite samples printed using the Fused Deposition Model (FDM) is taken into consideration. In this study, the Self Organizing Map (SOM) tool as a non-supervised Neural Network (NN) is used to visualize the data. Here, SOM combinations with vector quantification and projection are used to identify or rank the wear machinability parameters on the new composite filament printed under different FDM conditions. The competitive layer in SOM will classify the given parameters of the wear machine (vectors) at any number of dimensions may be into several groups of layer neurons. The limitation of SOM is map size which cannot exceed 1000 units of training. However, for the small data set under consideration, the extent of these limits will not affect performance. The SOM algorithm developed for the study of wear provides the outlet within the acceptable range. In addition, the linear regression analysis is carried out for the output response to measure the wear characteristics of the machining observation.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 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.000 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".