K-means clustering, is it possible to get vertical boundaries?

Question

John 2012-3-3

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/31043-k-means-clustering-is-it-possible-to-get-vertical-boundaries

采纳的回答： Tom Lane

Hello,

I have performed K-means clustering on some data and formed 3 clusters. Here is a graph

http://dl.dropbox.com/u/54057365/All/cluster.JPG

One thing that I notice is that the boundaries between the clusters are horizontal.

In my case, I have a congestion percentage plotted against average velocity. Naturally as the congestion percentage increases the average velocity decrease. However it would be more intuitive if the boundaries were vertical not horizontal.

Is it possible to do this with clustering algorithms?

Sincere thanks

John

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

请先登录，再进行评论。

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

Answer 1

Tom Lane 2012-3-3

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/31043-k-means-clustering-is-it-possible-to-get-vertical-boundaries#answer_39519

在 MATLAB Online 中打开

I believe the boundaries are horizontal because the scale of the y variable is much larger. Differences in the y direction dominate the measure of the distance between two points. You could simply cluster on the x variable. You could also experiment with clustering on other matrices that adjust the x and y scale:

[x,y/10] or [100*x,y] or ...

and see if you find any of the results appealing.