The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
A Joinless Approach for Mining Spatial Colocation Patterns
Abstract
Spatial colocations represent the subsets of features which are frequently located together in geographic space. Colocation pattern discovery presents challenges since spatial objects are embedded in a continuous space, whereas classical data is often discrete. A large fraction of the computation time is devoted to identifying the instances of colocation patterns. We propose a novel joinless approach for efficient colocation pattern mining. The joinless colocation mining algorithm uses an instance-lookup scheme instead of an expensive spatial or an instance join operation for identifying colocation instances. We prove the joinless algorithm is correct and complete in finding colocation rules. We also describe a partial join approach for a spatial data set often clustered in neighborhood areas. We provide the algebraic cost models to characterize the performance dominance zones of the joinless method and the partial join method with a current join-based colocation mining method, and compare their computational complexities. In the experimental evaluation, using synthetic and real-world data sets, our methods performed more efficiently than the join-based method and show more scalability in dense data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
gSpan: graph-based substructure pattern mining
Yan, X., & Han, J. (2003) · 2002 IEEE International Conference on Data Mining, 2002. Proceedings. · doi:10.1109/icdm.2002.1184038 · Cited by 2,013
Kuramochi, M., & Karypis, G. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989534 · Cited by 1,068
Shekhar, S., & Chawla, S. (2003) · Cited by 531
Self-citationDiscovery of spatial association rules in geographic information databases
Koperski, K., & Han, J. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60159-7_4 · Cited by 452
Kemp, Z. P. (2003) · Kent Academic Repository (University of Kent) · Cited by 413
A bibliography of temporal, spatial and spatio-temporal data mining research
Roddick, J. F., & Spiliopoulou, M. (1999) · ACM SIGKDD Explorations Newsletter · doi:10.1145/846170.846173 · Cited by 216
Cited by
Data Mining for Internet of Things: A Survey
Tsai, C.-W., Lai, C.-F., Chiang, M.-C., & Yang, L. T. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.103013.00206 · Cited by 620
Big data and disaster management: a systematic review and agenda for future research
Akter, S., & Wamba, S. F. (2019) · Annals of Operations Research · doi:10.1007/s10479-017-2584-2 · Cited by 343
The Internet of Things: A Review of Enabled Technologies and Future Challenges
Ud Din, I., Guizani, M., Hassan, S., Kim, B.-S., Khurram Khan, M., Atiquzzaman, M., & Ahmed, S. H. (2019) · IEEE Access · doi:10.1109/access.2018.2886601 · Cited by 254
Metadata
- Authors
- Yoo, J. S., & Shekhar, S.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2006-10
- Volume
- 18
- Issue
- 10
- Pages
- 1323-1337
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2136171062
- Cited by
- 315
- References
- 7
- FWCI
- 24.93
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Joinless Approach for Mining Spatial Colocation Patterns. https://app.cochat.ai/papers/10.1109/tkde.2006.150
- The paper
- Yoo, J. S., & Shekhar, S. (2006). A Joinless Approach for Mining Spatial Colocation Patterns. IEEE Transactions on Knowledge and Data Engineering. https://doi.org/10.1109/tkde.2006.150
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.