Predicting Cancer Survival Using Multilayer Perceptron and High-Dimensional SVM Kernel Space
Bibliographic record
Abstract
Predicting disease prediction and prognosis have become very easy task with Machine learning models for an inextricable aspect of cancer research aiming at enhancing patient therapy and management. The primary goal of proposed research work is to use Support vector machine, machine learning models and for dealing very accurately for predicting survival time for breast cancer based on clinical data. The study has proposed a solution to the problem in respect to various tumor related characteristic by integrating from dataset about tumour stage, size of tumor, and age at which the diagnosis start is an important major component for utilising for predicting survival time. Haberman's Survival Data Set is dataset describing those subjects who had been provided treatment for breast cancer. The sample taken for research are taken from study which was conducted at University of Chicago's Billings Hospital taking case who were survived after surgery for breast cancer. SVM applied on data set by different options of kernel RBF and linear as well as soft computing techniques are applied to predict the survival rate of patient from dataset. Apart from data standardisation and categorization, the machine learning approaches used in this research work to demonstrate features in terms of predicting how long they survived. Model performance is analysed on breast cancer data is justified by accuracy, support and f1 score. A workflow based on Python-platform has been utilised to support the suggested technique.
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.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 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.001 |
| Research integrity | 0.001 | 0.001 |
| 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".