Clustering based on local density peaks and graph cut
Authors:
- Zhiguo LongZLZhiguo Long
- Yang GaoYGYang Gao
- Hua MengHMHua Meng
- Yuqin YaoYYYuqin Yao
- Tianrui LiTLTianrui Li
- 4 April 2022
- journal article
- research article
- Published by Elsevier in Information Sciences
- Vol. 600, 263-286
Abstract
No abstract availableKeywords
Funding Information
- Ministry of Science and Technology of the People's Republic of China
- National Key Research and Development Program of China (2019YFB1706104)
- National Natural Science Foundation of China (61806170)
- Humanities and Social Science Fund of Ministry of Education of the People's Republic of China (18XJC72040001)
- Ministry of Education of the People's Republic of China
This publication has 27 references indexed in Scilit:
- Robust clustering by detecting density peaks and assigning points based on fuzzy weighted K-nearest neighborsInformation Sciences, 2016
- Study on density peaks clustering based on k-nearest neighbors and principal component analysisKnowledge-Based Systems, 2016
- Clustering by fast search and find of density peaksScience, 2014
- Data clustering: 50 years beyond K-meansPattern Recognition Letters, 2010
- A tutorial on spectral clusteringStatistics and Computing, 2007
- Clustering by Passing Messages Between Data PointsScience, 2007
- Properties of the Hubert-Arable Adjusted Rand Index.Psychological Methods, 2004
- Dynamic self-organizing maps with controlled growth for knowledge discoveryIEEE Transactions on Neural Networks, 2000
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- BIRCHACM SIGMOD Record, 1996