{"id":"W2401963278","doi":"","title":"A novel greedy algorithm for Nyström approximation","year":2011,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Greedy algorithm; Algorithm; Approximation algorithm; Kernel (algebra); Mathematical optimization; Benchmark (surveying); Sampling (signal processing); Greedy randomized adaptive search procedure; Mathematics; Matrix (chemical analysis); Computer science; Combinatorics; Filter (signal processing)","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.00002976865,0.00006380462,0.00006247617,0.00003545197,0.00001784019,0.000008518177,0.00005742851,0.00003921613,0.00002726232],"category_scores_gemma":[0.000002778219,0.00005896823,0.00002936212,0.0000387666,0.00000781892,0.00006313351,0.000008874456,0.00002958515,0.00000863061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009535767,"about_ca_system_score_gemma":0.000002173186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002813485,"about_ca_topic_score_gemma":0.000003170333,"domain_scores_codex":[0.9997173,0.000001319577,0.00007642573,0.00006812393,0.00003735745,0.00009945677],"domain_scores_gemma":[0.9998229,0.000007915753,0.000009331973,0.0001097986,0.00002991521,0.00002017754],"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.000007913245,0.0001047548,0.00002697244,0.00003610374,0.00009252805,0.000001822921,0.0006965292,0.0001723778,0.1097823,0.01675476,0.01700071,0.8553233],"study_design_scores_gemma":[0.0001630905,0.00003027256,0.0001683059,0.00001236977,0.000008664447,0.000006157863,0.00002800086,0.6829379,0.3114698,0.00296854,0.002079666,0.0001272778],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001580147,0.0000149611,0.9688371,0.000003446284,0.0001007576,0.0001516549,0.000003517386,0.0009289347,0.02837951],"genre_scores_gemma":[0.2405441,0.00000304516,0.7591814,0.00002981242,0.00005158098,0.00003209257,0.000005091633,0.00001816877,0.000134772],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.855196,"threshold_uncertainty_score":0.2404655,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05082590369836738,"score_gpt":0.2250647369847518,"score_spread":0.1742388332863844,"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."}}