By Topic

Fast Mining of Complex Spatial Co-location Patterns Using GLIMIT

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)

Most algorithms for mining interesting spatial co- locations integrate the co-location / clique generation task with the interesting pattern mining task, and are usually based on the Apriori algorithm. This has two downsides. First, it makes it difficult to meaningfully include certain types of complex relationships ­ especially negative rela- tionships ­ in the patterns. Secondly, the Apriori algorithm is slow. In this paper, we consider maximal cliques ­ cliques that are not contained in any other clique. We use these to extract complex maximal cliques and subsequently mine these for interesting sets of object types (including complex types). That is, we mine interesting complex relationships. We show that applying the GLIMIT itemset mining algo- rithm to this task leads to far superior performance than using an Apriori style approach.

Published in:

Data Mining Workshops, 2007. ICDM Workshops 2007. Seventh IEEE International Conference on

Date of Conference:

28-31 Oct. 2007