{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002304422,0.0007637125,0.001273351,0.0009880936,0.000682431,0.001277677,0.001240599,0.001122147,0.002025326],"category_scores_gemma":[0.007185929,0.0008222649,0.001424847,0.001541862,0.0006829476,0.002223192,0.0008965347,0.001848144,0.0007045271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001315826,"about_ca_system_score_gemma":0.001358314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03541532,"about_ca_topic_score_gemma":0.02965856,"domain_scores_codex":[0.9985777,0.0005318882,0.00006130142,0.0003357076,0.0003568542,0.000136467],"domain_scores_gemma":[0.996807,0.002203541,0.0002763194,0.0002827567,0.0003288006,0.0001017242],"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.0001817447,0.00009954242,0.002545105,0.0001844284,0.0001733585,0.0001563965,0.0002287083,0.7782351,0.003060792,0.09310482,0.005519163,0.1165109],"study_design_scores_gemma":[0.000007718375,0.00001640976,0.0001448922,0.000004106797,0.000006367627,0.00001787172,0.00000455494,0.9870472,0.0001362899,0.01219773,0.0004104656,0.000006384883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01731654,0.0006394292,0.9797489,0.0003539675,0.0000432267,0.00003881204,0.0001975654,0.0004213222,0.001240261],"genre_scores_gemma":[0.7307484,0.001854043,0.2586445,0.0002665083,0.0002222865,0.000228219,0.0009644676,0.00009202518,0.006979568],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03541532,"threshold_uncertainty_score":0.07041836,"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."}}