High-performance Space Index Method Based on K-means Algorithm
Wenhui Li · Jisuanji gongcheng · 2008
This paper presents a quick speed spatial index structure based on R-link tree.And K-means algorithm in the structure is used.In K-means algorithm,value-standard deviation is adopted to ascertain the initial clustering centres to improve convergence speed and ultimate K value is ascertained by distance criterion function to make K value most suitable.The structure sometimes consumes more storage than R-link but gains better performance.Furthermore,the more data quantities,the better this kind of structure's overall performance is.