Abstract
Existing multi-view clustering methods either seek to directly learn a consistent spectral embedding, or to learn a consistent graph. This work presents a novel model, called Multi-view Clustering with Interactive Mechanism (MCIM). Using the interactive mechanism, the uniform graph and spectral embedding can be learned alternatively and promote to each other. Furthermore, we perform spectral embedding learning on Grassmann manifold via an implicitly weighted-learning scheme and reveal the clustering result via graph learning. To solve the proposed model, we propose an efficient optimization method and provide the corresponding convergence analysis. The experimental results on real image datasets demonstrate the superiorities of MCIM compared to several SOTA methods.
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.