{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003604164,0.000614908,0.0008137218,0.0003958638,0.000335123,0.0007500289,0.001916182,0.0004093696,0.00001465607],"category_scores_gemma":[0.0001923175,0.0005402661,0.0002314718,0.0006103936,0.00007408698,0.00142986,0.000185241,0.0004402643,0.0001772137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004381221,"about_ca_system_score_gemma":0.0003395086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005895549,"about_ca_topic_score_gemma":0.00004883671,"domain_scores_codex":[0.9953591,0.0005505334,0.0009459836,0.001176438,0.001072514,0.0008954513],"domain_scores_gemma":[0.9955459,0.0003444323,0.000513349,0.002470442,0.000566964,0.0005588998],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001280348,0.0004668939,0.0001293531,0.0003213179,0.00006513933,0.00001265918,0.0001647694,0.001366349,0.0001448524,0.01065387,0.9814409,0.005105855],"study_design_scores_gemma":[0.003949575,0.0008333994,0.00006594655,0.0004526805,0.00006372844,0.00003521624,0.0001019638,0.6668477,0.009614345,0.002967303,0.313821,0.001247131],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004252297,0.0002290726,0.9818955,0.0054964,0.004355551,0.002349149,0.001077617,0.001144296,0.003027179],"genre_scores_gemma":[0.9006675,0.00002048586,0.09128194,0.002998254,0.001046611,0.001494686,0.001677259,0.0001653765,0.0006478537],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9002423,"threshold_uncertainty_score":0.9997049,"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."}}