Multi-view clustering with orthogonal mapping and binary graph

作者：

Highlights：

• To learn compact codes, we force mapping matrix of each view to orthogonalize.

• A binary graph structure is embedded into one-step binary multi-view clustering.

• An effective solving algorithm based on ADM is proposed for the above model.

• Empirical experimental results illustrate that the effectiveness of the method.

摘要

•To learn compact codes, we force mapping matrix of each view to orthogonalize.•A binary graph structure is embedded into one-step binary multi-view clustering.•An effective solving algorithm based on ADM is proposed for the above model.•Empirical experimental results illustrate that the effectiveness of the method.

论文关键词：Multi-view clustering,Binary code learning,Orthogonal mapping,Graph learning

论文评审过程：Received 27 May 2022, Revised 27 August 2022, Accepted 23 September 2022, Available online 30 September 2022, Version of Record 6 October 2022.

论文官网地址：https://doi.org/10.1016/j.eswa.2022.118911