The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
DENCLUE 2.0: Fast Clustering Based on Kernel Density Estimation
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
Ankerst, M. (1999) · doi:10.1145/304181.304187 · Cited by 3,982
A View of the Em Algorithm that Justifies Incremental, Sparse, and other Variants
Neal, R. M., & Hinton, G. E. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_12 · Cited by 2,187
Cited by
Hierarchical 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
“…DBSCAN only loosely in conformity with Hartigan’s model.2 This is also the case for the well-known algorithm DENCLUE [Hinneburg and Keim 1998, 2003; Hinneburg and Gabriel 2007], which uses a general kernel-based density estimate as well as a gradient-based approach to decide which objects…”
BackgroundMethodKriegel, H., Kröger, P., Sander, J., & Zimek, A. (2011) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.30 · Cited by 900
Private memoirs of a smart meter
Molina-Markham, A., Shenoy, P., Fu, K., Cecchet, E., & Irwin, D. (2010) · Proceedings of the 2nd ACM Workshop on Embedded Sensing Systems for Energy-Efficiency in Building · doi:10.1145/1878431.1878446 · Cited by 511
Making AI Forget You: Data Deletion in Machine Learning
Ginart, A., Guan, M. Y., Valiant, G., & Zou, J. (2019) · arXiv · doi:10.48550/arxiv.1907.05012 · Cited by 175
A graph‐based approach to find teleconnections in climate data
Kawale, J., Liess, S., Kumar, A., Steinbach, M., Snyder, P., Kumar, V., Ganguly, A. R., Samatova, N. F., & Semazzi, F. (2013) · Statistical Analysis and Data Mining: The ASA Data Science Journal · doi:10.1002/sam.11181 · Cited by 37
Metadata
- Authors
- Hinneburg, A., & Gabriel, H.-H.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-08-21
- Pages
- 70-80
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1638498331
- Cited by
- 224
- References
- 2
- FWCI
- 2.60
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: DENCLUE 2.0: Fast Clustering Based on Kernel Density Estimation. https://app.cochat.ai/papers/10.1007/978-3-540-74825-0_7
- The paper
- Hinneburg, A., & Gabriel, H.-H. (2007). DENCLUE 2.0: Fast Clustering Based on Kernel Density Estimation. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-74825-0_7
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.