e-ISSN:0976-5166
p-ISSN:2231-3850


INDIAN JOURNAL OF COMPUTER SCIENCE AND ENGINEERING

Call for Papers

Aug 2019 - Volume 10, Issue 4
Deadline: 15 Jul 2019
Notification: 15 Aug 2019
Publication: 31 Aug 2019

Oct 2019 - Volume 10, Issue 5
Deadline: 15 Sep 2019
Notification: 15 Oct 2019
Publication: 30 Oct 2019

Indexed in

ABSTRACT

Title : MINING OF SPATIAL CO-LOCATION PATTERN IMPLEMENTATION BY FP GROWTH
Authors : G.Manikandan, S.Srinivasan
Keywords : Spatial data mining, Co-location patterns, minimum support, minimum bounding rectangle, FP tree, Vehicle movement data.
Issue Date : Apr-May 2012
Abstract :
Mining co-location patterns from spatial databases may disclose the types of spatial features which are likely located as neighbours in space. Accordingly, we presented an algorithm previously for mining spatially co-located moving objects using spatial data mining techniques and Prim's Algorithm. In the previous technique, the scanning of database to mine the spatial co-location patterns took much computational cost. In order to reduce the computation time, in this work, we make use of R-tree that is spatial data structure to mine the spatial co-location patterns. The important step presented in the approach is that the transformation of spatial data into the compact format that is well-suitable to mine the patterns. According to, we have adapted the R-tree structure that converts the spatial data with the feature into the transactional data format. Then, the prominent pattern mining algorithm, FP growth is used to mine the spatial co-location patterns from the converted format of data. Finally, the performance of the proposed technique is compared with the previous technique in terms of time and memory usage. From the results, we can ensure that the proposed technique outperformed of about more than 50 % of previous algorithm in time and memory usage.
Page(s) : 344-348
ISSN : 0976-5166
Source : Vol. 3, No.2