Research on Union Adaboost Based on Sample Weight Updating Mechanism
Bibliographic record
Abstract
Aiming at the limitations of the sample weight updating mechanism of the traditional Adaboost algorithm, the article proposes three improved algorithms based on the joint weight updating mechanism to solve the problems of sample distribution imbalance, etc.The MW_UA algorithm is centered on the updating of the proportion of the sample weight, the OW_UA algorithm realizes the updating of the weight of the sample set based on the classification effect of the initial samples, the MAR_UA algorithm employs sample The MAR_UA algorithm uses the sample Margin to quantify the degree of difficulty of sample classification and then obtain the corresponding sample weights.The performance test experiments and prediction simulation experiments of the improved algorithm are based on the MWSP and Caltech datasets.The experimental results show that the average accuracy and F1 score of MAR_UA algorithm in the two datasets are over 90%, which is the best performance among all the improved algorithms.The algorithm also shows optimal prediction error convergence performance in both datasets, and the training error can be converged to the minimum within 40 times of training.When the algorithm is applied to the simulation experiment of pedestrian recognition, it has the best recognition effect in the sunny environment, with a detection rate of 94.1%.In addition, the error between its predicted and real values of offshore wind speed is no more than 0.2 m/s, and the ERMS and EMA are reduced by 63.52% and 55.5%, respectively, compared with the traditional Adaboost.This study optimizes the weight updating mechanism of the joint Adaboost algorithm using various methods, which can provide new ideas for the optimization research of the weight updating mechanism.
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.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.003 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 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".