{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003257859,0.0001796214,0.0001821787,0.0002369612,0.0006819904,0.0002494495,0.0002033238,0.00009014519,0.000003863274],"category_scores_gemma":[0.000006498015,0.0001592281,0.00009230309,0.0009965337,0.00004784229,0.0002767338,0.000002153398,0.0004819563,0.00001759481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001513265,"about_ca_system_score_gemma":0.000009122203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003092227,"about_ca_topic_score_gemma":0.000002405203,"domain_scores_codex":[0.9984768,0.0004172414,0.0002192638,0.0003658477,0.0001995305,0.0003213351],"domain_scores_gemma":[0.9990991,0.0004383338,0.0001004739,0.0001968048,0.00005328638,0.000112024],"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.00001403676,0.00002177864,0.0001081137,0.00001671775,0.00001747238,0.000009557717,0.0002689132,0.9908258,0.0001228025,0.0005943847,0.00001600538,0.007984402],"study_design_scores_gemma":[0.0004035441,0.000165447,0.0002679429,0.00004859736,0.00001096744,0.00001010162,0.0001555342,0.9984515,0.00008842653,0.00004419897,0.0001773742,0.0001763273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0366975,0.00008083378,0.9603208,0.0001291497,0.001923038,0.0002318479,0.000003231518,0.0005980002,0.00001558624],"genre_scores_gemma":[0.9991384,0.00003214725,0.0002323226,0.00003961807,0.00009306329,0.00003580042,0.000004903501,0.00001683658,0.0004069345],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9624408,"threshold_uncertainty_score":0.6493132,"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."}}