试用软件

I have five data points (A, B, C, D, E) in a two dimensional plane. Based on the euclidean distance between these points how can I group them?

1 次查看（过去 30 天）

显示更早的评论

Shaik Ahmad 2019-3-22

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/451650-i-have-five-data-points-a-b-c-d-e-in-a-two-dimensional-plane-based-on-the-euclidean-distance

评论： Shaik Ahmad 2019-3-22

I have five data points (A, B, C, D, E) in a two dimensional plane where three points (A, B, D) are close to each other and remaining two (C, E) are far from the group. If I calculate the distances between these points the results are

dist(A, B) = 0.3, dist(A, C) = 1.3, dist(A, D) = 0.15, dist(A, E) = 1.0, dist(B, C) = 0.9, dist(B, D) =0.2, dist(B, E) = 1.1, dist(C, D)=1.6, dist(C, E) = 1.0, dist(D, E) = 1.5.

Now if I choose a distance threshold as 0.6, I need to get a result as:

A, B, D (Closer to each other)

C (far from other points)

E (far from other points)

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

请先登录，再回答此问题。

回答（1 个）

KSSV 2019-3-22

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/451650-i-have-five-data-points-a-b-c-d-e-in-a-two-dimensional-plane-based-on-the-euclidean-distance#answer_366781

Read about kmeans.

3 个评论
显示 1更早的评论隐藏 1更早的评论

KSSV 2019-3-22

编辑：KSSV 2019-3-22

Yes...for kmeans you need to provide the number of clusters. Why don't you give your points. Let me give a trry.

Shaik Ahmad 2019-3-22

I found a solution for that.

I need to apply Hierarchical Clustering to get that output. Here There are functions called pdist and linkage which do the work.

Thank you for yout support @KSSV

请先登录，再进行评论。

请先登录，再回答此问题。

类别

AI, Data Science, and Statistics Statistics and Machine Learning Toolbox Cluster Analysis and Anomaly Detection

在 Help Center 和 File Exchange 中查找有关 Cluster Analysis and Anomaly Detection 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Translated by

试用软件