Multi-View Spectral Clustering via Structured Low-Rank Matrix Factorization

Abstract

Multi-view data clustering attracts more attention than their single view counterparts due to the fact that leveraging multiple independent and complementary information from multi-view feature spaces outperforms the single one. Multi-view Spectral Clustering aims at yielding the data partition agreement over their local manifold structures by seeking eigenvalue-eigenvector decompositions. However, as we observed, such classical paradigm still suffers from (1) overlooking the flexible local manifold structure, caused by (2) enforcing the low-rank data correlation agreement among all views; worse still, (3) LRR is not intuitively flexible to capture the latent data clustering structures. In this paper, we present the structured LRR by factorizing into the latent low-dimensional data-cluster representations, which characterize the data clustering structure for each view. Upon such representation, (b) the laplacian regularizer is imposed to be capable of preserving the flexible local manifold structure for each view. (c) We present an iterative multi-view agreement strategy by minimizing the divergence objective among all factorized latent data-cluster representations during each iteration of optimization process, where such latent representation from each view serves to regulate those from other views, such intuitive process iteratively coordinates all views to be agreeable. (d) We remark that such data-cluster representation can flexibly encode the data clustering structure from any view with adaptive input cluster number. To this end, (e) a novel non-convex objective function is proposed via the efficient alternating minimization strategy. The complexity analysis are also presented. The extensive experiments conducted against the real-world multi-view datasets demonstrate the superiority over state-of-the-arts.

Accepted to appear at IEEE Trans on Neural Networks and Learning Systems

References in corpus (4)

• A Survey on Multi-view Learning
• Deep Adaptive Feature Embedding with Local Sample Distributions for Person Re-identification
• What-and-Where to Match: Deep Spatially Multiplicative Integration Networks for Person Re-identification
• Iterative Views Agreement: An Iterative Low-Rank based Structured Optimization Method to Multi-View Spectral Clustering

Cited by in corpus (20)

• Robust Graph Learning from Noisy Data
• Bottom-up Broadcast Neural Network For Music Genre Classification
• An Introduction to Person Re-identification with Generative Adversarial Networks
• An External Knowledge Enhanced Multi-label Charge Prediction Approach with Label Number Learning
• Where to Focus: Deep Attention-based Spatially Recurrent Bilinear Networks for Fine-Grained Visual Recognition
• Cross Domain Knowledge Learning with Dual-branch Adversarial Network for Vehicle Re-identification
• Deep neural network-based classification model for Sentiment Analysis
• PAC-GAN: An Effective Pose Augmentation Scheme for Unsupervised Cross-View Person Re-identification
• An Item Recommendation Approach by Fusing Images based on Neural Networks
• Cross Domain Knowledge Transfer for Unsupervised Vehicle Re-identification
• Multi-view Locality Low-rank Embedding for Dimension Reduction
• Auto-weighted Mutli-view Sparse Reconstructive Embedding
• A Targeted Acceleration and Compression Framework for Low bit Neural Networks
• A fast online cascaded regression algorithm for face alignment
• Co-regularized Multi-view Sparse Reconstruction Embedding for Dimension Reduction
• Non-rigid 3D shape retrieval based on multi-view metric learning
• Self-Weighted Multiview Metric Learning by Maximizing the Cross Correlations
• Purifying Naturalistic Images through a Real-time Style Transfer Semantics Network
• TPM: A GPS-based Trajectory Pattern Mining System
• Multi-feature Distance Metric Learning for Non-rigid 3D Shape Retrieval