Fuzzy clustering with the entropy of attribute weights.

Neurocomputing(2016)

引用 127|浏览69
暂无评分
摘要
For many datasets, it is a difficult work to seek a proper cluster structure which covers the entire feature set. To extract the important features and improve the clustering, the maximum-entropy-regularized weighted fuzzy c-means (EWFCM) algorithm is proposed in this paper. A new objective function is developed in the proposed algorithm to achieve the optimal clustering result by minimizing the dispersion within clusters and maximizing the entropy of attribute weights simultaneously. Then the kernelization of proposed algorithm is realized for clustering the data with 'non-spherical' shaped clusters. Experiments on synthetic and real-world datasets have demonstrated the efficiency and superiority of the presented algorithms.
更多
查看译文
关键词
Attribute-weighted clustering,Maximum-entropy regularization,Kernel method,Feature selection
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要