A Novel clustering method based on hybrid K-nearest-neighbor graph
Authors:
- Yikun QinYQYikun Qin
- Zhu Liang YuZYZhu Liang Yu
- Chang-Dong WangCWChang-Dong Wang
- Zhenghui GuZGZhenghui Gu
- Yuanqing LiYLYuanqing Li
- 1 February 2018
- journal article
- research article
- Published by Elsevier in Pattern Recognition
- Vol. 74, 1-14
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61573150, 61573152, 61175114, 91420302)
This publication has 26 references indexed in Scilit:
- Clustering algorithm based on mutual K‐nearest neighbor relationshipsStatistical Analysis and Data Mining: An ASA Data Science Journal, 2012
- Conscience online learning: an efficient approach for robust kernel-based clusteringKnowledge and Information Systems, 2011
- A multi-prototype clustering algorithmPattern Recognition, 2009
- Clustering by Passing Messages Between Data PointsScience, 2007
- ST-DBSCAN: An algorithm for clustering spatial–temporal dataData & Knowledge Engineering, 2007
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- Gradient-based learning applied to document recognitionProceedings of the IEEE, 1998
- Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detectionStatistics & Probability Letters, 1997
- Silhouettes: A graphical aid to the interpretation and validation of cluster analysisJournal of Computational and Applied Mathematics, 1987
- A dendrite method for cluster analysisCommunications in Statistics, 1974