Multi-view Fuzzy Clustering Approach Based on Medoid Invariant Constraint

被引:0
作者
Zhang Y.-P. [1 ,2 ]
Zhou J. [1 ]
Deng Z.-H. [1 ]
Chung F.-L. [3 ]
Jiang Y.-Z. [1 ]
Hang W.-L. [1 ]
Wang S.-T. [1 ,3 ]
机构
[1] School of Digital Media, Jiangnan University, Wuxi
[2] Department of Medical Informatics, Nantong University, Nantong
[3] Department of Computing, Hong Kong Polytechnic University, Hong Kong
来源
Ruan Jian Xue Bao/Journal of Software | 2019年 / 30卷 / 02期
基金
中国国家自然科学基金;
关键词
Collaborative learning; Fuzzy clustering; Medoid invariant; MRI segmentation; Multi-medoid; Multi-view clustering;
D O I
10.13328/j.cnki.jos.005625
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
As for multi-view datasets, direct integration of partition results of all views obtained by traditional single-view clustering approaches does not improve and even deteriorate the clustering performance since that it does not consider the inner relationship across views. To achieve good clustering performance for multi-view datasets, a multi-view clustering model is proposed, which not only considers the within-view clustering quality but also takes the cross-view collaborative learning into account. With respect to within-view partition, to capture more detailed information of cluster structures, a multi-medoid representative strategy is adopted; as for cross-view collaborative learning, it is assumed that a medoid of a cluster in one view is also a medoid of that cluster in another view. Based on the multi-view clustering model, a multi-view fuzzy clustering approach with a medoid invariant constraint (MFCMddI) is proposed in which the invariantan arbitrary medoid across each pair-wise views is guaranteed by maximizing the product of the corresponding prototype weightsin two views. The objective function of MFCMddI can be optimized by applying the Lagrangian multiplier method and KKT conditions. Extensive experiments on synthetic and real-life datasets show that MFCMddI outperforms the existing state-of-the-art multi-view approaches in most cases. © Copyright 2019, Institute of Software, the Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码:282 / 301
页数:19
相关论文
共 36 条
  • [21] Wang Y., Chen L., Mei J.P., Incremental fuzzy clustering with multiple medoids for large data, IEEE Trans. on Fuzzy Systems, 22, 6, pp. 1557-1568, (2014)
  • [22] Krishnapuram R., Joshi A., Nasraoui O., Yi L., Low-complexity fuzzy relational clustering algorithms for Web mining, IEEE Trans. on Fuzzy Systems, 9, 4, pp. 595-607, (2001)
  • [23] Carvalho F.D.A.T.D., Melo F.M.D., Lechevallier Y., A multi-view relational fuzzy c-medoid vectors clustering algorithm, Neurocomputing, 163, C, pp. 115-123, (2015)
  • [24] De Carvalho F.D.A.T., Lechevallier Y., De Melo F.M., Relational partitioning fuzzy clustering algorithms based on multiple dissimilarity matrices, Fuzzy Sets and Systems, 215, pp. 1-28, (2013)
  • [25] Ying W., Chung F.L., Wang S., Scaling Up synchronization-inspired partitioning clustering, IEEE Trans. on Knowledge & Data Engineering, 26, 8, pp. 2045-2057, (2014)
  • [26] Qian P.J., Jiang Y.Z., Deng Z.H., Hu L., Sun S., Wang S.T., Cluster prototypes and fuzzy memberships jointly leveraged cross-domain maximum entropy clustering, IEEE Trans. on Cybernetics, 46, 1, pp. 181-193, (2015)
  • [27] Adhikari S.K., Sing J.K., Basu D.K., Nasipuri M., Conditional spatial fuzzy C-means clustering algorithm for segmentation of MRI images, Applied Soft Computing, 34, pp. 758-769, (2015)
  • [28] Deng Z., Choi K.S., Chung F.L., Wang S.T., Enhanced soft subspace clustering integrating within-cluster and between-cluster information, Pattern Recognition, 43, 3, pp. 767-781, (2010)
  • [29] Martin D.R., Fowlkes C.C., Malik J., Learning to detect natural image boundaries using local brightness, color, and texture cues, IEEE Trans. on Pattern Analysis & Machine Intelligence, 26, 5, pp. 530-549, (2004)
  • [30] Sim T., Baker S., Bsat M., The CMU pose, illumination, and expression database, IEEE Trans. on Pattern Analysis & Machine Intelligence, 25, 12, pp. 1615-1618, (2003)