Combination of enhanced AdaBoosting techniques for the characterization of breast cancer tumors
Bibliographic record
Abstract
Breast cancer is a life threatening disease affecting one of every eight women, with the risk increasing significantly with age. Non-invasive diagnostic modalities are preferable over biopsy. However, these non-invasive diagnostic techniques have lower diagnostic accuracy when compared to biopsy. Currently, CAD (Computer-Aided Diagnosis) techniques have demonstrated strong potential to increase the accuracy of such non-invasive diagnostic modalities. This paper proposes the use of boosting to increase the accuracy of CAD-based techniques to solve the breast cancer characterization problem. It investigates and compares the performance of popular variants of the boosting algorithms, namely: AdaBoosting, AveBoosting, GentleBoosting, ConserBoosting, and Average Conservative Boosting and their suitability for the breast cancer tumor characterization problem. This work also proposes a hybrid boosting algorithm that combines the advantages of several boosting techniques. The results of applying the different boosting techniques investigated on real breast cancer benchmarks show that the hybrid boosting algorithm outperforms the other boosting techniques on average by 48%.
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.003 |
| 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.000 |
| 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".