The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Robust clustering by detecting density peaks and assigning points based on fuzzy weighted K-nearest neighbors
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
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,411
(1967) · Cited by 23,719
(1996) · Cited by 20,179
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936
LIII. On lines and planes of closest fit to systems of points in space
Pearson, K. (1901) · The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science · doi:10.1080/14786440109462720 · Cited by 11,934
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
Clustering by Passing Messages Between Data Points
Frey, B. J., & Dueck, D. (2007) · Science · doi:10.1126/science.1136800 · Cited by 6,758
Survey of Clustering Algorithms
Xu, R., & WunschII, D. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.845141 · Cited by 6,197
Clustering by fast search and find of density peaks
Rodriguez, A., & Laio, A. (2014) · Science · doi:10.1126/science.1242072 · Cited by 4,942
Mean shift, mode seeking, and clustering
Cheng, Y. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.400568 · Cited by 3,856
The global k-means clustering algorithm
Likas, A., Vlassis, N., & J. Verbeek, J. (2003) · Pattern Recognition · doi:10.1016/s0031-3203(02)00060-2 · Cited by 3,733
Proceedings of the fifth Berkeley symposium on mathematical statistics and probability.
Kojima, K.-I. (1969) · Europe PMC (PubMed Central) · Cited by 3,648
Parameterisation of a stochastic model for human face identification
Samaria, F. S., & Harter, A. C. (2002) · Proceedings of 1994 IEEE Workshop on Applications of Computer Vision · doi:10.1109/acv.1994.341300 · Cited by 2,593
Introduction to Semi-Supervised Learning
Zhu, X., & Goldberg, A. B. (2009) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.1007/978-3-031-01548-9 · Cited by 1,766
The Distance-Weighted k-Nearest-Neighbor Rule
Dudani, S. A. (1976) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1976.5408784 · Cited by 1,471
Information theoretic measures for clusterings comparison: is a correction for chance necessary?
Vinh, N. X., Epps, J., & Bailey, J. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553511 · Cited by 938
Gionis, A., Mannila, H., & Tsaparas, P. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217303 · Cited by 819
Robust path-based spectral clustering
Chang, H., & Yeung, D.-Y. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2007.04.010 · Cited by 565
FLAME, a novel fuzzy clustering method for the analysis of DNA microarray data
Fu, L., & Medico, E. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-3 · Cited by 527
Ranking Outliers Using Symmetric Neighborhood Relationship
Jin, W., Tung, A. K. H., Han, J., & Wang, W. (2006) · Lecture Notes in Computer Science · doi:10.1007/11731139_68 · Cited by 415
Iterative shrinking method for clustering problems
Fränti, P., & Virmajoki, O. (2006) · Pattern Recognition · doi:10.1016/j.patcog.2005.09.012 · Cited by 341
Fast Agglomerative Clustering Using a k-Nearest Neighbor Graph
Fränti, P., Virmajoki, O., & Hautamäki, V. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.227 · Cited by 310
Proceedings of 2004 International Conference on Machine Learning and Cybernetics
(2004) · Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat No 04EX826) ICMLC-04 · doi:10.1109/icmlc.2004.1378168 · Cited by 297
Ulrike Von Luxburg, A., Williamson, R. C., & Guyon, I. (2011) · MPG.PuRe (Max Planck Society) · Cited by 220
An Efficient Global K-means Clustering Algorithm
Xie, J., Jiang, S., Xie, W., & Gao, X. (2011) · Journal of Computers · doi:10.4304/jcp.6.2.271-279 · Cited by 83
Self-citationThe BYY annealing learning algorithm for Gaussian mixture with automated model selection
Ma, J., & Liu, J. (2007) · Pattern Recognition · doi:10.1016/j.patcog.2006.12.028 · Cited by 38
Advances in Knowledge Discovery and Data Mining
(2006) · Lecture notes in computer science · doi:10.1007/11731139 · Cited by 32
Cited by
Shared-nearest-neighbor-based clustering by fast search and find of density peaks
Liu, R., Wang, H., & Yu, X. (2018) · Information Sciences · doi:10.1016/j.ins.2018.03.031 · Cited by 429
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
Fast hierarchical clustering of local density peaks via an association degree transfer method
Guan, J., Li, S., He, X., Zhu, J., & Chen, J. (2021) · Neurocomputing · doi:10.1016/j.neucom.2021.05.071 · Cited by 73
Metadata
- Authors
- Xie, J., Gao, H., Xie, W., Liu, X., & Grant, P. W.
- Venue
- Information Sciences
- Publisher
- Elsevier BV
- Published
- 2016-08
- Volume
- 354
- Pages
- 19-40
- ISSN
- 0020-0255 (ISSN-L)
- OpenAlex
- W2293435807
- Cited by
- 360
- References
- 28
- FWCI
- 24.07
- 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.