The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Shared-nearest-neighbor-based clustering by fast search and find of density peaks
Abstract
Abstract Clustering by fast search and find of density peaks (DPC) is a new clustering method that was reported in Science in June 2014. This clustering algorithm is based on the assumption that cluster centers have high local densities and are generally far from each other. With a decision graph, cluster centers can be easily located. However, this approach suffers from certain disadvantages. First, the definition of the local density and distance measurement is too simple; therefore, the DPC algorithm might perform poorly on complex datasets that are of multiple scales, cross-winding, of various densities, or of high dimensionality. Second, the one-step allocation strategy is not robust and has poor fault tolerance. Thus, if a point is assigned incorrectly, then the subsequent allocation will further amplify the error, resulting in more errors, which will have a severe negative impact on the clustering results. Third, the cutoff distance d c is generally difficult to determine since the range of each attribute is unknown in most cases. Even when being normalized or using the relative percentage method, a small change in d c will still cause a conspicuous fluctuation in the result, and this is especially true for real-world datasets. Considering these drawbacks, we propose a shared-nearest-neighbor-based clustering by fast search and find of density peaks (SNN-DPC) algorithm. We present three new definitions: SNN similarity, local density ρ and distance from the nearest larger density point δ . These definitions take the information of the nearest neighbors and the shared neighbors into account, and they can self-adapt to the local surroundings. Then, we introduce our two-step allocation method: inevitably subordinate and possibly subordinate. The former quickly and accurately recognizes and allocates the points that certainly belong to one cluster by counting the number of shared neighbors between two points. The latter assigns the remaining points by finding the clusters to which more neighbors belong. The algorithm is benchmarked on publicly available synthetic datasets, UCI real-world datasets and the Olivetti Faces dataset, which are often used to test the performance of clustering algorithms. We compared the results with those of DPC, fuzzy weighted K-nearest neighbors density peak clustering (FKNN-DPC), affinity propagation (AP), ordering points to identify the clustering structure (OPTICS), density-based spatial clustering of applications with noise (DBSCAN), and K-means. The metrics used are adjusted mutual information (AMI), adjusted Rand index (ARI), and Fowlkes–Mallows index (FMI). The experimental results prove that our method can recognize clusters regardless of their size, shape, and dimensions; is robust to noise; and is remarkably superior to DPC, FKNN-DPC, AP, OPTICS, DBSCAN, and K-means.
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
Scikit-learn: Machine Learning in Python
Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Müller, A., Nothman, J., Louppe, G., et al. (2012) · arXiv · doi:10.48550/arxiv.1201.0490 · Cited by 71,016
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
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,411
(1967) · Cited by 23,719
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
(1996) · Cited by 20,179
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
(2008) · Data Mining and Market Intelligence for Optimal Marketing Returns · doi:10.4324/9780080878096-12 · Cited by 6,954
Clustering by Passing Messages Between Data Points
Frey, B. J., & Dueck, D. (2007) · Science · doi:10.1126/science.1136800 · Cited by 6,758
Clustering by fast search and find of density peaks
Rodriguez, A., & Laio, A. (2014) · Science · doi:10.1126/science.1242072 · Cited by 4,942
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
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
Automatic subspace clustering of high dimensional data for data mining applications
Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276314 · Cited by 2,412
CURE: an efficient clustering algorithm for large databases
Guha, S., Rastogi, R., & Shim, K. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276312 · Cited by 1,907
Vinh, N. X., Epps, J., & Bailey, J. (2010) · Minerva Access (University of Melbourne) · doi:10.5555/1756006.1953024 · Cited by 1,781
Proceedings of the International Joint Conference on Neural Networks, 2003.
(2003) · doi:10.1109/ijcnn.2003 · Cited by 1,674
A Method for Comparing Two Hierarchical Clusterings
Fowlkes, E. B., & Mallows, C. L. (1983) · Journal of the American Statistical Association · doi:10.1080/01621459.1983.10478008 · Cited by 1,614
Clustering by means of medoids
Kaufman, L., & Rousseeuw, P. J. (1987) · Lirias · Cited by 1,311
Clustering Using a Similarity Measure Based on Shared Near Neighbors
Jarvis, R. A., & Patrick, E. A. (1973) · IEEE Transactions on Computers · doi:10.1109/t-c.1973.223640 · Cited by 955
(2007) · Foundations of SQL Server 2005 Business Intelligence · doi:10.1007/978-1-4302-0248-6_11 · Cited by 941
Gionis, A., Mannila, H., & Tsaparas, P. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217303 · Cited by 819
Automatic subspace clustering of high dimensional data for data mining applications
Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998) · ACM SIGMOD Record · doi:10.1145/276305.276314 · Cited by 663
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
Nuclear feature extraction for breast tumor diagnosis:
Street, W. N., Wolberg, W. H., & Mangasarian, O. L. (1993) · SPIE Proceedings · doi:10.1117/12.148698 · Cited by 526
Study on density peaks clustering based on k-nearest neighbors and principal component analysis
Du, M., Ding, S., & Jia, H. (2016) · Knowledge-Based Systems · doi:10.1016/j.knosys.2016.02.001 · Cited by 520
A maximum variance cluster algorithm
Veenman, C. J., Reinders, M. J. T., & Backer, E. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1033218 · Cited by 455
Xie, J., Gao, H., Xie, W., Liu, X., & Grant, P. W. (2016) · Information Sciences · doi:10.1016/j.ins.2016.03.011 · Cited by 360
Classification of radar returns from the ionosphere using neural networks
Sigillito, V. G. (1989) · Johns Hopkins APL technical digest · Cited by 344
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
WaveCluster: a wavelet-based clustering approach for spatial data in very large databases
Sheikholeslami, G., Chatterjee, S., & Zhang, A. (2000) · The VLDB Journal The International Journal on Very Large Data Bases · doi:10.1007/s007780050009 · Cited by 293
Data Clustering: A User’s Dilemma
Jain, A. K., & Law, M. H. C. (2005) · Lecture Notes in Computer Science · doi:10.1007/11590316_1 · Cited by 288
Clustering by fast search and find of density peaks via heat diffusion
Mehmood, R., Zhang, G., Bie, R., Dawood, H., & Ahmad, H. (2016) · Neurocomputing · doi:10.1016/j.neucom.2016.01.102 · Cited by 171
DenPEHC: Density peak based efficient hierarchical clustering
Ji, X., Wang, G., & Deng, W. (2016) · Information Sciences · doi:10.1016/j.ins.2016.08.086 · Cited by 137
Clustering by Fast Search and Find of Density Peaks with Data Field
Wang, S., Wang, D., Li, C., Li, Y., & Ding, G. (2016) · Chinese Journal of Electronics · doi:10.1049/cje.2016.05.001 · Cited by 89
A novel clustering-based image segmentation via density peaks algorithm with mid-level feature
Shi, Y., Chen, Z., Qi, Z., Meng, F., & Cui, L. (2016) · Neural Computing and Applications · doi:10.1007/s00521-016-2300-1 · Cited by 57
Zhong, J., Tse, P. W.-T., & Wei, Y. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.10.005 · Cited by 23
(1997)
Cited by
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
- Liu, R., Wang, H., & Yu, X.
- Venue
- Information Sciences
- Publisher
- Elsevier BV
- Published
- 2018-06
- Volume
- 450
- Pages
- 200-226
- ISSN
- 0020-0255 (ISSN-L)
- OpenAlex
- W2789456849
- Cited by
- 429
- References
- 42
- FWCI
- 19.80
- 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.