The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
The (black) art of runtime evaluation: Are we comparing algorithms or implementations?
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
The WEKA data mining software: an update
Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., & Witten, I. H. (2009) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1656274.1656278 · Cited by 17,750 · cited 10×
“Over the release history, we observe improvements for WEKA, ELKI, and scikit-learn.”
MethodInfluentialLeast squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
Algorithm AS 136: A K-Means Clustering Algorithm
Hartigan, J. A., & Wong, M. A. (1979) · Applied Statistics · doi:10.2307/2346830 · Cited by 14,523
(2007) · doi:10.5555/1283383.1283494 · Cited by 7,364
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
An efficient k-means clustering algorithm: analysis and implementation
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1017616 · Cited by 5,660 · cited 1×
“[9] and known as blacklisting [60] or filtering [48]) did not yieldmajor performance gains in theHubMiner implementation.”
BackgroundLOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335388 · Cited by 5,207
Self-citationLOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335388 · Cited by 4,149 · cited 4×
“we test a classic outlier detection algorithm, LOF [24].”
BackgroundMethodInfluentialSelf-citationHierarchical Density Estimates for Data Clustering, Visualization, and Outlier Detection
Campello, R. J. G. B., Moulavi, D., Zimek, A., & Sander, J. (2015) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2733381 · Cited by 915
Self-citationKriegel, H., Kröger, P., Sander, J., & Zimek, A. (2011) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.30 · Cited by 900
Self-citation
Cited by
DBSCAN Revisited, Revisited: Why and How You Should (Still) Use DBSCAN
Schubert, E., Sander, J., Ester, M., Kriegel, H. P., & Xu, X. (2017) · ACM Transactions on Database Systems · doi:10.1145/3068335 · Cited by 2,737
Self-citationdbscan: Fast Density-Based Clustering with R
Hahsler, M., Piekenbrock, M., & Doran, D. (2019) · Journal of Statistical Software · doi:10.18637/jss.v091.i01 · Cited by 802
On the evaluation of unsupervised outlier detection: measures, datasets, and an empirical study
Campos, G. O., Zimek, A., Sander, J., Campello, R. J. G. B., Micenková, B., Schubert, E., Assent, I., & Houle, M. E. (2016) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-015-0444-8 · Cited by 735
Self-citationA better balance in metaheuristic algorithms: Does it exist?
Morales-Castañeda, B., Zaldívar, D., Cuevas, E., Fausto, F., & Rodríguez, A. (2020) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2020.100671 · Cited by 436
ANN-Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms
Aumüller, M., Bernhardsson, E., & Faithfull, A. (2020) · Information Systems · doi:10.1016/j.is.2019.02.006 · Cited by 300
Metadata
- Authors
- Kriegel, H.-P., Schubert, E., & Zimek, A.
- Venue
- Knowledge and Information Systems
- Published
- 2016-10-22
- Volume
- 52
- Issue
- 2
- Pages
- 341-378
- ISSN
- 0219-1377 (ISSN-L)
- 0219-3116
- OpenAlex
- W2532189199
- Cited by
- 229
- References
- 10
- FWCI
- 40.20
- 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
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.