The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Study on density peaks clustering based on k-nearest neighbors and principal component analysis
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
(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
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,520
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
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
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
Density-Based Clustering Based on Hierarchical Density Estimates
Campello, R. J. G. B., Moulavi, D., & Sander, J. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-37456-2_14 · Cited by 2,680 · cited 1×
“Density-based clustering [3–7] is represented by DBSCAN [3] .”
MethodDensity-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications
Sander, J., Ester, M., Kriegel, H.-P., & Xu, X. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009745219419 · Cited by 1,495
Subspace clustering for high dimensional data: a review
Parsons, L., Haque, E., & Liu, H. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007731 · Cited by 1,346
Proceedings of the Second International Conference on Knowledge Discovery and Data Mining
Simoudis, E., Han, J., & Fayyad, U. M. (1996) · Cited by 1,121
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
Gionis, A., Mannila, H., & Tsaparas, P. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217303 · Cited by 819
A Nonparametric Estimate of a Multivariate Density Function
Loftsgaarden, D. O., & Quesenberry, C. P. (1965) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177700079 · Cited by 781
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
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
Five Balltree Construction Algorithms
Omohundro, S. M. (2009) · Cited by 422
A distribution-based clustering algorithm for mining in large spatial databases
Xu, X., Ester, M., Kriegel, H.-P., & Sander, J. (2002) · Proceedings 14th International Conference on Data Engineering · doi:10.1109/icde.1998.655795 · Cited by 352
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
Proceedings of the 10th IEEE International Conference on Data Mining (ICDM)
Webb, G. I., Liu, B., Zhang, C., Gunopulos, D., & Wu, X. (2010) · Cited by 247
A novel bankruptcy prediction model based on an adaptive fuzzy k-nearest neighbor method
Chen, H.-L., Yang, B., Wang, G., Liu, J., Xu, X., Wang, S.-J., & Liu, D.-Y. (2011) · Knowledge-Based Systems · doi:10.1016/j.knosys.2011.06.008 · Cited by 182
Proceedings 14th International Conference on Data Engineering
(1998) · Proceedings 14th International Conference on Data Engineering · doi:10.1109/icde.1998.655751 · Cited by 180
Robust support vector data description for outlier detection with noise or uncertain data
Chen, G., Zhang, X., Wang, Z. J., & Li, F. (2015) · Knowledge-Based Systems · doi:10.1016/j.knosys.2015.09.025 · Cited by 97
Ruotsalo, T., Peltonen, J., Eugster, M. J. A., Głowacka, D., Konyushkova, K., Athukorala, K., Kosunen, I., Reijonen, A., Myllymäki, P. J., Jacucci, G., et al. (2013) · Cited by 79
Fast parameterless density-based clustering via random projections
Schneider, J., & Vlachos, M. (2013) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2505515.2505590 · Cited by 34
Extended Fast Search Clustering Algorithm : Widely Density Clusters, No Density Peaks
Wen-kai, Z., & Li, J. (2015) · doi:10.5121/csit.2015.50701 · Cited by 27
Cartification: A Neighborhood Preserving Transformation for Mining High Dimensional Data
Aksehirli, E., Goethals, B., Müller, E., & Vreeken, J. (2013) · Proceedings · doi:10.1109/icdm.2013.146 · Cited by 12
K-Means Clustering Based on Density for Scene Image Classification
Xie, K., Wu, J. C., Yang, W., et al. (2015) · Lecture notes in electrical engineering · doi:10.1007/978-3-662-46469-4_40 · Cited by 9
Cited by
Community detection in networks: A multidisciplinary review
Javed, M. A., Younis, M. S., Latif, S., Qadir, J., & Baig, A. (2018) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2018.02.011 · Cited by 499
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
kNN-IS: An Iterative Spark-based design of the k-Nearest Neighbors classifier for big data
Maillo, J., Ramírez, S., Triguero, I., & Herrera, F. (2017) · Knowledge-Based Systems · doi:10.1016/j.knosys.2016.06.012 · Cited by 316
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
- Du, M., Ding, S., & Jia, H.
- Venue
- Knowledge-Based Systems
- Publisher
- Elsevier BV
- Published
- 2016-05
- Volume
- 99
- Pages
- 135-145
- ISSN
- 0950-7051 (ISSN-L)
- OpenAlex
- W2268194897
- Cited by
- 520
- References
- 30
- FWCI
- 28.49
- 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.