Markov blanket: Efficient strategy for feature subset selection method for high dimensional microarray cancer datasets
Bibliographic record
Abstract
In this paper, we discuss the importance of feature subset selection methods in machine learning techniques. An analysis of microarray expression was used to check whether global biological differences underlie common pathological features for different types of cancer datasets and to identify genes that might anticipate the clinical behavior of this disease. One way of finding relevant gene selection is by using Bayesian network based on Markov blanket. We present and compare the performance of the different approaches of features (genes) subset selection methods based on Wrapper and Markov Blanket models for the five-microarray cancer datasets. The first alternative depends on Memetic algorithms (MAs) for feature selection method. In the second alternative, we use MRMR (Minimum Redundant Maximum Relevant) for feature subset selection method hybridized by genetic search optimization techniques. We compare the performance of Markov blanket model with most common classification algorithms for those set of features. The results show that the performance measures of classification algorithms based on Markov Blanket model mostly offer better accuracy rates than other types of classical classification algorithms for the cancer Microarray datasets.
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.003 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 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".