A NOVEL RANK BASED CO-LOCATION PATTERN MINING APPROACH USING MAP-REDUCE
With the increase in spatial data analysis, the co-location patterns and its dependencies are used to discover the complex patterns on spatial databases. Most of the traditional spatial data mining techniques have been implemented based on the assumption that the data is meaningful and clean. It is...
Saved in:
Published in | Journal of Theoretical and Applied Information Technology Vol. 87; no. 3; p. 422 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Islamabad
Journal of Theoretical and Applied Information
01.05.2016
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | With the increase in spatial data analysis, the co-location patterns and its dependencies are used to discover the complex patterns on spatial databases. Most of the traditional spatial data mining techniques have been implemented based on the assumption that the data is meaningful and clean. It is essential to study the data integration issues along with spatial co-locating patterns. Generally, spatial co-location mining algorithms are used to discover the spatial objects and its dependencies among them. As the data size increases, the co-location objects and its patterns are difficult to process on complex spatial objects. In this paper, an optimized spatial co-locating pattern mining framework was developed to discover the highly ranked correlated patterns using the hadoop framework. This MapReduce model was used to minimize computational time and space on complex spatial databases. Finally, the experimental results on the complex spatial data are evaluated using the proposed framework and the traditional hadoop based pattern mining models. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
ISSN: | 1817-3195 |