{"id":"W4387697644","doi":"10.1002/sim.9934","title":"Rank selection for non‐negative matrix factorization","year":2023,"lang":"en","type":"article","venue":"Statistics in Medicine","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Non-negative matrix factorization; Matrix decomposition; Rank (graph theory); Computer science; Feature selection; Pattern recognition (psychology); Dimensionality reduction; Matrix (chemical analysis); Model selection; Computation; Selection (genetic algorithm); Dimension (graph theory); Algorithm; Mathematics; Artificial intelligence; Eigenvalues and eigenvectors","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008919419,0.002176302,0.002088206,0.001600442,0.001272793,0.001651799,0.001848498,0.001951735,0.004176652],"category_scores_gemma":[0.02893861,0.0006874842,0.001868748,0.001655606,0.002035892,0.001855015,0.001585983,0.00280724,0.002825676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001135452,"about_ca_system_score_gemma":0.002475301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002973146,"about_ca_topic_score_gemma":0.003409684,"domain_scores_codex":[0.9917681,0.004992678,0.0003255795,0.0009232774,0.001714246,0.0002759802],"domain_scores_gemma":[0.9840904,0.01122718,0.0009405729,0.001287012,0.002192979,0.000261883],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003950293,0.0002519499,0.002242953,0.0008426203,0.0004586499,0.000475597,0.000316949,0.4420174,0.008456604,0.124288,0.02865385,0.3916004],"study_design_scores_gemma":[0.00005004739,0.00007276798,0.0003584164,0.00003235289,0.00001683664,0.000096449,0.0000271829,0.9530735,0.001782395,0.04069885,0.003762512,0.00002866321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001511087,0.0002158663,0.9973074,0.0001328703,0.00004152786,0.00005825335,0.00006473345,0.0002772975,0.0003909625],"genre_scores_gemma":[0.08821356,0.0006400805,0.9065868,0.0003705177,0.0003201351,0.0007394939,0.000896844,0.0002980583,0.001934543],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008919419,"threshold_uncertainty_score":0.04717094,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01892511090654284,"score_gpt":0.354111484269837,"score_spread":0.3351863733632942,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}