The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Discovery of spatial association rules in geographic information databases
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907 · cited 5×
“E cient algorithms for the discovery of such kind of rules in transaction-based databases have been studied [1, 2].”
BackgroundResultInfluentialFast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
R-trees: a dynamic index structure for spatial searching
Guttman, A. (1984) · Proceedings of the 1984 ACM SIGMOD international conference on Management of data - SIGMOD '84 · doi:10.1145/602259.602266 · Cited by 6,580
Computational Geometry--An Introduction.
Atallah, M. J., Preparata, F. P., & Shamos, M. I. (1986) · Mathematics of Computation · doi:10.2307/2008200 · Cited by 4,238
Preparata, F. P., & Shamos, M. I. (1985) · Springer eBooks · doi:10.1007/978-1-4612-1098-6 · Cited by 3,655
The design and analysis of spatial data structures
Samet, H. (1989) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,380
Efficient and Effective Clustering Methods for Spatial Data Mining
Ng, R. T., & Han, J. (1994) · Cited by 1,778
Self-citationKnowledge Discovery in Databases
Piateski, G., & Frawley, W. (1991) · The MIT Press eBooks · Cited by 1,749
Discovery of Multiple-Level Association Rules from Large Databases
Han, J., & Fu, Y. (1995) · Cited by 922
Self-citationReasoning about binary topological relations
Egenhofer, M. J. (1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-54414-3_36 · Cited by 628
Data-driven discovery of quantitative rules in relational databases
Han, J., Cai, Y., & Cercone, N. (1993) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.204089 · Cited by 380
Self-citationSpatial SQL: a query and presentation language
Egenhofer, M. J. (1994) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.273029 · Cited by 378
The interestingness of deviations
Piatetsky-Shapiro, G., & Matheus, C. J. (1994) · Cited by 249
Cited by
Data mining: an overview from a database perspective
Chen, M.-S., Han, J., & Yu, P. S. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553155 · Cited by 2,232
Self-citationFrequent pattern mining: current status and future directions
Han, J., Cheng, H., Xin, D., & Yan, X. (2007) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-006-0059-1 · Cited by 1,380
Self-citationData 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
Mining multiple-level association rules in large databases
Han, J., & Fu, Y. (1999) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.806937 · Cited by 327
Self-citationA Joinless Approach for Mining Spatial Colocation Patterns
Yoo, J. S., & Shekhar, S. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.150 · Cited by 315
Metadata
- Authors
- Koperski, K., & Han, J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1995
- Volume
- 951
- Pages
- 47-66
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1870669718
- Cited by
- 452
- References
- 13
- FWCI
- 3.17
- Type
- conference paper
- 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
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.