点击次数：

论文类型：会议论文

发表时间：2017-01-01

收录刊物：CPCI-S

卷号：2017-November

页面范围：6-10

关键字：multi-view clustering; self-paced learning; Self-Paced regularizer; spectral clustering

摘要：Multi-view data are prevalent in both machine learning and artificial intelligence. A panoply of multi-view clustering algorithms have been proposed to deal with multiview data. However, most of them just blindly concatenate all the views in spite of characteristic of different views. Self-paced learning is a kind of learning scheme which comes from human learning. It progresses from easy example to complex example during learning process. In analogy with these intuitions, we can learn the easiness of multiple views. Therefore, in this paper, we first present a new Self-Paced Learning Regularizer which is a kind of mixture weighting scheme to allocate different weight to the different view by considering views' complexity. To recap the effectiveness of our self-paced learning regularizer, we propose a novel self-paced learning based multi-view spectral clustering algorithm(SPLMVC), which can define complexity across views and then automatically assign weight to each view. Extensive experiments on real-world multi-view datasets reveal its strength by comparison with other state-of-art methods.