Is it possible to use the shortest path to find a route to the cluster center (k-means)?
조회 수: 1 (최근 30일)
이전 댓글 표시
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
Image Analyst
2018년 9월 5일
Shortest path from what to where? Are you really wanting to know about solving the traveling salesman problem?
답변 (1개)
Walter Roberson
2018년 9월 6일
Perhaps you would be interested in https://www.mathworks.com/help/matlab/ref/graph.centrality.html#bu4486d-type Centrality perhaps 'closeness' measure.
댓글 수: 0
참고 항목
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!