CFP last date
20 June 2024
Reseach Article

Efficient Algorithms for Pattern Mining in Spatiotemporal Data

by Nagasaranya N
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 106 - Number 8
Year of Publication: 2014
Authors: Nagasaranya N
10.5120/18543-9772

Nagasaranya N . Efficient Algorithms for Pattern Mining in Spatiotemporal Data. International Journal of Computer Applications. 106, 8 ( November 2014), 35-39. DOI=10.5120/18543-9772

@article{ 10.5120/18543-9772,
author = { Nagasaranya N },
title = { Efficient Algorithms for Pattern Mining in Spatiotemporal Data },
journal = { International Journal of Computer Applications },
issue_date = { November 2014 },
volume = { 106 },
number = { 8 },
month = { November },
year = { 2014 },
issn = { 0975-8887 },
pages = { 35-39 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume106/number8/18543-9772/ },
doi = { 10.5120/18543-9772 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:38:53.673766+05:30
%A Nagasaranya N
%T Efficient Algorithms for Pattern Mining in Spatiotemporal Data
%J International Journal of Computer Applications
%@ 0975-8887
%V 106
%N 8
%P 35-39
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Spatio-temporal data is any information relating to space and time. It is continually updated data with 1TB/hr are greatly challenging our ability to digest the data. With that data, it is unable to gain exact information. Data mining models contains many statistical models such as regression models of various kinds, cluster analysis models, covariance analysis models, principle component analysis models, outlier detection models(temporal, spatial, non-spatial), trend detection models, partial least squares models(prediction) and multiple variant visualization models. Most of these models find applications in spatial data mining and pattern discovery.

References
  1. R. V. Nehme and E. A. Rundensteiner, "SCUBA: Scalable Cluster- Based Algorithm for Evaluating Continuous Spatio-temporal Queries on Moving Objects," EDBT, 2006, pp. 1001-1019.
  2. Nanopoulos, Y. Theodoridis and Y. Manolopoulos, "C2P: Clustering based on closest pairs," VLDB, 2001, pp. 331-340.
  3. J. Kennedy and R. Eberhart, "Particle Swarm Optimization," Proceedings of IEEE International Conference on Neural Networks. IV, 1995.
  4. Y. Shi and R. Eberhart, "A modified particle swarm optimizer," Proceedings of IEEE International Conference on Evolutionary Computation, 1998, pp. 69–73.
  5. J. Kennedy, "The particle swarm: social adaptation of knowledge," Proceedings of IEEE International Conference on Evolutionary Computation, 1997, pp. 303–308.
  6. R. Poli, "An analysis of publications on particle swarm optimization applications," Technical Report CSM-469 (Department of Computer Science, University of Essex, UK), 2007.
  7. R. Poli, "Analysis of the publications on the applications of particle swarm optimization," Journal of Artificial Evolution and Applications, 2008, pp. 1–10.
  8. http://www. rtreeportal. org/index. php?option=com_content& task =view&id=30&itemid=43.
Index Terms

Computer Science
Information Sciences

Keywords

Spatio-Temporal Data Clustering Association Rule Pattern Discovery