Graph-collaborated Auto-encoder Hashing For Multi-view Binary Clustering

Abstract

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

Stats

• citations80
• S2 citations—
• github stars0
• HF likes0
• heat score14.31
• arxiv keywang2023graph

Related papers

• Graph-based Multi-view Binary Learning For Image Clustering (2019)11.39
• Auto-encoding Twin-bottleneck Hashing (2020)19.34
• Cluster-wise Unsupervised Hashing For Cross-modal Similarity Search (2019)11.39
• Simultaneous Feature Aggregating And Hashing For Compact Binary Code Learning (2019)9.92
• Self-supervised Video Hashing With Hierarchical Binary Auto-encoder (2018)17.81
• Discriminative Cross-view Binary Representation Learning (2018)4.52
• Robust Hashing For Multi-view Data: Jointly Learning Low-rank Kernelized Similarity Consensus And Hash Functions (2016)11.19
• Learning Discriminative Hashing Codes For Cross-modal Retrieval Based On Multi-view Features (2018)3.58