Multiview Feature Analysis via Structured Sparsity and Shared Subspace Discovery

• Published in: Neural computation Vol. 29; no. 7; pp. 1986 - 2003
• Main Authors: Chang, Yan-Shuo, Nie, Feiping, Wang, Ming-Yu
• Format: Journal Article
• Language: English
• Published: One Rogers Street, Cambridge, MA 02142-1209, USA MIT Press 01.07.2017; MIT Press Journals, The
• Subjects: Algorithms; Classification; Correlation; Correlation analysis; Iterative algorithms; Letters; Machine learning; Matrices (mathematics); Matrix; Optimization; Performance enhancement; Sparsity; Subspaces
• ISSN: 0899-7667; 1530-888X; 1530-888X
• DOI: 10.1162/NECO_a_00977

Since combining features from heterogeneous data sources can significantly boost classification performance in many applications, it has attracted much research attention over the past few years. Most of the existing multiview feature analysis approaches separately learn features in each view, ignoring knowledge shared by multiple views. Different views of features may have some intrinsic correlations that might be beneficial to feature learning. Therefore, it is assumed that multiviews share subspaces from which common knowledge can be discovered. In this letter, we propose a new multiview feature learning algorithm, aiming to exploit common features shared by different views. To achieve this goal, we propose a feature learning algorithm in a batch mode, by which the correlations among different views are taken into account. Multiple transformation matrices for different views are simultaneously learned in a joint framework. In this way, our algorithm can exploit potential correlations among views as supplementary information that further improves the performance result. Since the proposed objective function is nonsmooth and difficult to solve directly, we propose an iterative algorithm for effective optimization. Extensive experiments have been conducted on a number of real-world data sets. Experimental results demonstrate superior performance in terms of classification against all the compared approaches. Also, the convergence guarantee has been validated in the experiment.