推荐系统:非个性化推荐Non-personalized recommendation
来源:互联网 发布:遗传算法有什么用 编辑:程序博客网 时间:2024/05/20 02:27
http://blog.csdn.net/pipisorry/article/details/39507699
推荐系统之非个性化推荐Non-personalized recommendation,主要包含aggregated opinion recommenders,产品关联推荐,时间敏感推荐。
个性化推荐参考[推荐系统:个性化推荐-协同过滤 ][海量数据挖掘MMDS week4: 推荐系统Recommendation System]
Aggregated opinion recommenders
The Story of Zagat
。。。
Drawback of Zagat
Some early Zagat fans argue the guide has been getting worse. Why?
All the restaurants with the similar scores
Too many mediocre restaurants with good scores
Too many excellent restaurants with mediocre scores
Reasons
Self-selection bias
ratings from recent users
Users of B&B
Increased diversity of raters for fancy hotels and restaurant
No free water, free spaghetti at fancy restaurants
Free WIFI, free breakfast, free parking at fancy hotels
French meals at Guide Michelin
How to Compare
Item A: {5, 5, 4, 5, 5, 5}
Item B: {5}
Ranking Scores: Damped Means
Problem: few ratings
E.g., Only one 5-star rating
Solution
Assume that everything is average without evidence
Ratings are evidence of non-averageness
k: a parameter
mu: the average rating of all the items in the system
Here, n is the number of votings
Ranking Scores: Confidence Interval
Assume certain data distribution for the rating
Lower and upper bound of statistical confidence interval (95%)
Choice of bounds
Lower bound: conservative recommendations
Upper bound: risky for amazing recommendations
皮皮blog
产品关联推荐Product association recommendation
{A simple kind of Context-aware Non-personalized recommendation, 其实就是一种数据挖掘方法}
交易数据库Transaction Database
关联计算
X: take the treatment; !X: not take the treatment
Y: the output occurs; !Y: the output does not occur
How to measure this treatment effect?
两种方法:
计算因果关系Causal Effect:lift
P(Y|X)-P(Y|!X) or P(Y|X)/P(Y|!X)
Adjust by looking at whether X makes Y more likely than not X (!X)
Focus on the increase in Y associated with X
如计算X = “anchovy paste” (凤尾鱼酱), Y=“banana”,lift值很小,接近1;而计算X = “anchovy paste”, Y=“garlic paste” (蒜泥)lift值比1大得多。
关联Association
讨论
上下文感知推荐Context-aware recommendation
Simple context: conditioned on one item(产品关联推荐就是其中一种)
Complex context: conditioned on a set of items, or considering the sequence of these items
非个性化和个性化推荐Non-personal or Personal recommendation
Computing P(Y|X) and P(Y|!X) over all the data
Computing P(Y|X) and P(Y|!X) over the data from the users who have similar tastes to a target user(lift计算中,如果计算数据只来自与当前用户相关的用户,则非个性化推荐就变成了个性化推荐了)
皮皮blog
时间敏感排序Time Sensitive Ranking for non-personalized recommendation
{尤其对新闻推荐有效}
时移Time-shifting
News aggregator: Old news is not interesting even if it has many net upvotes
时移推荐公式
Ad-hoc methods
Reddit Ranking for News
reddit是一个新闻推荐网站,其推荐公式如下
U: #upvotes
D: #downvotes
t_post: time when this news published
Note:
1 第1部分可知,顶的多的和贬的多的都可能被推荐到主页上。第2部分才是对时间的简单处理。
2 第1部分中,对投票取对数的原因:Log term applied to votes: Decrease marginal value of later votes.这样在顶的数量到达很高水平时,其增量会减缓。
3 第2部分Buries items with negative votes。
[Reddit]
HackerNews Ranking for News
U: #upvotes
D: #downvotes
t_now: time for now
t_post: time when this news published
alpha: 0.8
gamma: 1.8
P: penalty term for different items
from:http://blog.csdn.net/pipisorry/article/details/39507699
ref: ICT Luoping's recsys lessons, summer 2016*
- 推荐系统:非个性化推荐Non-personalized recommendation
- 推荐系统论文阅读——Factorizing Personalized Markov Chains for Next-Basket Recommendation
- 推荐系统:Collaborative recommendation
- 个性化推荐系统入门
- 个性化推荐系统
- 下一代个性化推荐系统
- 下一代个性化推荐系统
- 个性化推荐系统
- 个性化推荐系统
- 个性化推荐系统简述
- 个性化推荐系统概述
- 个性化推荐系统简介
- 动手构建一个推荐系统(Recommendation System)
- 推荐系统:个性化推荐-协同过滤
- 实时个性化推荐系统简述
- 个性化检索与推荐系统
- 个性化推荐系统技术总结
- BPR:个性化排名推荐系统
- matlab:寻找峰值(波峰,波谷)
- BUFFER CACHE(转自tjpanda88)
- python
- JAVA基础加强:内省
- 哪几个人参加了会议?
- 推荐系统:非个性化推荐Non-personalized recommendation
- C++命令行方式编译、链接、运行程序
- 纯CSS3 实现的新闻联播图标动画
- python 进制间相互转换
- android(java) socket判断网络连接状态
- apply和call的用法
- 【转载】(转载)关于IAP与APP互相跳转的实现
- 大数据挑战与NoSQL数据库技术(阅读笔记)
- Nginx配置文件nginx.conf中文详解