首页|Sparse Reconstructive Evidential Clustering for Multi-View Data
Sparse Reconstructive Evidential Clustering for Multi-View Data
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
万方数据
维普
Although many multi-view clustering(MVC)algo-rithms with acceptable performances have been presented,to the best of our knowledge,nearly all of them need to be fed with the correct number of clusters.In addition,these existing algorithms create only the hard and fuzzy partitions for multi-view objects,which are often located in highly-overlapping areas of multi-view feature space.The adoption of hard and fuzzy partition ignores the ambiguity and uncertainty in the assignment of objects,likely leading to performance degradation.To address these issues,we propose a novel sparse reconstructive multi-view evidential clus-tering algorithm(SRMVEC).Based on a sparse reconstructive procedure,SRMVEC learns a shared affinity matrix across views,and maps multi-view objects to a 2-dimensional human-readable chart by calculating 2 newly defined mathematical met-rics for each object.From this chart,users can detect the number of clusters and select several objects existing in the dataset as cluster centers.Then,SRMVEC derives a credal partition under the framework of evidence theory,improving the fault tolerance of clustering.Ablation studies show the benefits of adopting the sparse reconstructive procedure and evidence theory.Besides,SRMVEC delivers effectiveness on benchmark datasets by out-performing some state-of-the-art methods.
万方数据
维普
