.png){kind=icon}
返回
A Novel Adaptive Possibilistic Clustering Algorithm
.png){kind=icon}
OA
AI
DOI：10.1109/TFUZZ.2015.2486806.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a novel possibilistic c-means clustering algorithm, called adaptive possibilistic c-means, is presented. Its main feature is that its parameters, after their initialization, are properly adapted during its execution. Provided that the algorithm starts with a reasonable overestimate of the number of physical clusters formed by the data, it is capable, in principle, to unravel them (a long-standing issue in the clustering literature). This is due to the fully adaptive nature of the proposed algorithm that enables the removal of the clusters that gradually become obsolete. In addition, the adaptation of all its parameters increases the flexibility of the algorithm in following the variations in the formation of the clusters that occur from iteration to iteration. Theoretical results that are indicative of the convergence behavior of the algorithm are also provided. Finally, extensive simulation results on both synthetic and real data highlight the effectiveness of the proposed algorithm.
Keyword:
Cluster elimination
parameter adaptation
possibilistic clustering
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
11.9
论文数:
5.0K
被引数:
2.9W
机构
引用论文
Determining Plant-available Water of Woody Ornamentals in Containers In Situ During Production.png)
HortScience
OAAI
HortScienceIF0
OAAI分享收藏Separation by dielectrophoresis of dormant and nondormant bacterial cells of Mycobacterium smegmatisOAAI
OAAI分享收藏On the energy/spectral efficiency of multi-user full-duplex massive MIMO systems with power controlOAAI
OAAI分享收藏分享收藏分享收藏
查看更多内容