Back to marketplace
Unit 3: Clustering and Classification Algorithms
No description yet. This curated deck is ready for daily study.
Total cards: 4•Content version: v4•Public deck•Updated: 8/1/2026
Card preview (4)
#1
Front (Question)
3 Properties of a distance metric
Back (Answer)
• Positivity • Symmetry • Triangle Inequality
#2
Front (Question)
3 Properties of a distance metric Positivity
Back (Answer)
a) d(x, y) ≥ 0 for all x and y b) d(x, y) = 0 only if x = y
#3
Front (Question)
3 Properties of a distance metric Symmetry
Back (Answer)
d(x, y) = d(y, x) for any x and y
#4
Front (Question)
3 Properties of a distance metric Triangle inequality
Back (Answer)
d(x, z) ≤ d(x, y) + d(y, x) for any x, y and z