Some of the formulae that we have come across in Chapters 6 & 7 are listed below. Match each of these to the name they are most commonly known by, assuming two instances a and b and an m-dimensional feature space. 单项选择题
A
Euclidean Distance(a,b)
B
Manhattan Distance(a,b)
C
Minkowski Distance(a,b)
登录即可查看完整答案
我们收录了全球超50000道真实原题与详细解析,现在登录,立即获得答案。
类似问题
In a k-Nearest Neighbors algorithm, similarity of records is based on the .
Which of the following distance metrics is particularly effective for high-dimensional data but less interpretable compared to other metrics?
When the number of features is large, kNN should use _______.
How did Egyptian culture and governance change during the Ptolemaic period compared to the pharaonic period?
更多留学生实用工具
希望你的学习变得更简单
加入我们,立即解锁 海量真题 与 独家解析,让复习快人一步!