{"id":"W4289277681","doi":"10.1155/2022/6446903","title":"An Orthogonal Matching Pursuit Variable Screening Algorithm for High-Dimensional Linear Regression Models","year":2022,"lang":"en","type":"article","venue":"Scientific Programming","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Matching pursuit; Matching (statistics); Consistency (knowledge bases); Variable (mathematics); Feature selection; Dimension (graph theory); Algorithm; Mathematics; Computer science; Selection (genetic algorithm); Clustering high-dimensional data; Pattern recognition (psychology); Artificial intelligence; Statistics; Compressed sensing; Combinatorics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002562408,0.0001989337,0.0001943739,0.0002880297,0.003096882,0.0009784356,0.001190967,0.00006089606,0.00008670818],"category_scores_gemma":[0.00001948951,0.0001846396,0.00009641567,0.0009038058,0.0000719486,0.001692069,0.000811251,0.0002973951,0.00001029258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005762077,"about_ca_system_score_gemma":0.0001728837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004547101,"about_ca_topic_score_gemma":0.000002641416,"domain_scores_codex":[0.996699,0.0001491077,0.0003441207,0.001018326,0.001143075,0.0006463287],"domain_scores_gemma":[0.9986843,0.00008761664,0.0001883529,0.000611815,0.0002192949,0.0002086113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001679687,0.0002119843,0.000005986143,0.00001395824,0.00001179536,0.00001074668,0.0004147789,0.0342538,0.00899226,0.007557519,0.001265291,0.9472451],"study_design_scores_gemma":[0.0004856298,0.0001492447,0.000004608774,0.00006197725,0.0000096292,0.00002772241,0.0002033759,0.9550294,0.002098703,0.02872053,0.01293174,0.0002774015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01809874,0.0001122245,0.9784471,0.0001816115,0.002158955,0.0005295221,0.0000639476,0.0003732145,0.00003469555],"genre_scores_gemma":[0.06258678,4.184212e-7,0.9355904,0.0001691329,0.0001283151,0.0003581943,0.0004509147,0.0000232188,0.0006926197],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9469677,"threshold_uncertainty_score":0.998201,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0274718433282947,"score_gpt":0.2731416933568575,"score_spread":0.2456698500285628,"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."}}