Multi-view clustering with orthogonal mapping and binary graph

Jianxi Zhao

doi:10.1016/j.eswa.2022.118911

Return

Multi-view clustering with orthogonal mapping and binary graph

2023-03-01

PRE

Jianxi Zhao *

Xiaonan Wang

DOI：10.1016/j.eswa.2022.118911

Original

Original request for help

Save

Abstract

En 中文

The multi-view clustering problem has attracted considerable attention over recent years for the remarkable clustering performance due to exploiting complementary information from multiple views. Most existing related research work processes data in the decimal real value space that is not the most compatible space for computers. Binary code learning, also known as hashing technology, is well-known for fast Hamming distance computation, less storage requirement and accurate calculation results. The Hamming space is most enjoyed by computers because of binary/hash codes. Several studies combine multi-view clustering with binary code learning for improving clustering performance. However, there is much redundant information contained in the learned binary codes, which negatively affects the clustering performance, but these studies ignore eliminating redun-dant information for learning compact codes. In addition, they don't give a unified (one-step) clustering framework with binary graph structure, which doesn't lead to the optimal clustering result due to the infor-mation loss during the two-step process. In this paper, to cope with the two issues, we propose an orthogonal mapping binary graph method (OMBG) for the multi-view clustering problem, which makes the mapping matrix of every view orthogonalize for eliminating redundant information and embeds a binary graph structure into the unified binary multi-view clustering framework for extracting local geometric structure information of binary codes and achieving the optimal clustering result. Furthermore, we design an effective optimization algorithm based on alternating direction minimization to solve the model of OMBG. Extensive experiments performed on four frequently-used benchmark multi-view datasets illustrate the superiority of OMBG which is compared with some state-of-the-art clustering baselines.

Keywords:

Multi-view clustering

Binary code learning

Orthogonal mapping

Graph learning