Dynamic k-means: a clustering technique for moving object trajectories
by Omnia Ossama; Hoda M.O. Mokhtar; Mohamed E. El-Sharkawi
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 6, No. 4, 2012

Abstract: k-means clustering algorithm is a famous clustering algorithm applied in many applications. However, traditional k-means algorithm assumes that the initial number of centroids is known in advance. This dependence on the number of clusters and the initial choice of the centroids affect both the performance and accuracy of the algorithm. To overcome this problem, in this paper, we propose a heuristic that dynamically calculates k based on the movement patterns in the trajectory dataset and optimally initialises the k centroids. We basically consider distinct similar moving patterns as an initialisation for the number of clusters (k). In addition, we design a scalable tool for mining moving object data through (an architecture composed of) a rich set of cluster refinement modules that operate on top of the moving object database enabling users to analyse trajectory data from different perspectives. We validate our approaches experimentally on both real and synthetic data and test the performance and accuracy of our techniques.

Online publication date: Sat, 16-Aug-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Information and Database Systems (IJIIDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com