{"id":"W7096307319","doi":"","title":"Canada (2013)" DICTIONARY LEARNING FOR SPARSE DECOMPOSITION: A NEW CRITERION AND ALGORITHM","year":2013,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"K-SVD; Dictionary learning; Set (abstract data type); Decomposition; Sparse approximation; Function (biology); Task (project management); Sparse matrix; Matrix (chemical analysis)","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002138094,0.0001089999,0.0001038707,0.00003894778,0.00008607069,0.00005498131,0.00004377917,0.00004425848,0.0001593593],"category_scores_gemma":[0.000004939021,0.000108452,0.0000211209,0.00004173519,0.00001027433,0.0001334697,0.00002034314,0.00008489194,0.000008450802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004626618,"about_ca_system_score_gemma":0.00003833837,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.2201481,"about_ca_topic_score_gemma":0.03855919,"domain_scores_codex":[0.9995205,0.000008273713,0.0001154698,0.0001220327,0.00007155268,0.0001621355],"domain_scores_gemma":[0.9997053,0.00004402766,0.00001397649,0.00009526719,0.00004688008,0.00009459975],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000003804342,0.000007442607,0.0001595923,0.00001632434,0.00004095445,0.000003903715,0.00006491962,0.003511895,0.009593263,0.0001012542,0.8273522,0.1591445],"study_design_scores_gemma":[0.0003131315,0.00005898167,0.002822273,0.0000678959,0.00002049637,0.00008789836,0.00005547979,0.4851027,0.007441264,0.001554449,0.5021133,0.0003620991],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08489393,0.0008679256,0.9083577,0.001247693,0.000448309,0.0004566969,0.000006078704,0.001122122,0.002599523],"genre_scores_gemma":[0.7633129,0.0002287381,0.2322339,0.0005223415,0.0003987106,0.00006422581,0.00006053794,0.00005603842,0.003122594],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.678419,"threshold_uncertainty_score":0.9789846,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0122726330218339,"score_gpt":0.2242650541206799,"score_spread":0.211992421098846,"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."}}