期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
NEW SHADOWED C-MEANS CLUSTERING WITH FEATURE WEIGHTS 被引量:2
1
作者 王丽娜 王建东 姜坚 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI 2012年第3期273-283,共11页
Partition-based clustering with weighted feature is developed in the framework of shadowed sets. The objects in the core and boundary regions, generated by shadowed sets-based clustering, have different impact on the ... Partition-based clustering with weighted feature is developed in the framework of shadowed sets. The objects in the core and boundary regions, generated by shadowed sets-based clustering, have different impact on the prototype of each cluster. By integrating feature weights, a formula for weight calculation is introduced to the clustering algorithm. The selection of weight exponent is crucial for good result and the weights are updated iteratively with each partition of clusters. The convergence of the weighted algorithms is given, and the feasible cluster validity indices of data mining application are utilized. Experimental results on both synthetic and real-life numerical data with different feature weights demonstrate that the weighted algorithm is better than the other unweighted algorithms. 展开更多
关键词 fuzzy C-means shadowed sets shadowed C-means feature weights cluster validity index
下载PDF
Evolutionary Multi-Tasking Optimization for High-Efficiency Time Series Data Clustering
2
作者 Rui Wang Wenhua Li +2 位作者 Kaili Shen Tao Zhang Xiangke Liao 《Tsinghua Science and Technology》 SCIE EI CAS CSCD 2024年第2期343-355,共13页
Time series clustering is a challenging problem due to the large-volume,high-dimensional,and warping characteristics of time series data.Traditional clustering methods often use a single criterion or distance measure,... Time series clustering is a challenging problem due to the large-volume,high-dimensional,and warping characteristics of time series data.Traditional clustering methods often use a single criterion or distance measure,which may not capture all the features of the data.This paper proposes a novel method for time series clustering based on evolutionary multi-tasking optimization,termed i-MFEA,which uses an improved multifactorial evolutionary algorithm to optimize multiple clustering tasks simultaneously,each with a different validity index or distance measure.Therefore,i-MFEA can produce diverse and robust clustering solutions that satisfy various preferences of decision-makers.Experiments on two artificial datasets show that i-MFEA outperforms single-objective evolutionary algorithms and traditional clustering methods in terms of convergence speed and clustering quality.The paper also discusses how i-MFEA can address two long-standing issues in time series clustering:the choice of appropriate similarity measure and the number of clusters. 展开更多
关键词 time series clustering evolutionary multi-tasking multifactorial optimization clustering validity index distance measure
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部