{"id":"W4327718153","doi":"10.1016/j.knosys.2023.110465","title":"Robust dual-graph discriminative NMF for data classification","year":2023,"lang":"en","type":"article","venue":"Knowledge-Based Systems","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Northwest University; Shanxi Provincial Key Research and Development Project; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Non-negative matrix factorization; Discriminative model; Outlier; Matrix decomposition; Robustness (evolution); Computer science; Pattern recognition (psychology); Artificial intelligence; Graph; Feature vector; Dual graph; k-nearest neighbors algorithm; Algorithm; Theoretical computer science","routes":{"ca_aff":true,"ca_fund":true,"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.0009643374,0.0001787069,0.0002220515,0.0003380934,0.0002828498,0.0002678265,0.001043853,0.0001095966,0.000005400399],"category_scores_gemma":[0.0001818008,0.0001534214,0.0000777644,0.0009712227,0.00004723857,0.0006099559,0.0002339688,0.00009785406,0.0007615607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005051032,"about_ca_system_score_gemma":0.0001510786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002889651,"about_ca_topic_score_gemma":0.00003204278,"domain_scores_codex":[0.9981313,0.0001977165,0.0003561626,0.0007199018,0.0002502362,0.0003446665],"domain_scores_gemma":[0.9976098,0.0004918782,0.0001623929,0.001311724,0.0003091191,0.0001150971],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005982057,0.0005603748,0.0004921026,0.001420126,0.00009756226,0.00001621119,0.00280365,0.00235573,0.01439353,0.03226908,0.8766829,0.06884891],"study_design_scores_gemma":[0.0006565006,0.00007059251,0.0005627044,0.0002761715,0.00001744812,0.000002045065,0.0005634609,0.9557685,0.001789472,0.0004789875,0.03956372,0.0002503559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002436308,0.0003327473,0.9881678,0.0009826989,0.002798358,0.001019397,0.0002110715,0.0007644811,0.003287111],"genre_scores_gemma":[0.9868597,0.00001760979,0.006356236,0.00006857431,0.0004363842,0.0008445978,0.002196255,0.00003943438,0.003181148],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9844235,"threshold_uncertainty_score":0.9788577,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2440555756760268,"score_gpt":0.3397255605977658,"score_spread":0.09566998492173903,"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."}}