Fast density clustering strategies based on the k-means algorithm
The DOI matches its Crossref record; 44 of the 44 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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,373
(1967) · Cited by 23,719
(1996) · Cited by 20,179
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
Pattern Recognition with Fuzzy Objective Function Algorithms
Bezdek, J. C. (1981) · doi:10.1007/978-1-4757-0450-1 · Cited by 9,881
Data clustering: 50 years beyond K-means
Jain, A. K. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2009.09.011 · Cited by 9,368
Rough Sets: Theoretical Aspects of Reasoning about Data
Pawlak, Z. (1991) · Our Digital Library (Warsaw University of Technology) · Cited by 8,343
Cited by
How much can k-means be improved by using better initialization and repeats?
Fränti, P., & Sieranoja, S. (2019) · Pattern Recognition · doi:10.1016/j.patcog.2019.04.014 · Cited by 451
Unsupervised Learning Methods for Molecular Simulation Data
Glielmo, A., Husic, B. E., Rodriguez, A., Clementi, C., Noé, F., & Laio, A. (2021) · Chemical Reviews · doi:10.1021/acs.chemrev.0c01195 · Cited by 402
Chen, Y., Tang, S., Bouguila, N., Wang, C., Du, J., & Li, H. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2018.05.030 · Cited by 169
“Many researches are launched in this area to deal with this kind of data [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13].”
BackgroundFeature weighting in DBSCAN using reverse nearest neighbours
Chowdhury, S., Helian, N., & Cordeiro de Amorim, R. (2023) · Pattern Recognition · doi:10.1016/j.patcog.2023.109314 · Cited by 39
Metadata
- Authors
- Bai, L., Cheng, X., Liang, J., Shen, H., & Guo, Y.
- Venue
- Pattern Recognition
- Publisher
- Elsevier BV
- Published
- 2017-11
- Volume
- 71
- Pages
- 375-386
- ISSN
- 0031-3203 (ISSN-L)
- OpenAlex
- W2635535303
- Cited by
- 178
- References
- 44
- FWCI
- 10.99
- 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.