{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055712,0.0005580617,0.0006570535,0.0006118384,0.0002039216,0.0005049538,0.000677415,0.0006170236,0.001834338],"category_scores_gemma":[0.003585306,0.0002406286,0.0003839241,0.0008842903,0.0004488323,0.0009858058,0.0006478559,0.0009827384,0.0006937985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003669369,"about_ca_system_score_gemma":0.0004789738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002785523,"about_ca_topic_score_gemma":0.003231862,"domain_scores_codex":[0.9996457,0.0001016766,0.00001944466,0.00008610155,0.0001105647,0.00003647473],"domain_scores_gemma":[0.9985128,0.0008177584,0.0001403811,0.0002240412,0.0002666593,0.00003843864],"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.000233156,0.000126629,0.001146637,0.0001841957,0.00006192672,0.0001145624,0.0001478934,0.3791617,0.03006257,0.01968748,0.007579517,0.5614937],"study_design_scores_gemma":[0.000006190458,0.00003581182,0.0001854025,0.000005035841,0.000004941365,0.00003056369,0.00001349461,0.9930243,0.002868593,0.003057381,0.0007629913,0.000005230183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0133413,0.0001433146,0.9852594,0.0001192915,0.00002737031,0.00002846865,0.0001131466,0.0003246056,0.0006431753],"genre_scores_gemma":[0.4247025,0.0006455443,0.5687819,0.0002641009,0.000139007,0.0001665044,0.00160882,0.0001318017,0.003559845],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002785523,"threshold_uncertainty_score":0.006136477,"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."}}