{"id":"W4245251483","doi":"10.32920/ryerson.14657334.v1","title":"Variable Length K-SVD: A New Dictionary Learning Approach and Multi-Stage OMP Method for Sparse Representation","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Machine Learning and ELM","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Matching pursuit; Sparse approximation; K-SVD; Computer science; Dictionary learning; Pattern recognition (psychology); Artificial intelligence; Representation (politics); Set (abstract data type); Discrete cosine transform; Singular value decomposition; Matching (statistics); Algorithm; Mathematics; Image (mathematics); Compressed sensing","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001122504,0.000299938,0.0004256536,0.0001679988,0.0002946858,0.0006673205,0.0005427219,0.0002691847,0.00005211215],"category_scores_gemma":[0.000408005,0.0002939246,0.0001371942,0.0002634575,0.00001880535,0.0003166845,0.001595741,0.0007827228,0.000003739189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004494456,"about_ca_system_score_gemma":0.0002992026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003112687,"about_ca_topic_score_gemma":0.00001642795,"domain_scores_codex":[0.9972357,0.0004582411,0.0003668773,0.001330354,0.0002797457,0.0003291265],"domain_scores_gemma":[0.9983138,0.0003949813,0.0002483598,0.0007414495,0.0001236874,0.0001777373],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002726875,0.0002360234,0.001434208,0.0004910455,0.0002212586,0.00001088979,0.004772298,0.7554109,0.0002670307,0.03340485,0.002357982,0.2013663],"study_design_scores_gemma":[0.0006412746,0.00004128794,0.000756279,0.00004689917,0.0000332711,0.00002665158,0.0002869727,0.9840564,0.00007228769,0.001265283,0.01245375,0.0003196928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004920101,0.0003373176,0.9906632,0.0005749427,0.0004925566,0.00047944,0.00000338737,0.0004664715,0.006490664],"genre_scores_gemma":[0.002844583,0.00005253123,0.9452705,0.0001682478,0.0002148903,0.00009682493,0.0001784993,0.00002875142,0.05114518],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2286455,"threshold_uncertainty_score":0.9999513,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08513676587764696,"score_gpt":0.3569399542030978,"score_spread":0.2718031883254508,"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."}}