Multiview 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. Among all the methods, Low-Rank Representation (LRR) is effective, by exploring the multiview consensus structures beyond the low-rankness to boost the clustering performance. However, as we observed, such classical paradigm still suffers from the following stand-out limitations for multiview spectral clustering of (1) overlooking the flexible local manifold structure, caused by (2) aggressively enforcing the low-rank data correlation agreement among all views, such strategy therefore cannot achieve the satisfied between-views agreement; 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 realworld multi-view datasets demonstrate the superiority over state-of-the-arts.

A Fast Online Cascaded Regression Algorithm for Face Alignment

“…A cascade regression of extreme learning machine is first introduced and its parallel version is developed to train a offline model. Then, we present an efficient method to incrementally update a trained model to make it more generalizable [16], [43] and new optimization strategy [44], [45].…”

Cross domain knowledge learning with dual-branch adversarial network for vehicle re-identification

“…It is observed that, when the well-trained reID model is tested on other domain without fine-tuning, there is always a severe performance drop due to the domain bias. However, most existing works on reID follow the supervised learning paradigm which always trains the reID model using the images in the target domain first to adapt the style of the target domain [8] [9][10] [11][12] [13]. Hence, most of these supervised learning methods can not be utilized in the real scenario directly.…”

Medi-Care AI: Predicting medications from billing codes via robust recurrent neural networks

“…However, little efforts are put into systematically modelling the EHR with missing values [9] since it is difficult to capture the missing patterns in medical billing codes. Simple solutions such as omitting the missing data and to perform analysis only on the observed data, or filling in the missing values through smoothing/interpolation [10], spectral analysis [11,12,13,14,15], and multiple imputations [16] offer plausible ways to the missing values in data series. However, these solutions often result in suboptimal analysis and poor predictions because the imputations are disparate from the prediction models and missing patterns are not properly described [17].…”