{"id":"W4236644679","doi":"10.1109/trustcom.2015.563","title":"Similarity Measure Based on Low-Rank Approximation for Highly Scalable Recommender Systems","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Trustcom/BigDataSE/ISPA","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Collaborative filtering; Recommender system; Scalability; Singular value decomposition; Computer science; Low-rank approximation; Rank (graph theory); Similarity (geometry); Computation; Sparse matrix; Matrix decomposition; Similarity measure; Data mining; Measure (data warehouse); Matrix (chemical analysis); Approximation algorithm; Theoretical computer science; Artificial intelligence; Information retrieval; Algorithm; Mathematics; Database","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.002054907,0.0008259699,0.00197983,0.001514109,0.0006535396,0.001489972,0.001557341,0.00117748,0.001868999],"category_scores_gemma":[0.01000294,0.0003913508,0.0008413583,0.002363784,0.0006380876,0.002479473,0.00103567,0.001561478,0.0009569274],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009305346,"about_ca_system_score_gemma":0.0009762834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005775954,"about_ca_topic_score_gemma":0.004272945,"domain_scores_codex":[0.9974179,0.0007338267,0.0001778239,0.0004439574,0.001111994,0.0001144837],"domain_scores_gemma":[0.9961636,0.001892699,0.0003395596,0.0006726845,0.0008323193,0.000099217],"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.0002345783,0.0002168535,0.001913974,0.0002975066,0.0002011491,0.000187554,0.0001716547,0.65747,0.009243084,0.04943409,0.006762614,0.2738669],"study_design_scores_gemma":[0.000007221251,0.00003240553,0.000154623,0.000004191601,0.000008040076,0.00002752013,0.000008408284,0.9935071,0.0005236138,0.005141168,0.0005773602,0.000008305072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007133618,0.0004581538,0.9912384,0.0001008345,0.00004059701,0.00004456005,0.00005938421,0.0002747632,0.0006495608],"genre_scores_gemma":[0.4058024,0.001028127,0.5889891,0.0001926519,0.0002469275,0.0002489639,0.000717084,0.00008805865,0.002686734],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005775954,"threshold_uncertainty_score":0.01148468,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06989256042492434,"score_gpt":0.2911472116759939,"score_spread":0.2212546512510696,"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."}}