1 / 31

协同过滤中两个问题探讨

协同过滤中两个问题探讨. Related papers : Modeling Evolutionary Behaviors for Community-based Dynamic Recommendation --SIAM 2. Learning Preferences of New Users in Recommender System : An Information Theoretic Approach --SIGKDD. 演讲人:余海洋 2011:12:10. Will user U like item X?.

hedy
Download Presentation

协同过滤中两个问题探讨

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. 协同过滤中两个问题探讨 Related papers : Modeling Evolutionary Behaviors for Community-based Dynamic Recommendation --SIAM 2. Learning Preferences of New Users in Recommender System : An Information Theoretic Approach --SIGKDD 演讲人:余海洋 2011:12:10

  2. Will user U like item X?

  3. 1.Content-based filtering • 2. Collaborative filtering(协同过滤) • 3.Hybrid approaches

  4. Cold start Dynamic Recommendation

  5. Cold Start

  6. How to choose items? Popularity Entropy Entropy0 HELF : harmonic mean of Entropy and logarithm of Frequency IGCN : Information Gain through Clustered Neighbors

  7. 1. PopularityIndicates how frequently users rated the item Uninformative Prefix bias

  8. 2. EntropyRepresents the dispersion of opinion of users on the item It often selects very obscure items Suggests “garbage” patterns to be useful as well. Do not considers the frequency .

  9. 3. Entropy0 Bias frequently-rated too much

  10. 4. HELFHarmonic mean of Entropy and logarithm of Frequency

  11. 4. HELFHarmonic mean of Entropy and logarithm of Frequency

  12. 5. IGCNInformation Gain through Clustered Neighbors IGCN works by repeatedly computing information gain of items where the necessary rating data is considered only from those users who match best with the target users profile so far

  13. 5. IGCNInformation Gain through Clustered Neighbors Missing values Inadequate goals

  14. 5. 1 Missing values

  15. 5. 2 Inadequate goals Find the final best k neighbors

  16. 5. IGCNInformation Gain through Clustered Neighbors

  17. Offline Experiments

  18. Offline Experiments

  19. Dynamic Recommendation 用户兴趣的变化 物品流行度的变化 季节效应

  20. CBDB Community-based Dynamic Recommendation

  21. CBDB

  22. Formal community construction People from the same department of same company tend to have similar interests , since they tend to have similar background and are working on similar projects.

  23. Dynamic pattern analysis Freshness of documents Short-term of long-term type of document Popularity of documents User intention

  24. Short-term of long-term type of document

  25. Short-term of long-term type of document

  26. CBDB

  27. Adaptive community model Time-Sensitive Adaboost

  28. Time-Sensitive Adaboost

  29. Experimental Results

  30. Thank You

More Related