Efficient spatial clustering algorithm using binary tree

Authors:
Mohsin Ali;Xue Li;Zhao Yang Dong
Affiliations:
School of Information Technology and Electrical Engineering, The University of Queensland, Brisbane, Australia;School of Information Technology and Electrical Engineering, The University of Queensland, Brisbane, Australia;School of Information Technology and Electrical Engineering, The University of Queensland, Brisbane, Australia
Venue:
IDEAL'05 Proceedings of the 6th international conference on Intelligent Data Engineering and Automated Learning
Year:
2005

Citing 10
Cited 0

Algorithms & data structures

Algorithms & data structures
Data structures and algorithm analysis

Data structures and algorithm analysis
Multidimensional access methods

ACM Computing Surveys (CSUR)
Cluster validity methods: part I

ACM SIGMOD Record
Data Structures and Algorithms

Data Structures and Algorithms
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Chameleon: Hierarchical Clustering Using Dynamic Modeling

Computer
Combining Image Compression and Classification Using Vector Quantization

IEEE Transactions on Pattern Analysis and Machine Intelligence
An Efficient k-Means Clustering Algorithm: Analysis and Implementation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast and Robust General Purpose Clustering Algorithms

Data Mining and Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.