Skip to main content
David's Blog
About
Algorithm
Framework
Data Structure
Linear
Tree
Graph
Set
Search
DFS
BFS
FOR
Optimization
Decrease & Conquer
Dynamic Programming
Math
FAQ
AI
Recommender System
Retrieval
Pre-Ranking
Ranking
Re-Ranking
Metrics
Generative Models
Computer Science
Core
Network
Operating System
Design
Design Pattern
Object-Oriented Design
System Design
Engineering
Database
MySQL
Redis
Lang
Java
DevOps
Unix
Tools
Tests
TOEFL
LISTENING
READING
SPEAKING
WRITING
GRE
QUANTITATIVE
VERBAL
ItemCF
David Liu
12/15/25
Less than 1 minute
ItemCF
喜欢物品
i
1
i_1
i
1
的用户记作集合
w
1
w_1
w
1
喜欢物品
i
2
i_2
i
2
的用户记作集合
w
2
w_2
w
2
定义交集
v
=
W
1
∩
W
2
v=W_1\cap W_2
v
=
W
1
∩
W
2
两个物品的相似度:
s
i
m
(
i
1
,
i
2
)
=
∣
v
∣
∣
w
1
∣
⋅
∣
w
2
∣
sim(i_1,i_2)=\frac{|v|}{\sqrt{|w_1|\cdot|w_2|}}
s
im
(
i
1
,
i
2
)
=
∣
w
1
∣
⋅
∣
w
2
∣
∣
v
∣
Prev
Bloom Filter
Next
Matrix Completion 矩阵补充