By Topic

Using Apriori-like algorithms for spatio-temporal pattern queries

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Gorawski, M. ; Inst. of Comput. Sci., Silesian Univ. of Technol., Gliwice, Poland ; Jureczek, P.

In this paper we present a way to construct Apriori-like algorithms for mining spatio-tempral patterns. An Apriori-like algorithm is created on the basis of a candidate generator and a suitable comparing function. In order to avoid ambiguity, a classification of basic and extended comparing functions is also introduced. Moreover, some of these functions are characteristic for spatial searching only. In addition, the comparing functions and the Apriori-like algorithms complement each other. The comparing functions can also extend the area of data exploration.

Published in:

Computer Science and Information Technology, 2009. IMCSIT '09. International Multiconference on

Date of Conference:

12-14 Oct. 2009