{"id":"W4389104986","doi":"10.1109/tnnls.2023.3332360","title":"Graph-Based Multicentroid Nonnegative Matrix Factorization","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"National Key Research and Development Program of China; Liaoning Revitalization Talents Program","keywords":"Centroid; Cluster analysis; Non-negative matrix factorization; Pattern recognition (psychology); Data point; Graph; Mathematics; Distance matrix; Matrix decomposition; Computer science; Artificial intelligence; Data mining; Algorithm; Combinatorics","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.00156912,0.00170108,0.001350434,0.001644086,0.0008162549,0.001076098,0.001197094,0.001184633,0.001584194],"category_scores_gemma":[0.005935823,0.0004330953,0.001492031,0.002208342,0.000807197,0.00183524,0.000858195,0.001387267,0.0008171265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008924791,"about_ca_system_score_gemma":0.001319694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007332094,"about_ca_topic_score_gemma":0.008439212,"domain_scores_codex":[0.9984677,0.0004309019,0.00007365454,0.0004500431,0.0004587022,0.0001188814],"domain_scores_gemma":[0.9983203,0.0005986143,0.0002185226,0.0002229365,0.0005833547,0.00005628263],"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.0002572009,0.00009918512,0.002034265,0.0005221509,0.0002138156,0.0002809237,0.000314141,0.4765377,0.01966797,0.03035102,0.01682235,0.4528993],"study_design_scores_gemma":[0.000008254869,0.00002371306,0.0004676823,0.00001379915,0.00001389897,0.00007205985,0.00003483556,0.9868135,0.001626546,0.008840738,0.002064076,0.00002074475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004125831,0.0003316896,0.9944136,0.0001077017,0.00005645102,0.00003511568,0.0001450711,0.0003206842,0.0004638911],"genre_scores_gemma":[0.2145416,0.0008853757,0.7799575,0.0002152636,0.000130562,0.0002194141,0.001698204,0.0002130501,0.002139054],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007332094,"threshold_uncertainty_score":0.01457882,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0115272353945524,"score_gpt":0.2337333432947899,"score_spread":0.2222061079002375,"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."}}