Wang, L, Zhou, L, Lu, J and Yip, YJ 2009, 'An order-clique-based approach for mining maximal co-locations' , Information Sciences, 179 (19) , pp. 3370-3382.
Full text not available from this repository.Abstract
Most algorithms for mining spatial co-locations adopt an Apriori-like approach to generate size-k prevalence co-locations after size-(k − 1) prevalence co-locations. However, generating and storing the co-locations and table instances is costly. A novel order-clique-based approach for mining maximal co-locations is proposed in this paper. The efficiency of the approach is achieved by two techniques: (1) the spatial neighbor relationships and the size-2 prevalence co-locations are compressed into extended prefix-tree structures, which allows the order-clique-based approach to mine candidate maximal co-locations and co-location instances; and (2) the co-location instances do not need to be stored after computing some characteristics of the corresponding co-location, which significantly reduces the execution time and space required for mining maximal co-locations. The performance study shows that the new method is efficient for mining both long and short co-location patterns, and is faster than some other methods (in particular the join-based method and the join-less method).
| Item Type: | Article |
|---|---|
| Themes: | Subjects outside of the University Themes |
| Schools: | Schools > No Research Centre |
| Journal or Publication Title: | Information Sciences |
| Publisher: | Elsevier |
| Refereed: | Yes |
| ISSN: | 00200255 |
| Depositing User: | Users 29196 not found. |
| Date Deposited: | 29 Aug 2012 14:13 |
| Last Modified: | 30 Nov 2015 23:58 |
| URI: | http://usir.salford.ac.uk/id/eprint/23340 |
Actions (login required)
 |
Edit record (repository staff only) |
Tools
Tools