Co-location pattern mining for unevenly distributed data: algorithm, experiments and applications
by Yasuhiko Morimoto
International Journal of Computational Science and Engineering (IJCSE), Vol. 5, No. 3/4, 2010

Abstract: We considered co-location pattern mining algorithm that uses the Voronoi diagram. In general, the density of spatial objects is much higher in urban areas than in rural areas. The proposed algorithm is suitable for such unevenly distributed database. We have applied the co-location pattern mining algorithm for real spatial databases and show the capability of the proposed algorithm for a real spatial database. We also applied our methods for analysing web pages that contains spatial information. There are many web pages that contain spatial information such as addresses, postal codes, and telephone numbers. Most of the spatial information in web pages are location information and is unevenly distributed. We collected such web pages by web-crawling programs. For each page determined to contain location information, we apply geocoding techniques to compute geographic coordinates, such as latitude-longitude pairs. Next, we augment the location information with keyword descriptors extracted from the web page contents. We then apply co-location mining on the augmented location information.

Online publication date: Fri, 24-Dec-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com