Cluster Analysis of Temporal Data using Maximum Likelihood Estimation

Authors

  • Prof. Sweta C. Morajkar  Computer Department, Don Bosco College of Engineering, Fatorda, Margao, Goa, India
  • Durga Karapurkar  Computer Department, Don Bosco College of Engineering, Fatorda, Margao, Goa, India

Keywords:

Clustering, Temporal Data, Maximum Likelihood

Abstract

Due to rapid growth of technologies, a large amount of data gets generated. The need arises to handle this data for retrieving and analyzing useful information. Clustering of temporal data has been explored using evolutionary clustering. However the time dimension associated with the record has not been considered. Traditional clustering algorithms usually focus on grouping data objects based on similarity function. However, if temporal dimension is incorporated, it allows to perform cluster analysis for evolving patterns. Temporal data clustering extends traditional clustering mechanisms and provides underpinning solutions for discovering the condensing information over the period of time. This paper proposes a methodology for clustering records based on time frame. The proposed methodology first clusters the records based on time frame. When a new query record comes, using maximum likelihood estimation we try to identify its true representative cluster. The assignment of query record to a particular cluster is based on the distance measure.

References

  1. A.K. Jain, M.N Murty, P.J. Flynn The Ohio State University ,”Data Clustering: A Review “,ACM Computing Surveys, Vol. 31, No. 3, September 1999
  2. Pei Li, Xin Luna Dong, Andrea Maurino, Divesh Srivastava,”Linking Temporal Records”,Proceedings of the VLDB Endowment, Vol. 4, No. 11 Copyright 2011 VLDB Endowment 2150 8097/11/08
  3. Jong Soo Kim, Myoung Ho Kim, “On Effective Data Clustering in Bitemporal Databases” Temporal Representation and Reasoning, 1997. (TIME '97), Proceedings., Fourth International Workshop on Temporal data.
  4. Cen Li,Gautam Biswas A Bayesian Approach to Temporal Data Clustering using Hidden Markov Models International Conference on Machine Learning (ICML 2000)
  5. C. C. Aggarwal, J. Han, J. Wang, P. S. Yu. A framework for clustering evolving data streams. In Proc. of VLDB, 2003
  6. Hanghang Tong, Yasushi Sakurai, Tina Eliassi-Rad, Christos Faloutsos. Fast mining and forecasting of complex time-stamped events, CIKM’08, October 26–30, 2008, Napa Valley, California, USA. Copyright 2008 ACM 978-1-59593-991-3/08/10
  7. Marios Hadjieleftheriou, George Kollios, Dimitrios Gunopulos, Vassilis J. Tsotras, On-line discovery of dense areas in spatio-temporal databases. In: Proc. of SSTD. (2003)
  8. Clustering Data Stream: A survey of Algorithms, International Journal of Knowledge-based and Intelligent Engineering Systems, Volume 13 Issue 2, April 2009

Downloads

Published

2018-04-30

Issue

Section

Research Articles

How to Cite

[1]
Prof. Sweta C. Morajkar, Durga Karapurkar, " Cluster Analysis of Temporal Data using Maximum Likelihood Estimation, International Journal of Scientific Research in Science and Technology(IJSRST), Online ISSN : 2395-602X, Print ISSN : 2395-6011, Volume 4, Issue 5, pp.1099-1103, March-April-2018.