点击次数：

论文类型： 会议论文

发表时间： 2015-01-25

收录刊物： EI、Scopus

卷号： 4

页面范围： 3174-3180

摘要： Existing multi-view clustering algorithms require that the data is completely or partially mapped between each pair of views. However, this requirement could not be satisfied in most practical settings. In this paper, we tackle the problem of multi-view clustering for unmapped data in the framework of NMF based clustering. With the help of inter-view constraints, we define the disagreement between each pair of views by the fact that the indicator vectors of two instances from two different views should be similar if they belong to the same cluster and dissimilar otherwise. The overall objective of our algorithm is to minimize the loss function of NMF in each view as well as the disagreement between each pair of views. Experimental results show that, with a small number of constraints, the proposed algorithm gets good performance on unmapped data, and outperforms existing algorithms on partially mapped data and completely mapped data. ? 2015, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.