Active cluster replacement algorithm as a tool to assess bifurcation early-warning signs for von Karman equations
Bibliographic record
Abstract
The paper deals with a novel algorithm used to improve identification quality of clusters generated by predictive clustering algorithm as a tool to identify states preceding to bifurcations for a system governed by von Karman equations. To construct bifurcation precursors, solutions (of the equations) observed on bifurcation paths are clustered; centers of the clusters constitute a set of bifurcation precursors. To decrease identification error rate, quality of each precursor is assessed with the employment of an additional, validation set. The paper concerns with two approaches to this procedure; the first one employs a single number to assess identification value of a cluster in order to delete those with low identification values. The second approach uses proposed knowledge extraction procedure to ascertain rules of replacement of the precursors chosen by the algorithm (active) by more efficient one. A wide-ranging simulation reveals that the best variant (provided that the Wishart clustering algorithm is utilized) is the replacement of the active cluster in conjunction local normalization of data. The optimal parameters values for both algorithms, arriving at essentially decreased identification errors.
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.003 | 0.010 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| 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".