Feature selection in finite mixture of sparse normal linear models in high-dimensional feature space
Bibliographic record
Abstract
Rapid advancement in modern technology has allowed scientists to collect data of unprecedented size and complexity. This is particularly the case in genomics applications. One type of statistical problem in such applications is concerned with modeling an output variable as a function of a small subset of a large number of features based on relatively small sample sizes, which may even be coming from multiple subpopulations. As such, selecting the correct predictive features (variables) for each subpopulation is the key. To address this issue, we consider the problem of feature selection in finite mixture of sparse normal linear (FMSL) models in large feature spaces. We propose a 2-stage procedure to overcome computational difficulties and large false discovery rates caused by the large model space. First, to deal with the curse of dimensionality, a likelihood-based boosting is designed to effectively reduce the number of candidate features. This is the key thrust of our new method. The greatly reduced set of features is then subjected to a sparsity inducing procedure via a penalized likelihood method. A novel scheme is also proposed for the difficult problem of finding good starting points for the expectation-maximization estimation of mixture parameters. We use an extended Bayesian information criterion to determine the final FMSL model. Simulation results indicate that the procedure is successful in selecting the significant features without including a large number of insignificant ones. A real data example on gene transcription regulation is also presented.
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.006 | 0.012 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| 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.001 | 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 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".