Efficient spatial clustering algorithm using binary tree


Autoria(s): Ali, Mohsin; Li, Xue; Dong, Zhao Yang
Contribuinte(s)

Marcus Gallagher

James Hogan

Frederic Marie

Data(s)

01/01/2005

Resumo

In this paper we present an efficient k-Means clustering algorithm for two dimensional data. The proposed algorithm re-organizes dataset into a form of nested binary tree*. Data items are compared at each node with only two nearest means with respect to each dimension and assigned to the one that has the closer mean. The main intuition of our research is as follows: We build the nested binary tree. Then we scan the data in raster order by in-order traversal of the tree. Lastly we compare data item at each node to the only two nearest means to assign the value to the intendant cluster. In this way we are able to save the computational cost significantly by reducing the number of comparisons with means and also by the least use to Euclidian distance formula. Our results showed that our method can perform clustering operation much faster than the classical ones. © Springer-Verlag Berlin Heidelberg 2005

Identificador

http://espace.library.uq.edu.au/view/UQ:102607

Idioma(s)

eng

Publicador

Springer

Palavras-Chave #E1 #280000 Information, Computing and Communication Sciences #700103 Information processing services
Tipo

Conference Paper