1 RODRIGUEZA, LAIOA. Clustering by fast search and find of density peaks [J]. Science, 2014, 344(6191): 1492-1496. 2 杨洁,王国胤,庞紫玲.密度峰值聚类相关问题的研究[J].南京大学学报(自然科学版),2017,53(4):791-801. YANGJ, WANGG Y, PANGZ L. Relative researches of clustering by fast search and find of density peaks [J]. Journal of Nanjing University (Natural Sciences), 2017, 53(4): 791-801. 3 谢娟英,高红超,谢维信.K近邻优化的密度峰值快速搜索聚类算法[J].中国科学:信息科学,2016,46(2):258-280. XIEJ Y, GAOH C, XIEW X. K-nearest neighbors optimized clustering algorithm by fast search and finding the density peaks of a dataset [J]. SCIENTIA SINICA Informationis, 2016, 46(2): 258-280. 4 SEYEDIS A, LOTFIA, MORADIP, et al. Dynamic graph-based label propagation for density peaks clustering [J]. Expert Systems with Applications, 2019, 115: 314-328. 5 LIUR, WANGH, YUX. Shared-nearest-neighbor-based clustering by fast search and find of density peaks [J]. Information Sciences, 2018, 450: 200-226. 6 LIUY, MAZ, YUF. Adaptive density peak clustering based on K-nearest neighbors with aggregating strategy [J]. Knowledge-Based Systems, 2017, 133: 208-220. 7 WANGS, WANGD, LIC, et al. Comment on “Clustering by fast search and find of density peaks” [EB/OL].[2019-11-05]. https://arxiv.org/ftp/arxiv/papers/1501/1501.04267.pdf. 8 XUJ, WANGG, DENGW. DenPEHC: density peak based efficient hierarchical clustering [J]. Information Sciences, 2016, 373: 200-218. 9 DINGS, DUM, SUNT, et al. An entropy-based density peaks clustering algorithm for mixed type data employing fuzzy neighborhood [J]. Knowledge-Based Systems, 2017, 133: 294-313. 10 YANH, WANGL, LUY. Identifying cluster centroids from decision graph automatically using a statistical outlier detection method[J]. Neurocomputing, 2019, 329: 348-358. 11 马春来,单洪,马涛.一种基于簇中心点自动选择策略的密度峰值聚类算法[J].计算机科学,2016,43(7):255-258,280. MAC L, SHANH, MAT. Improved density peaks based clustering algorithm with strategy choosing cluster center automatically [J]. Computer Science, 2016, 43(7): 255-258, 280. 12 薛小娜,高淑萍,彭弘铭,等.基于K近邻和多类合并的密度峰值聚类算法[J].吉林大学学报(理学版),2019,57(1):111-120. XUEX N, GAOS P, PENGH M, et al. Density peaks clustering algorithm based on K-nearest neighbors and classes-merging[J]. Journal of Jilin University (Science Edition), 2019, 57(1): 111-120. 13 ZHANGY, CHENS, YUG. Efficient distributed density peaks for clustering large data sets in MapReduce [J]. IEEE Transactions on Knowledge and Data Engineering, 2016, 28(12): 3218-3230. 14 DUA D, KARRA TANISKIDOUE. UCI machine learning repository [DB/OL]. [2019-11-05].http://archive.ics.uci.edu/ml. 15 VINHN X, EPPSJ, BAILEYJ. Information theoretic measures for clusterings comparison: is a correction for chance necessary?[C]// Proceedings of the 26th Annual International Conference on Machine Learning. New York: ACM, 2009: 1073-1080. 16 FOWLKESE B, MALLOWSC L. A method for comparing two hierarchical clusterings [J]. Journal of the American Statistical Association, 1983, 78(383): 553-569. 17 FUL, MEDICOE. FLAME, a novel fuzzy clustering method for the analysis of DNA microarray data [J]. BMC bioinformatics, 2007, 8: Article No.3. 18 GIONISA, MANNILAH, TSAPARASP. Clustering aggregation[J]. ACM Transactions on Knowledge Discovery from Data, 2007, 1(1): Article No.4. 19 VEENMANC J, REINDERSM J T, BACKERE. A maximum variance cluster algorithm [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2002, 24(9): 1273-1280. 20 CHANGH, YEUNGD Y. Robust path-based spectral clustering[J]. Pattern Recognition, 2008, 41(1): 191-203. 21 JAINA K, LAW M H C. Data clustering: a user’s dilemma [C]// Proceedings of the 2005 International Conference on Pattern Recognition and Machine Intelligence, LNCS 3776. Berlin: Springer, 2005: 1-10. 22 FRÄNTIP, VIRMAJOKIO. Iterative shrinking method for clustering problems [J]. Pattern Recognition, 2006, 39(5): 761-775. 23 FRÄNTIP, VIRMAJOKIO, HAUTAMAKIV. Fast agglomerative clustering using a k-nearest neighbor graph [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2006, 28(11): 1875-1881. |