Title of article
An extended k-means technique for clustering moving objects
Author/Authors
Ossama, Omnia Cairo University - Faculty of Computers and Information, Egypt , Mokhtar, Hoda M.O. Cairo University - Faculty of Computers and Information, Egypt , El-Sharkawi, Mohamed E. Cairo University - Faculty of Computers and Information, Egypt
From page
45
To page
51
Abstract
k-means algorithm is one of the basic clustering techniques that is used in many data mining applications. In this paper we present a novel pattern based clustering algorithm that extends the k-means algorithm for clustering moving object trajectory data. The proposed algorithm uses a key feature of moving object trajectories namely, its direction as a heuristic to determine the different number of clusters for the k-means algorithm. In addition, we use the silhouette coefficient as a measure for the quality of our proposed approach. Finally, we present experimental results on both real and synthetic data that show the performance and accuracy of our proposed technique.
Keywords
Clustering moving objects , Moving objects databases , Mining moving object trajectories , K , means clustering algorithm
Journal title
Egyptian Informatics Journal
Journal title
Egyptian Informatics Journal
Record number
2620851
Link To Document