聚类分析
模糊聚类
计算机科学
模式识别(心理学)
高维数据聚类
人工智能
数据挖掘
可解释性
CURE数据聚类算法
相关聚类
模糊逻辑
数学
作者
Jie Zhou,Witold Pedrycz,Can Gao,Wai Keung Wong,Jun Wan,Zhong Ming
标识
DOI:10.1109/tfuzz.2021.3052362
摘要
Fuzzy clustering techniques, especially fuzzy C-means (FCM) and its weighted variants, are typical partitive clustering models that are widely used for revealing possible hidden structures in data. Although they can quantitatively depict the overlapping areas with a partition matrix, their performances deteriorate when dealing with high-dimensional data because the distance computations may be negatively impacted by the irrelevant features, and then the concentration effect may arise. Moreover, they are sensitive to noisy environments. To tackle these obstacles, a robust jointly sparse fuzzy clustering method (RJSFC) is proposed in this study. The representative prototypes, sparse membership grades, and an orthogonal projection matrix are simultaneously learnt when optimizing RJSFC. The obtained low-dimensional embeddings can preserve the local neighborhood structure, and the clustering is conducted in the transformed lower dimensional space rather than the original space, which improves the capability of fuzzy clustering for dealing with high-dimensional scenarios. Furthermore, ${L_{2,1}}$-norm is exploited as the basic metric for both loss and regularization parts in RJSFC, the robustness of the model and the interpretability of the extracted features are enhanced. The notions of fuzzy clustering, neighborhood structure preservation, and feature extraction are seamlessly integrated into a unified model. The limitation of the previous two-stage clustering framework when dealing with high-dimensional data entailing dimensionality reduction and clustering procedures separately can be effectively addressed. Extensive experimental results on various well-known datasets demonstrate the usefulness of RJSFC when comparing with some state-of-the-art methods.
科研通智能强力驱动
Strongly Powered by AbleSci AI