Your browser doesn't support javascript.
loading
Sparse Generalized Canonical Correlation Analysis: Distributed Alternating Iteration-Based Approach.
Lv, Kexin; Cai, Jia; Huo, Junyi; Shang, Chao; Huang, Xiaolin; Yang, Jie.
Afiliación
  • Lv K; Institute of Image Processing and Pattern Recognition, Shanghai Jiao Tong University, Shanghai 200240, China Kelen_Lv@sjtu.edu.cn.
  • Cai J; School of Digital Economics, Guangdong University of Finance and Economics, Guangzhou 510320, China jiacai1999@gdufe.edu.cn.
  • Huo J; ByteDance Ltd., Beijing 100089, China jh4a19@soton.ac.uk.
  • Shang C; Department of Automation, Beijing National Research Center for Information Science and Technology, Tsinghua University, Beijing 100084, China c-shang@tsinghua.edu.cn.
  • Huang X; Institute of Image Processing and Pattern Recognition, Shanghai Jiao Tong University, Shanghai 200240, China xiaolinhuang@sjtu.edu.cn.
  • Yang J; Institute of Image Processing and Pattern Recognition, Shanghai Jiao Tong University, Shanghai 200240, China jieyang@sjtu.edu.cn.
Neural Comput ; 36(7): 1380-1409, 2024 Jun 07.
Article en En | MEDLINE | ID: mdl-38776967
ABSTRACT
Sparse canonical correlation analysis (CCA) is a useful statistical tool to detect latent information with sparse structures. However, sparse CCA, where the sparsity could be considered as a Laplace prior on the canonical variates, works only for two data sets, that is, there are only two views or two distinct objects. To overcome this limitation, we propose a sparse generalized canonical correlation analysis (GCCA), which could detect the latent relations of multiview data with sparse structures. Specifically, we convert the GCCA into a linear system of equations and impose ℓ1 minimization penalty to pursue sparsity. This results in a nonconvex problem on the Stiefel manifold. Based on consensus optimization, a distributed alternating iteration approach is developed, and consistency is investigated elaborately under mild conditions. Experiments on several synthetic and real-world data sets demonstrate the effectiveness of the proposed algorithm.

Texto completo: 1 Colección: 01-internacional Base de datos: MEDLINE Idioma: En Revista: Neural Comput Asunto de la revista: INFORMATICA MEDICA Año: 2024 Tipo del documento: Article País de afiliación: China

Texto completo: 1 Colección: 01-internacional Base de datos: MEDLINE Idioma: En Revista: Neural Comput Asunto de la revista: INFORMATICA MEDICA Año: 2024 Tipo del documento: Article País de afiliación: China