Skip to main navigation Skip to search Skip to main content

Beyond K-means: Clusters Identification for GIS.

Publication: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review

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.
Original languageEnglish
Title of host publicationInformation Fusion and Geographic Information systems: Towards the Digital Ocean
PublisherSpringer
Pages93-105
Number of pages13
ISBN (Print)978-3-642-19765-9
DOIs
Publication statusPublished - 2011

Publication series

SeriesLecture Notes in Geoinformation and Cartography
ISSN1863-2246

Cite this