题目
多项选择题
In k-means clustering, what is the primary goal of the algorithm? (you can choose more than one)
选项
A.a. To partition the data into clusters such that intra-cluster similarity is high and inter-cluster similarity is low
B.b. To maximise the distance between all data points
C.c. To identify outliers in the dataset
D.d. To reduce the dimensionality of the dataset
查看解析
标准答案
Please login to view
思路分析
The question asks about the primary goal of k-means clustering and allows selecting more than one option.
Option a: 'To partition the data into clusters such that intra-cluster similarity is high and inter-cluster similarity is low' — This is indeed the core objective of k-means. The algori......Login to view full explanation登录即可查看完整答案
我们收录了全球超50000道考试原题与详细解析,现在登录,立即获得答案。
类似问题
Which of the following statements about the K-means clustering algorithm is true?
K-Means involves computing distances in input space and assigning data points to the nearest prototype points. What can one say about these prototype points? I Every cluster has its data assigned to the nearest prototype point. II They are not restricted to being data points in the training set. III They are necessarily included in the training set. IV They are usually referred to as centroids.
A retail chain wants to group its 2 million customers based on purchase behavior. Analysts consider using K-Means because they need fast runtime and easy interpretability, but the leadership team worries whether the method assumes overly simple cluster shapes. What limitation of K-Means should the team be most concerned about?
Your retail analytics team is trying to group customers into clear segments based on buying behavior, purchasing channels, and store proximity. The leadership team wants each customer assigned to exactly one group—similar to the customer profiles shown below—so that marketing and pricing strategies can be targeted without any overlap. Which clustering method best fits this requirement?
更多留学生实用工具
希望你的学习变得更简单
加入我们，立即解锁 海量真题 与 独家解析，让复习快人一步！