Is it possible to use the shortest path to find a route to the cluster center (k-means)?

2 次查看（过去 30 天）

Asyran Abdullah 2018-9-3

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/417347-is-it-possible-to-use-the-shortest-path-to-find-a-route-to-the-cluster-center-k-means

回答： Walter Roberson 2018-9-6

Hi, I tried to make some modifications in the k-means clustering, using the shortest path(based on weights) to find the center of the cluster, who knows whether it can be done? The diagram below explains what I mean:

Figure 1: use normal kmeans to connect each node to center of cluster

Figure 2: use shortest path to connect each node to center of cluster

Please provide advice and resources if any.

Thanks

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

Asyran Abdullah 2018-9-5

Thanks sir, but is there another way to find shortest path in cluster?

Image Analyst 2018-9-5

Shortest path from what to where? Are you really wanting to know about solving the traveling salesman problem?

If so, see https://www.mathworks.com/help/optim/examples/travelling-salesman-problem.html?s_tid=srchtitle

请先登录，再进行评论。

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

回答（1 个）

Walter Roberson 2018-9-6

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/417347-is-it-possible-to-use-the-shortest-path-to-find-a-route-to-the-cluster-center-k-means#answer_335644

Perhaps you would be interested in https://www.mathworks.com/help/matlab/ref/graph.centrality.html#bu4486d-type Centrality perhaps 'closeness' measure.

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

请先登录，再进行评论。

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

类别

AI and Statistics Statistics and Machine Learning Toolbox Cluster Analysis and Anomaly Detection Nearest Neighbors

在 Help Center 和 File Exchange 中查找有关 Nearest Neighbors 的更多信息

Community Treasure Hunt

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

Start Hunting!

Translated by