2005 | OriginalPaper | Buchkapitel
A New and Efficient K-Medoid Algorithm for Spatial Clustering
Erschienen in: Computational Science and Its Applications – ICCSA 2005
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
A new
k
-medoids algorithm is presented for spatial clustering in large applications. The new algorithm utilizes the TIN of medoids to facilitate local computation when searching for the optimal medoids. It is more efficient than most existing
k
-medoids methods while retaining the exact the same clustering quality of the basic
k
-medoids algorithm. The application of the new algorithm to road network extraction from classified imagery is also discussed and the preliminary results are encouraging.