Title of article
A Minimal Spanning Tree Algorithm Applied to Spatial Cluster Analysis
Author/Authors
Lage، نويسنده , , Juliano Palmieri and Assunçمo، نويسنده , , Renato Martins and Reis، نويسنده , , Edna Afonso، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
4
From page
162
To page
165
Abstract
Many applications, such as geographical regionalization and communication network districting, have problems that can be formulated as the clustering of n objects with contiguity constraints. In this paper, we present an algorithm based on recursive partitioning of a minimal spanning tree and a tool implementing it named SKATER. We also present some simulations where SKATER has been successfully used.
Keywords
optimization , Cluster analysis , Spatial cluster
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2001
Journal title
Electronic Notes in Discrete Mathematics
Record number
1453132
Link To Document