CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Clustering Algorithms for Moving Object Shape and Time Constrains Basis

by S. Santhosh Baboo, K. Tajudin
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 82 - Number 1
Year of Publication: 2013
Authors: S. Santhosh Baboo, K. Tajudin
10.5120/14082-2080

S. Santhosh Baboo, K. Tajudin . Clustering Algorithms for Moving Object Shape and Time Constrains Basis. International Journal of Computer Applications. 82, 1 ( November 2013), 33-38. DOI=10.5120/14082-2080

@article{ 10.5120/14082-2080,
author = { S. Santhosh Baboo, K. Tajudin },
title = { Clustering Algorithms for Moving Object Shape and Time Constrains Basis },
journal = { International Journal of Computer Applications },
issue_date = { November 2013 },
volume = { 82 },
number = { 1 },
month = { November },
year = { 2013 },
issn = { 0975-8887 },
pages = { 33-38 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume82/number1/14082-2080/ },
doi = { 10.5120/14082-2080 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:56:40.175632+05:30
%A S. Santhosh Baboo
%A K. Tajudin
%T Clustering Algorithms for Moving Object Shape and Time Constrains Basis
%J International Journal of Computer Applications
%@ 0975-8887
%V 82
%N 1
%P 33-38
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Clustering moving object trajectory data is an appealing research direction to fulfil the needs of many applications. In general, clustering is defined as the division of data into groups of similar objects. Each group, called as cluster, consists of objects that are similar among themselves and dissimilar to objects of other groups . Here to consider the moving object for clustering. The first section describes different object to flow in different directions, the clustering technique cluster object not only to the direction, time consideration and also cover with similar shape of object within the cluster window moving position. The objects flow in different way, different speed and different shape. Here the position or location of clustering and moving object directions are considered. The second section deals with the maximum wind details are Hurricane/Tropical Data for Northern Indian Ocean. Here to concentrate the flow record of maximum wind time duration basis, starting from the year, 2001 to 2010, the maximum cyclone flow updated different duration i. e. ,on hourly basis. The databases keep all records of data, to apply the clustering of four ways. First timely basis with limitation, second time and wind range basis, third exact time basis and fourth time limit with exact wind range.

References
  1. ANTHONY DAVID VENESS A real-time spatio-temporal data exploration tool for marine research, Master of Applied Science University of Tasmania, October 2009.
  2. DIMITRIS PAPADIAS, YUFEI TAO, PANOS KALNIS, JUN ZHANG, Indexing Spatio-Temporal Data Warehouses, Data Engineering, International Conference 2002
  3. D. LIN, C. JENSEN, B. OOI, AND S. SALTENIS. Efficient indexing of the historical, present, and future positions of moving objects. In MDM, pages 59–66, 2005.
  4. GHAZI H. AL-NAYMAT new methods for mining Sequential and time series Data, PhD thesis, the university of Sydney June 2009
  5. JIAWEI HAN AND MICHELINE KAMBER Data Mining Concepts and Techniques, second edition, Morgan Kaufmann Publishers an imprint of Elsevier
  6. KIMBALL, R. The Data Warehouse Toolkit John Wiley, 1996.
  7. M. PELANIS, S. ? SALTENIS, AND C. JENSEN. Indexing the past, present, and anticipated future positions of moving objects. TODS, 31(1):255–298, 2006.
  8. N. ROUSSOPOULOS, S. KELLEY, F. VINCENT, Nearest neighbour Queries, Proceedings of ACM SIGMOD Conference, 1995.
  9. RALF HARTMUT GUTING AND MARKUS SCHNEIDER Moving Objects Databases, Elsevier publication, 2005
  10. S. SUDARSAN KRITHIRAMAMRITHAM DataWarehousing and Data mining, IIT Bombay, sudarsha@ cse. iitb. ernet. in,krithi@cse. iitb. ernet. in
  11. SUBRAMANIAN ARUMUGAM efficient algorithms for spatiotemporal data management, PhD Thesis University of Florida, 2008
  12. TAHER OMRAN AHMED AND MARYVONNE MIQUEL Multidimensional Structures Dedicated to Continuous Spatiotemporal Phenomena Springer-Verlag Berlin Heidelberg 2005, pp 1-12
  13. Z. -H. LIU, X. -L. LIU, J. -W. GE, AND H. -Y. BAE. Indexing large moving objects from past to future with PCFI+-index. In COMAD, pages 131–137, 2005.
  14. KNOPR,E. M. ,AND NG,R. T. Finding aggregated proximity relationships and commonalities in spatial data mining. IEEE Transaction on Knowledge and data Engineering 8. 6(1996),884-897.
  15. LU,W. ,HAN,J. ,AND OOI,B. C. Discovery of general knowledge in large spatial database in 1993(singapor:1993),pp. 275-289.
  16. SANCHEZ-DIAZ,G. ,AND RUIZ-SHULCLOPER,J. Midmining a logical combination pattern recognition approach to clustring in large data sets.
  17. FISHER,D. ,AND LANGLEY,P. Approaches to conceptual clustering. In proceding 9th international joint conference ai(1985),pp. 691-697.
  18. The website of http://weather. unisys. com/hurricane/.
Index Terms

Computer Science
Information Sciences

Keywords

Spatial Temporal Database-Moving Object- Hiding Value-Location finding-Query analyzation

Powered by PhDFocusTM