.png){kind=icon}
.png){kind=icon}
Return
Clustering based on kernel density estimation: nearest local maximum searching algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.chemolab.2004.02.006.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Nearest local maximum searching algorithm (NLMSA), an unsupervised clustering algorithm based on kernel density estimation, is proposed. It is designed for detecting inherent group structures with arbitrary shape clusters among multidimensional measurement data without any a priori information. The algorithm is named after its clustering mechanism of converging data points to their corresponding nearest local maxima of the data's density estimate along the ascending gradient direction. Two simulated data sets and two real data sets are employed to validate the performance of the method. A comparison between the clustering results obtained from the proposed algorithm and the K-means cluster analysis shows that the NLMSA possesses quite satisfactory performance. (C) 2004 Elsevier B.V. All rights reserved.
Keywords:
NLMSA
pattern recognition
cluster analysis
kernel density estimation
local optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
4.6K
Citations:
1.2W
Organization
No organization information available