Abstract

Clustering is an important concept for analysis of data in GIS. Due to the potentially large amount of data in such systems, the time complexity for clustering algorithms is critical. K-means is a popular clustering algorithm for large-scale systems because of its linear complexity. However, this requires a priori knowledge of the number of clusters and the subsequent selection of their centroids. We propose a method for K-means to find automatically the number of clusters and their associated centroids. Moreover, we consider recursive extension of the algorithm to improve visibility of the results at different levels of abstraction, in order to support the decision-making process.

Published in

Lecture Notes in Geoinformation and Cartography
2011, Volume: 5, number: 5, pages: 93-105
Book title: Information Fusion and Geographic Information systems: Towards the Digital Ocean
ISBN: 978-3-642-19765-9
Publisher: Springer

SLU Authors

• Thierfelder, Tomas

  • Department of Energy and Technology, Swedish University of Agricultural Sciences
    

UKÄ Subject classification

Information Science
Probability Theory and Statistics


Publication Identifiers

DOI: https://doi.org/10.1007/978-3-642-19766-6_8

Permanent link to this page (URI)

https://res.slu.se/id/publ/44177