ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Efficient algorithm for calculating similarity between trajectories containing an increasing dimension
Source International Association Of Science And Technology For Development archive
Proceedings of the 24th IASTED international conference on Artificial intelligence and applications table of contents
Innsbruck, Austria
Pages: 392 - 399  
Year of Publication: 2006
ISBN ~ ISSN:1027-2666 , 0-88986-556-6
Authors
Perttu Laurinen  Intelligent Systems Group, Computer Engineering Laboratory, University of Oulu, Finland
Pekka Siirtola  Intelligent Systems Group, Computer Engineering Laboratory, University of Oulu, Finland
Juha Röning  Intelligent Systems Group, Computer Engineering Laboratory, University of Oulu, Finland
Publisher
ACTA Press  Anaheim, CA, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

Time series data is usually stored and processed in the form of discrete trajectories of multidimensional measurement points. In order to compare the measurements of a query trajectory to a set of stored trajectories, one needs to calculate similarity between two trajectories. In this paper an efficient algorithm for calculating the similarity is presented for a set of trajectories containing one increasing measurement dimension, for example time series data. An even more efficient version of the algorithm suitable for situations where all dimensions are increasing, such as many spatio-temporal data sets, is also presented. Furthermore, the similarity measurement technique nearly fulfills the requirements of a metric space, which is a clear improvement to the currently used procedure. The performance of the algorithm is validated first by using data measured from a hot strip mill and then by using synthetically generated trajectories. The new algorithm outperforms the currently used procedure by several orders of magnitude, depending on the context of usage.


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
 
2
 
3
 
4
[4] P. Laurinen and J. Roning. An adaptive neural network model for predicting the post roughing mill temperature of steel slabs in the reheating furnace. Journal of Materials Processing Technology, 168(3):423-430, October 2005.
 
5
6
 
7
8
 
9
 
10


Collaborative Colleagues:
Perttu Laurinen: colleagues
Pekka Siirtola: colleagues
Juha Röning: colleagues