{"id":"W2949378043","doi":"10.48550/arxiv.0708.4149","title":"On the complexity of nonnegative matrix factorization","year":2007,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Non-negative matrix factorization; Heuristic; Cluster analysis; Factorization; Matrix decomposition; Matrix (chemical analysis); Combinatorics; Nonnegative matrix; Mathematics; Image (mathematics); Time complexity; Computer science; Algorithm; Artificial intelligence; Symmetric matrix","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003131111,0.0001746787,0.0001930476,0.0001710297,0.000117232,0.00004864478,0.001454512,0.0001692358,0.00003715351],"category_scores_gemma":[0.00007211175,0.0001436837,0.0001363995,0.0006440296,0.0003388765,0.0001512543,0.0006792936,0.0003817755,0.00003098945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001371328,"about_ca_system_score_gemma":0.00009616508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006378105,"about_ca_topic_score_gemma":0.000004593391,"domain_scores_codex":[0.9989216,0.0001337657,0.0001812705,0.0004791401,0.0001272385,0.000157008],"domain_scores_gemma":[0.9981557,0.0002281108,0.0003707142,0.0009036576,0.0002912552,0.00005061104],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001462268,0.00005726659,0.0001064478,0.00002255564,0.0000216269,0.000006805333,0.0001458461,0.0005738008,0.0001895976,0.9984886,0.00009798005,0.0002748483],"study_design_scores_gemma":[0.0001586959,0.00008844282,0.00240325,0.00008845772,0.00002415119,7.854284e-7,0.00007831824,0.1526104,0.04110031,0.8029349,0.000216148,0.0002961155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01770354,0.000010431,0.9772702,0.0002848528,0.0001728549,0.000293865,0.00001882231,0.0001788689,0.004066551],"genre_scores_gemma":[0.9972566,0.00004659418,0.001916516,0.0000630873,0.00002192258,4.913286e-7,0.000009929974,0.000006767227,0.0006780572],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9795531,"threshold_uncertainty_score":0.5859251,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1640083652472415,"score_gpt":0.233355019872485,"score_spread":0.0693466546252435,"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."}}