Improved K-means clustering algorithm on space
Wenhui Li · Jisuanji yingyong yanjiu · 2008
This paper presented a quick speed spatial indexing structure which was based on R-link tree.And it used K-means algorithm in the structure.In K-means algorithm,adopted value-standard deviation to ascertain the initial clustering centres to improve convergence speed and ascertain ultimate K value by distance criterion function to make K value most suitable.The structure sometimes consumes more storage than R-link but gains better performance.Furthermore,data quantity more,this kind of structure overall performance is better.