Abstract

With the availability of large geo-spatial datasets like maps, repositories of remote-sensing images, location based mobile application data, etc; the concept of spatial data mining is gaining popularity. However, as classical data mining techniques are often inadequate for spatial data mining, different techniques for spatial data mining are being exclusively developed. In spatial data mining, Co-location pattern mining is an important problem which aims at discovering the set of spatial features frequently located together in the geographic proximity. In this paper we propose a framework and algorithm for discovering the frequently occurring co-location patterns of objects in spatial datasets using a co-location mining algorithm which utilizes clustering and map-overlay techniques. The proposed algorithm namely, COPMOC overcomes the limitations of the existing transaction based approaches and the approach which needs distance threshold for neighborhood. The proposed algorithm has been tested and analyzed with a hypothetical dataset generated with 5 different spatial features.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.