Application of Dimensionality Reduction in Recommender ：在推荐的降维的应用.pptVIP

Application of Dimensionality Reduction in Recommender Systems--A Case Study Badrul M. Sarwar, George Karypis, Joseph A. Konstan, and John T. Riedl GroupLens Research Group Department of Computer Science and Engineering University of Minnesota Talk Outline Introduction to Recommender Systems (RS) Challenges Dimensionality Reduction as a Solution Experimental Setup and Results Conclusion Recommender Systems Problem Information Overload Too Many Product Choices Solution Recommender Systems (RS) Collaborative Filtering Collaborative Filtering Representation of input data Neighborhood formation Prediction/Top-N recommendation Target Customer Challenges of RS Scalability Enormous size of customer-product matrix Slow neighborhood search Slow prediction generation Sparsity May hide good neighbors Results in poor quality and reduced coverage products Customers Challenges of RS Synonymy Similar products treated differently Increases sparsity, loss of transitivity Results in poor quality Example C1 rates recycled letter pads High C2 rates recycled memo pads High Both of them like Recycled office products Idea: Dimensionality Reduction Latent Semantic Indexing Used by the IR community for document similarity Works well with similar vector space model Uses Singular Value Decomposition (SVD) Main Idea Term-document matching in feature space Captures latent association Reduced space is less-noisy SVD: Mathematical Background = R m X n U m X r S r X r V’ r X n Sk k X k Uk m X k Vk’ k X n The reconstructed matrix Rk = Uk.Sk.Vk’ is the closest rank-k matrix to the original matrix R. Rk SVD for Collaborative Filtering m x m similarity Top-N Recommendation Prediction (CF algorithm) 3. Neighborhood Formation . 2. Direct Prediction m x n 1. Low dimensional representation O(m+n) storage requirement m x k k x n Exp