{"id":"W2909027841","doi":"10.1109/access.2019.2892289","title":"Movie Recommendation via Markovian Factorization of Matrix Processes","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"National Key Research and Development Program of China; Beijing Advanced Innovation Center for Big Data and Brain Computing; State Key Laboratory of Software Development Environment; Ministry of Science and Technology of the People's Republic of China; National Natural Science Foundation of China","keywords":"Computer science; Matrix decomposition; Markov process; Recommender system; Factorization; Matrix algebra; Matrix (chemical analysis); Theoretical computer science; Information retrieval; Algorithm; Mathematics; Statistics; Physics","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.0001951478,0.0001035357,0.0001688804,0.0001322638,0.00003529367,0.0001732019,0.0008458702,0.00006331901,0.00006557952],"category_scores_gemma":[0.00001380011,0.00009136371,0.00003232974,0.0004846297,0.00000734898,0.001715534,0.0001154516,0.00005956744,0.00002303297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000301256,"about_ca_system_score_gemma":0.00005176713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001508139,"about_ca_topic_score_gemma":0.00001697233,"domain_scores_codex":[0.9991107,0.00004827916,0.0002894644,0.0002541926,0.0001593518,0.0001380062],"domain_scores_gemma":[0.9991159,0.00005903701,0.0002539468,0.0003614426,0.0001744335,0.0000352506],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00004365667,0.0005594637,0.2718769,0.003398009,0.0001493659,0.000005167462,0.002110459,0.000156384,0.0350174,0.01540613,0.02197041,0.6493066],"study_design_scores_gemma":[0.001303479,0.000534759,0.02538395,0.0004480299,0.00002480455,0.00003352314,0.00006058666,0.02917041,0.8326315,0.0362981,0.0728354,0.00127552],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01445926,0.00002989649,0.9798954,0.0003633249,0.0009278258,0.000339582,0.000003521187,0.0001825225,0.003798665],"genre_scores_gemma":[0.9950206,0.00003064918,0.004584513,0.00007684503,0.00005317734,0.00002156848,0.000009736825,0.000009273592,0.0001936406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9805613,"threshold_uncertainty_score":0.3725704,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02296155428959655,"score_gpt":0.3106609706660269,"score_spread":0.2876994163764303,"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."}}