Graph-Collaborated Auto-Encoder Hashing for Multi-view Binary Clustering

by   Huibing Wang, et al.

Unsupervised hashing methods have attracted widespread attention with the explosive growth of large-scale data, which can greatly reduce storage and computation by learning compact binary codes. Existing unsupervised hashing methods attempt to exploit the valuable information from samples, which fails to take the local geometric structure of unlabeled samples into consideration. Moreover, hashing based on auto-encoders aims to minimize the reconstruction loss between the input data and binary codes, which ignores the potential consistency and complementarity of multiple sources data. To address the above issues, we propose a hashing algorithm based on auto-encoders for multi-view binary clustering, which dynamically learns affinity graphs with low-rank constraints and adopts collaboratively learning between auto-encoders and affinity graphs to learn a unified binary code, called Graph-Collaborated Auto-Encoder Hashing for Multi-view Binary Clustering (GCAE). Specifically, we propose a multi-view affinity graphs learning model with low-rank constraint, which can mine the underlying geometric information from multi-view data. Then, we design an encoder-decoder paradigm to collaborate the multiple affinity graphs, which can learn a unified binary code effectively. Notably, we impose the decorrelation and code balance constraints on binary codes to reduce the quantization errors. Finally, we utilize an alternating iterative optimization scheme to obtain the multi-view clustering results. Extensive experimental results on 5 public datasets are provided to reveal the effectiveness of the algorithm and its superior performance over other state-of-the-art alternatives.


page 1

page 3

page 10


Graph-based Multi-view Binary Learning for Image Clustering

Hashing techniques, also known as binary code learning, have recently ga...

Auto-Encoder based Co-Training Multi-View Representation Learning

Multi-view learning is a learning problem that utilizes the various repr...

Cluster-wise Unsupervised Hashing for Cross-Modal Similarity Search

In this paper, we present a new cluster-wise unsupervised hashing (CUH) ...

Auto-Encoding Twin-Bottleneck Hashing

Conventional unsupervised hashing methods usually take advantage of simi...

Subspace-Contrastive Multi-View Clustering

Most multi-view clustering methods are limited by shallow models without...

Anchor Graph Structure Fusion Hashing for Cross-Modal Similarity Search

Cross-modal hashing still has some challenges needed to address: (1) mos...

Visual Tactile Fusion Object Clustering

Object clustering, aiming at grouping similar objects into one cluster w...

Please sign up or login with your details

Forgot password? Click here to reset