Knowledge discovery in large spatial databases: Focusing techniques for efficient class identification
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
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
Finding Groups in Data: An Introduction to Cluster Analysis
Kaufman, L., & Rousseeuw, P. J. (1990) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316801 · Cited by 7,344
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Ankerst, M. (1999) · doi:10.1145/304181.304187 · Cited by 3,982
BIRCH: an efficient data clustering method for very large databases
Zhang, T., Ramakrishnan, R., & Livny, M. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233324 · Cited by 3,935
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
CLARANS: a method for clustering objects for spatial data mining
Ng, R. T., & Han, J. (2002) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2002.1033770 · Cited by 1,202
Fast algorithms for projected clustering
Aggarwal, C. C., Wolf, J. L., Yu, P. S., Procopiuc, C., & Park, J. S. (1999) · ACM SIGMOD Record · doi:10.1145/304181.304188 · Cited by 900
BIRCH: A New Data Clustering Algorithm and Its Applications
Zhang, T., Ramakrishnan, R., & Livny, M. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009783824328 · Cited by 888
Information retrieval on the web
Kobayashi, M., & Takeda, K. (2000) · ACM Computing Surveys · doi:10.1145/358923.358934 · Cited by 562
Efficiently supporting ad hoc queries in large datasets of time sequences
Korn, F., Jagadish, H. V., & Faloutsos, C. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253332 · Cited by 405
A distribution-based clustering algorithm for mining in large spatial databases
Xu, X., Ester, M., Kriegel, H.-P., & Sander, J. (2002) · Proceedings 14th International Conference on Data Engineering · doi:10.1109/icde.1998.655795 · Cited by 352
Self-citationSpatial data mining: A database approach
Ester, M., Kriegel, H.-P., & Sander, J. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63238-7_24 · Cited by 245
Self-citationA 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
MACEACHREN, A. M., WACHOWICZ, M., EDSALL, R., HAUG, D., & MASTERS, R. (1999) · International Journal of Geographical Information Science · doi:10.1080/136588199241229 · Cited by 188
“Based on CLARANS, two spatial data mining algorithms were developed SD-CLARANS (spatial dominant algorithm) and NSD-CLARANS (non-spatial dominant algorithm) (Ester et al. 1995).”
BackgroundMethod
Metadata
- Authors
- Ester, M., Kriegel, H.-P., & Xu, X.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1995
- Pages
- 67-82
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1577072181
- Cited by
- 160
- References
- 1
- FWCI
- 18.31
- 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.