Exploring Gene Expression and Clinical Data for Identifying Prostate Cancer Severity Levels using Machine Learning Methods
Bibliographic record
Abstract
Prostate cancer (PCa) is the most common type of cancer in men worldwide. It is a cancer that starts in the small walnut-shaped male gland called the prostate. From the prostate, it can form a metastasis into other organs. If detected and diagnosed early the survival rate may increase to 95%. Therefore, early detection and diagnosis are important tasks performed by a pathologist. The pathologist identifies the severity levels using a scale called the Gleason grading group (GGG). The GGG is found by pathologists by looking at a biopsy sample and assigning a grade of low, intermediate, or high to the sample. The pathologist then assesses a second sample in the same manner. The GGG is found by adding these two scores provides the total Gleason score. In this paper, we have explored tissue microarray (TMA) and clinical data collected by pathologists of Alberta Precision Laboratory, for predicting the severity level of prostate cancer using various machine learning methods. Traditional classifiers, such as Naïve Bayes, Decision Tree, Support Vector Machine with Radial basis function (RBF), Logistic Regression, and ensemble classifiers, such as Random Forest, and Bagging with k-nearest neighbors have been applied through the machine learning pipeline containing imputation and sampling techniques. An integrated SMOTE-Tomek Links method is adopted for handling the class imbalance problem. The highest accuracy obtained is 99.64% from the Random Forest method.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".