首页 | 本学科首页   官方微博 | 高级检索  
     

基于双重低秩分解的不完整多视图子空间学习
引用本文:徐光生,王士同.基于双重低秩分解的不完整多视图子空间学习[J].智能系统学报,2022,17(6):1084-1092.
作者姓名:徐光生  王士同
作者单位:1. 江南大学 人工智能与计算机学院,江苏 无锡 214122;2. 江南大学 江苏省媒体设计与软件技术重点实验室,江苏 无锡 214122
摘    要:多视图数据在现实世界中应用广泛,各种视角和不同的传感器有助于更好的数据表示,然而,来自不同视图的数据具有较大的差异,尤其当多视图数据不完整时,可能导致训练效果较差甚至失败。为了解决该问题,本文提出了一个基于双重低秩分解的不完整多视图子空间学习算法。所提算法通过两方面来解决不完整多视图问题:一方面,基于双重低秩分解子空间框架,引入潜在因子来挖掘多视图数据中缺失的信息;另一方面,通过预先学习的多视图数据低维特征获得更好的鲁棒性,并以有监督的方式来指导双重低秩分解。实验结果证明,所提算法较之前的多视图子空间学习算法有明显优势;即使对于不完整的多视图数据,该算法也具有良好的分类性能。

关 键 词:子空间学习  监督学习  不完整多视图  潜在因子  低秩约束  双重低秩分解  特征对齐  低维特征

Incomplete multi-view subspace learning through dual low-rank decompositions
XU Guangsheng,WANG Shitong.Incomplete multi-view subspace learning through dual low-rank decompositions[J].CAAL Transactions on Intelligent Systems,2022,17(6):1084-1092.
Authors:XU Guangsheng  WANG Shitong
Affiliation:1. School of Artificial Intelligence and Computer Science, Jiangnan University, Wuxi 214122, China;2. Key Laboratory of Media Design and Software Technology of Jiangsu Province, Jiangnan University, Wuxi 214122, China
Abstract:Multi-view data are very common in real-world applications. Different viewpoints and sensors tend to facilitate better data representation. However, data from various perspectives show a significant variation. Especially when only incomplete multi-view data are available, the corresponding multi-view learning may result in poor performance or even training failure. This study proposes a multi-view learning algorithm called IMSL (Incomplete Multi-View Subspace Learning through Dual Low-Rank Decompositions) to tackle this issue. The proposed algorithm addresses the incomplete multi-view problem in two ways: (1) Latent factors are introduced into a dual low-rank decomposition subspace framework to mine missing information in the multi-view data. (2) IMSL seeks a more robust subspace through pre-learned low-dimensional features of multi-view data. Furthermore, the supervised data are used to guide dual low-rank decompositions. Experimental results show that the proposed algorithm outperforms the previous multi-view subspace learning algorithms on the adopted incomplete multi-view datasets. Pre-learning low-dimensional features of multi-view data, on the other hand, can improve robustness, and dual low-rank decomposition can be guided in a supervised manner.
Keywords:subspace learning  supervised learning  incomplete multi-view  latent factors  low-rank constraint  dual low-rank decompositions  feature alignment  low-dimensional feature
点击此处可从《智能系统学报》浏览原始摘要信息
点击此处可从《智能系统学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号