.png){kind=icon}
返回
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}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
NLMSA
pattern recognition
cluster analysis
kernel density estimation
local optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
4.6K
被引数:
1.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
Talking dirty - effluent and sewage irreverence in South Africa: A conservation crime perspective
OAAI
OAAI分享收藏 没有更多内容
没有更多内容