Open Access Open Access  Restricted Access Subscription or Fee Access

A General K-Mean Clustering Algorithm Based On Constrained Dynamic Time Warping Distance Measure

V.K. Bhuvaneswari, Dr. V. Anuratha


Clustering is a division of data into groups of similar objects. Each group, called cluster, consists of objects that are similar between themselves and dissimilar to objects of other groups. In high dimensional data space, clusters are likely to exist in different subspaces. General K-Mean (GKM) is a classic clustering algorithm, but it cannot be used to find subspace clusters. In this work, Dynamic Time Warping (DTW) is a much more dynamic distance measure for time series, allowing comparable shapes to competition even this work is out of phase in the time association. It permits a non-linear illustration of single suggestion to a different by reducing the space among the two. A decade back, DTW was establishing into Data Mining neighborhood as effectiveness for different responsibilities for moments sequence evils including categorization, group, and variance discovery. Experimental results make obvious that the DTW advances create better performance than GKM clustering algorithms.


Cluster, K-Mean, General K-Mean, Dynamic Time Warping (DTW), Distance Measure.

Full Text:



Aniket Rangrej, Ashish V Tendulkar and Sayali Kulkarni 2011. Comparative study of clustering techniques for short text documents In Proceedings of the 20th international conference companion on World Wide Web. pp.111-112.

Alessandro Finamore, Marco Mellia and Michela Meo 2011. Mining unclassified traffic using automatic clustering techniques.In Traffic Monitoring and Analysis, Springer Berlin Heidelberg. vol. 6613, pp.150-163.

Kanungo, Tapas, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, and Angela Y. Wu 2002. An efficient k-means clustering algorithm: Analysis and implementation. Pattern Analysis and Machine Intelligence. IEEE Transactions on 24. no. 7: 881-892.

Alsabti, Khaled, Sanjay Ranka, and Vineet Singh 1997. An efficient k-means clustering algorithm.

Zhong and Shi2005. Efficient online spherical k-means clustering. In Neural Networks IEEE International Joint Conference on. vol. 5, pp. 3180-3185.

Pollard, David 1981. Strong consistency of $ k $-means clustering. The Annals of Statistics 9, no. 1.

Huang, Joshua Zhexue, Michael K. Ng, Hongqiang Rong, and Zichen Li 2005. Automated variable weighting in k-means type clustering." Pattern Analysis and Machine Intelligence. IEEE Transactions on 27, no. 5 657-668.

Zhang Zhe, Zhang Junxi and Xue Huifeng 2001. Improved K-Means Clustering Algorithm.Congress on Image and Signal Processing. Vol. 5, Pp. 169-172.

Yanfeng Zhang, Xiaofei Xu and Yunming Ye 2010. NSS-A K-means: An Agglomerative Fuzzy K-means clustering method with automatic selection of cluster number.Vol. 2, Pp. 32-38, 2010.

Trujillo M and Izquierdo E 2005. Combining K-means and semivariogram-based grid clustering. Pp. 9-12.

Mantena, Gautam, and Xavier Anguera. "The probability-based DTW for motion appreciation."Acoustics, Speech and Signal Processing (ICASSP), 2013 IEEE International Conference on. IEEE, 2013.

TarikArici, SaitCelebi, Ali S. Aydin, Talha T. Temiz. "Robust gesture recognition using feature pre-processing and weighted dynamic time warping." Multimedia Tools and Applications (2013): 1-18.

Keogh, Eamonn, and Chotirat Ann Ratanamahatana. "Exact indexing of dynamic time warping." Knowledge and information systems 7.3 (2005): 358-386.

Zhen, Dong, T. Wang, F. Gu, A.D. Ball, "Fault diagnosis of motor drives using stator current signal analysis based on dynamic time warping." Mechanical Systems and Signal Processing 34.1 (2013): 191-202.

Myers, Cory, Lawrence Rabiner, and Aaron E. Rosenberg. "Performance tradeoffs in dynamic time warping algorithms for isolated word recognition."Acoustics, Speech and Signal Processing, IEEE Transactions on 28.6 (1980): 623-635.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.