A robust multi-view clustering algorithm based on possibilistic C-means

DOI10.13245/J.HUST.140313MaRDI QIDQ2927300zbMATH OpenFDO

Authors Xinxin Yang, Shaobin Huang

Publication date 3 November 2014

Published in Journal of Huazhong University of Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.13245/J.HUST.140313

zbMATH Keywords

clusteringdata miningmulti-view datanumber of clusterspossibilistic C-means

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• Multi-view clustering algorithm based on subspace fusion
• Multi-view fuzzy clustering algorithm based on partition adaptive-fusion
• Multi-view spectral clustering via robust local subspace learning
• Dual self-paced multi-view clustering
• An enhanced possibilistic c-means clustering algorithm EPCM

Cited in

(5)

• Multi-view fuzzy clustering algorithm based on partition adaptive-fusion
• Multi-view clustering algorithm based on subspace fusion
• A collaborative partition multi-view fuzzy clustering algorithm using entropy weighting
• Dual self-paced multi-view clustering
• Evidential Weighted Multi-view Clustering

This page was built for publication: A robust multi-view clustering algorithm based on possibilistic C-means

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2927300)