{"id":"W2345061659","doi":"10.5220/0005710403090316","title":"Learning of Graph Compressed Dictionaries for Sparse Representation Classification","year":2016,"lang":"en","type":"article","venue":"","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec","funders":"","keywords":"Computer science; Sparse approximation; Artificial intelligence; Robustness (evolution); Neural coding; Pattern recognition (psychology); Matrix decomposition; Sparse matrix; Graph; Matching pursuit; Data compression; Compressed sensing; Theoretical computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.0001070479,0.00004568106,0.00006788648,0.00007521011,0.00008160149,0.00002481792,0.0001412072,0.00003112936,0.00002861437],"category_scores_gemma":[0.00008883752,0.00002996996,0.00004271303,0.0001238228,0.00003296862,0.000475682,0.00003038311,0.00002068728,0.00001528294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006610958,"about_ca_system_score_gemma":0.00001259544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009924149,"about_ca_topic_score_gemma":0.000001396624,"domain_scores_codex":[0.9994297,0.00003692969,0.0001611311,0.0001723967,0.0001196078,0.00008024591],"domain_scores_gemma":[0.9993263,0.0002310444,0.0001041179,0.0001664446,0.0001477392,0.00002436223],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005545867,0.00008530468,0.007265196,0.0000227814,0.00001929556,2.016224e-7,0.0004477432,0.0001918448,0.6192294,0.1536727,0.008701809,0.2103083],"study_design_scores_gemma":[0.002039794,0.0003247104,0.05137469,0.0001487148,0.00001582358,0.00000334466,0.0005315453,0.1272754,0.7365934,0.06714225,0.01426502,0.0002852792],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03063769,0.000007637429,0.9662129,0.001466469,0.0001319832,0.0001346127,0.000002208375,0.0001034921,0.001302989],"genre_scores_gemma":[0.9748648,0.00002790885,0.02403158,0.00003630213,0.00002045145,0.00004565784,0.000008949301,0.000003130406,0.0009611876],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9442272,"threshold_uncertainty_score":0.122214,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05623140282136396,"score_gpt":0.2883965974120433,"score_spread":0.2321651945906794,"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."}}