知识卡片
集合相似忽略评分强度
Jaccard用两个物品集合的交集大小除以并集大小,描述共同选择占整体选择的比例。先要定义哪些事件进入集合,例如浏览、评分或喜欢;集合本身不保留评分强度,不能说它直接使用每个绝对评分。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- · 查看原书依据
There exist a lot of similar algorithms, and Jaccard is one of them. Straightforwardly, given customers, C1 and C3, N(C1) and N(C3) are products liked by C1 and C3, respectively. Customers’ preference for a product can be computed as shown in Fig. (3).
参考来源
- 位置:《Artificial Intelligence and Data Science in Recommendation System: Current Trends, Technologies, and Applications》第08章《协同与内容电影推荐》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Artificial Intelligence and Data Science in Recommendation System: Current Trends, Technologies, and Applications/_epub-src/OEBPS/Text/9789815136746-C8.html)
- 结论依据:摘录中关于集合相似忽略评分强度的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:There exist a lot of similar algorithms, and Jaccard is one of them. Straightforwardly, given customers, C1 and C3, N(C1) and N(C3) are products liked by C1 and C3, respectively. Customers’ preference for a product can be computed as shown in Fig. (3).