返回
A new fast fuzzy partitioning algorithm
DOI:10.1016/j.eswa.2015.12.034.png)
摘要
En 中文
In this paper, a new fast incremental fuzzy partitioning algorithm able to find either a fuzzy globally optimal partition or a fuzzy locally optimal partition of the set A subset of R-n close to the global one is proposed. This is the main impact of the paper, which could have an important role in applied research. Since fuzzy k-optimal partitions with k = 2, 3,..., k(max) clusters are determined successively in the algorithm, it is possible to calculate corresponding validity indices for every obtained partition. The number k(max) is defined in such a way that the objective function value of optimal partition with km, clusters is relatively very close to the objective function value of optimal partition with (k(max)-1) clusters. Before clustering, the data are normalized and afterwards several validity indices are applied to partitions of the normalized data. Very simple relationships between used validity indices on normalized and original data are given as well. Hence, the proposed algorithm is able to find optimal partitions with the most appropriate number of clusters. The algorithm is tested on numerous synthetic data sets and several real data sets from the UCI data repository. (C) 2016 Elsevier Ltd. All rights reserved.
Keyword:
Fuzzy clustering
Fuzzy c-means
Fuzzy locally optimal partition
Fuzzy globally optimal partition
DIRECT
Incremental algorithm
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
2.9W
被引数:
10.2W
机构
引用论文
An efficient approach for unsupervised fuzzy clustering based on grouping evolution strategies一种基于分组进化策略的高效无监督模糊聚类方法
PATTERN RECOGNITION
IF7.6
Multi-objective design of hierarchical consensus functions for clustering ensembles via genetic programming通过遗传编程实现聚类集合的分层共识函数的多目标设计

