DLF: A Deep Learning Framework Using Convolution Neural Network Algorithm for Breast Cancer Detection and Classification
Bibliographic record
Abstract
Breast cancer is one of the most frequently affecting second types of cancer in men and women worldwide.Of the overall types of cancer, 25% of them are breast cancer in women.Erratic development of breast cells results in breast cancer.The growth of cancer increases the metastasizing of the tissues, spreads fast to the other parts of the body, and results in death.The medical industry requires an efficient algorithm to detect and classify the severity level of breast cancers with the metastasis of the affected tissues.Several earlier research works have focused on constructing a computer algorithm to diagnose breast cancer images to detect and classify cancer.The earlier algorithms involved more sub-functions or procedures in completing individual tasks separately, thus increasing the computational and time complexity.This paper introduces a Deep Learning Framework (DLF) to diagnose breast images automatically and speedily with less complexity.The proposed DLF includes a few image processing tasks to improve the quality of the input image and increase classification accuracy.Recently, Convolution Neural Network has been used as an extraordinary class of models for image recognition processes.CNN is one of the deep learning models that can extract the entire set of image features and use them for analysis and classification.Thus, this paper implements a deep CNN for diagnosing and classifying benign and malignant cancers from input datasets with Python coding-the deep form of the CNN obtained by increasing the number of hidden layers and epochs.The experiment proves that CNN is highly reliable compared to the existing algorithm.
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.000 | 0.001 |
| 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.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".