Gene Selection Method for Microarray Data Classification Using Particle Swarm Optimization and Neighborhood Rough Set
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Background: Mining knowledge from microarray data is one of the popular research topics in biomedical informatics. Gene selection is a significant research trend in biomedical data mining, since the accuracy of tumor identification heavily relies on the genes biologically relevant to the identified problems. Objective: In order to select a small subset of informative genes from numerous genes for tumor identification, various computational intelligence methods were presented. However, due to the high data dimensions, small sample size, and the inherent noise available, many computational methods confront challenges in selecting small gene subset. Methods: In our study, we propose a novel algorithm PSONRS_KNN for gene selection based on the particle swarm optimization (PSO) algorithm along with the neighborhood rough set (NRS) reduction model and the K-nearest neighborhood (KNN) classifier. Results: First, the top-ranked candidate genes are obtained by the GainRatioAttributeEval preselection algorithm in WEKA. Then, the minimum possible meaningful set of genes is selected by combining PSO with NRS and KNN classifier. Conclusion: Experimental results on five microarray gene expression datasets demonstrate that the performance of the proposed method is better than existing state-of-the-art methods in terms of classification accuracy and the number of selected genes.
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.
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.001 | 0.000 |
| 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.002 |
| Open science | 0.000 | 0.000 |
| 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 it