{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001065072,0.0005766703,0.0005983955,0.001422314,0.001263016,0.00299734,0.001119243,0.001757628,0.03419884],"category_scores_gemma":[0.002211222,0.0003914006,0.0004068707,0.003204026,0.001987542,0.001761819,0.001382662,0.001534445,0.01291075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006552456,"about_ca_system_score_gemma":0.007659659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.235786,"about_ca_topic_score_gemma":0.3369749,"domain_scores_codex":[0.9991763,0.00008537918,0.00003839997,0.0001435954,0.0004918506,0.00006448632],"domain_scores_gemma":[0.9991628,0.00008923815,0.0000403806,0.0001142401,0.0005149661,0.00007842308],"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.0001334766,0.00003291398,0.0008427678,0.0001674171,0.00002794007,0.0001940569,0.0001199494,0.02226885,0.003435628,0.1733251,0.2803651,0.5190868],"study_design_scores_gemma":[0.00004562861,0.00003230112,0.00110135,0.0001243534,0.00001410935,0.0002379607,0.0001497902,0.1781798,0.006229257,0.07111914,0.7426847,0.00008159758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004359968,0.006791628,0.7738323,0.01696736,0.004092331,0.0002163447,0.002932504,0.001882709,0.1889248],"genre_scores_gemma":[0.0616367,0.00647703,0.5277925,0.002231877,0.000845303,0.0001644362,0.002727155,0.0007567718,0.3973682],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.235786,"threshold_uncertainty_score":0.4688272,"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."}}