Zhang, C., Zhang, X., Zhang, M. Q., Li, Y. (January 2007) Neighbor number, valley seeking and clustering. Pattern Recognition Letters, 28 (2). pp. 173-180. ISSN 0167-8655
Abstract
This paper proposes a novel nonparametric clustering algorithm capable of identifying shape-free clusters. This algorithm is based on a nonparametric estimation of the normalized density derivative (NDD) and the local convexity of the density distribution function, both of which are represented in a very concise form in terms of neighbor numbers. We use NDD to measure the dissimilarity between each pair of observations in a local neighborhood and to build a connectivity graph. Combined with the local convexity, this similarity measure can detect observations in local minima (valleys) of the density function, which separate observations in different major clusters. We demonstrate that this algorithm has a close relationship with the single-linkage hierarchical clustering and can be viewed as its extension. The performance of the algorithm is tested with both synthetic and real datasets. An example of color image segmentation is also given. Comparisons with several representative existing algorithms show that the proposed method can robustly identify major clusters even when there are complex configurations and/or large overlaps. (c) 2006 Elsevier B.V. All rights reserved.
| Item Type: | Paper |
|---|---|
| Uncontrolled Keywords: | nonparametric density estimation neighbor number valley seeking shape-free clustering image segmentation |
| Subjects: | bioinformatics > genomics and proteomics > computers > computer software bioinformatics > genomics and proteomics > annotation > dataset annotation |
| CSHL Authors: | |
| Communities: | CSHL labs > Zhang lab |
| Depositing User: | CSHL Librarian |
| Date: | January 2007 |
| Date Deposited: | 30 Aug 2011 13:33 |
| Last Modified: | 11 Apr 2018 15:52 |
| URI: | https://repository.cshl.edu/id/eprint/15291 |
Actions (login required)
 |
Administrator's edit/view item |
