ACM Home Page
Please provide us with feedback. Feedback
Dimensionality reduction for long duration and complex spatio-temporal queries
Full text PdfPdf (171 KB)
Source Symposium on Applied Computing archive
Proceedings of the 2007 ACM symposium on Applied computing table of contents
Seoul, Korea
SESSION: Data mining table of contents
Pages: 393 - 397  
Year of Publication: 2007
ISBN:1-59593-480-4
Authors
Ghazi Al-Naymat  University of Sydney, Australia
Sanjay Chawla  University of Sydney, Australia
Joachim Gudmundsson  National ICT Australia Ltd, Australia
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 61,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1244002.1244095
What is a DOI?

ABSTRACT

In this paper we present an approach to mine and query spatio-temporal data with the aim of finding interesting patterns and understanding the underlying data generating process. An important class of queries is based on the flock pattern. A flock is a large subset of objects moving along paths close to each other for a certain pre-defined time. One approach to process a "flock query" is to map spatio-temporal data into a high dimensional space and reduce the query into a sequence of standard range queries which can be presented using a spatial indexing structure. However, as is well known, the performance of spatial indexing structures drastically deteriorates in high dimensional space. In this paper we propose a preprocessing strategy which consists of using a random projection to reduce the dimensionality of the transformed space. Our experimental results show, for the first time, the possibility of breaking the curse of dimensionality in a spatio-temporal setting.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Porcupine caribou herd satellite collar project. http://www.taiga.net/satellite/.
 
2
 
3
G. Al-Naymat, S. Chawla, and J. Gudmundsson. Dimensionality reduction for long duration and complex spatio-temporal queries. TR 600. ISBN 1-86487-874-6, University of Sydney, July 2006.
4
 
5
 
6
7
8
9
 
10
J. Gudmundsson, M. van Kreveld, and B. Speckmann. Efficient detection of motion patterns in spatio-temporal data sets. To appear in GeoInformatica, 2006.
 
11
R. Güting, M. Bohlen, M. Erwig, C. Jensen, N. Lorentzos, E. Nardelli, M. Schneider, and J. R. Viqueira. Spatio-temporal models and languages: An approach based on data types. In Spatio-Temporal Databases: The CHOROCHRONOS Approach, pages 117--176. Springer-Verlag, 2003.
 
12
W. B. Johnson and J. Lindenstrauss. Extensions of lipschitz mappings into a hilbert space. In Conference in modern analysis and probability, pages 189--206. Amer. Math. Soc, 1982.
 
13
 
14
P. Laube, M. van Kreveld, and S. Imfeld. Finding REMO -detecting relative motion patterns in geospatial lifelines. In 11th International Symposium on Spatial Data Handling, pages 201--214, 2004.
 
15
F. Verhein and S. Chawla. Mining spatio-temporal association rules, sources, sinks, stationary regions and thoroughfares in object mobility databases. In Database Systems for Advanced Applications: 11th International Conference, DASFAA, pages 187--201, Singapore, 2006. Springer Berlin-Heidelberg.


Collaborative Colleagues:
Ghazi Al-Naymat: colleagues
Sanjay Chawla: colleagues
Joachim Gudmundsson: colleagues