Machine Learning-Based Lung Cancer Classification and Enhanced Accuracy on CT Images
Bibliographic record
Abstract
Lung cancer ranks as one of the main sources of death around the world.Because of the absence of symptoms in beginning phase patients, identifying and evaluating affected areas presents a significant challenge.Consequently, the mortality rate associated with lung cancer surpasses that of other lung diseases.Cellular breakdown in the lungs can be ordered into three sorts as Non-Small Cell Lung Cancer (NSCLC), Small Cell Lung Cancer (SCLC), and Carcinoid.Early detection is imperative, as it enables individuals to live longer lives.Computed Tomography (CT) scans are employed to locate tumors and determine the extent of cancer spread within the body.Early conclusion and characterization of cellular breakdown in the lungs are vital for working on a patient's possibilities of endurance, necessitating prompt lung disease detection.Accordingly, numerous machine learning and image processing models have been developed.This work efficiently classifies lung cancer as benign, malignant, or normal using a machine learning-based method for improved accuracy in lung cancer diagnosis on CT scans.The suggested model's accuracy on CT scans is increased by using the Random Forest algorithm to the detection of lung cancer.Metrics for accuracy, precision, sensitivity, and recall are used to assess the effectiveness of the approach that is being given.
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.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 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.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".