Abstract
In recent years, multi-view clustering algorithms have achieved promising performance by exploiting the com-plementarity and consistency of different views. However, many multi-view spectral clustering methods only focus on the con-sistent information of views, and the time cost of feature decomposition is expensive. Moreover, these methods also require post-processing (e.g., k-means) to obtain the final clustering results. To overcome these limitations simultaneously, we propose a novel multi-view clustering algorithm. Firstly, the method removes the inconsistent information of the views through cross-view measurement to maintain consistent information. These inconsistencies may be caused by noise, corruptions, or view-specific properties and will affect the quality of the similarity matrix. Then, we learn a consensus embedding matrix with non-negative constraints by performing a low-rank decomposition of the consistency information. In this way, we can replace the eigendecomposition of the n × n Laplacian matrix in spectral clustering with the singular value decomposition of a n × c low-rank matrix to reduce the computational burden, where c ≪ n. Furthermore, due to the non-negative constraint, we can directly obtain the clustering results. Also, to consider the diversity of views, adaptive weighting is applied to different view data. Compared to state-of-the-art multi-view clustering methods on five benchmark multi-view datasets, we demonstrate the superiority and effectiveness of our approach. We release the source code at <uri xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://github.com/hulu88/FAMvC</uri> .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.