{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00506406,0.001338728,0.002414104,0.001272502,0.001779818,0.004611316,0.00224794,0.002044045,0.007080597],"category_scores_gemma":[0.05219892,0.001032213,0.001465664,0.00288258,0.002881286,0.01033515,0.003744254,0.004646977,0.001116175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002376344,"about_ca_system_score_gemma":0.002236593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00463994,"about_ca_topic_score_gemma":0.00493032,"domain_scores_codex":[0.993136,0.00267803,0.0003947256,0.001286625,0.001944823,0.0005597789],"domain_scores_gemma":[0.927179,0.06435455,0.001758462,0.003558023,0.002469219,0.0006807626],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009370862,0.0002947559,0.004100883,0.00115154,0.0002340768,0.0005549407,0.0005820309,0.3647518,0.003322321,0.4160647,0.03876334,0.1692425],"study_design_scores_gemma":[0.00005510115,0.00002895745,0.0004120988,0.0000384573,0.00002130882,0.0001064145,0.00007585633,0.5138457,0.0004211924,0.482442,0.002529062,0.00002391761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08656448,0.006980204,0.8625645,0.0142021,0.0006110442,0.000244968,0.002486565,0.001038652,0.02530746],"genre_scores_gemma":[0.627349,0.005636475,0.3488742,0.002013181,0.001524245,0.0006587108,0.004497584,0.0006143011,0.008832461],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007080597,"threshold_uncertainty_score":0.02678162,"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."}}