I have the following 9 clusters (each colour represent the appropriate cluster):

enter image description here

I am looking for a clustering algorithm (if any) that would achieve "realistic" results.

The data represents Vancouver's bus stops, crossings, gates, stations etc (as you can see in the left side of the image).

I 've tried K-Means and I obviously had some bad results since it uses the Euclidean distance as its metric and that's not applicable in this scenario. I am using WEKA.

1 Answer 1


The method and script described in Graph/Network building and analysis of linked polygons in ArcGIS for Desktop? are applicable to any network, e.g.

enter image description here


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.