Unsupervised multi-view feature extraction with dynamic graph learning

被引:26
|
作者
Shi, Dan [1 ]
Zhu, Lei [1 ]
Cheng, Zhiyong [3 ]
Li, Zhihui [2 ]
Zhang, Huaxiang [1 ]
机构
[1] Shandong Normal Univ, Sch Informat Sci & Engn, Jinan, Shandong, Peoples R China
[2] Univ New South Wales, Sch Comp Sci & Engn, Sydney, NSW, Australia
[3] Natl Univ Singapore, Sch Comp, Singapore, Singapore
基金
中国国家自然科学基金;
关键词
Multi-view feature extraction; Intrinsic sample relations; Dynamic graph learning; LOW-RANK; CLASSIFICATION; FRAMEWORK;
D O I
10.1016/j.jvcir.2018.09.019
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Graph-based multi-view feature extraction has attracted much attention in literature. However, conventional solutions generally rely on a manually defined affinity graph matrix, which is hard to capture the intrinsic sample relations in multiple views. In addition, the graph construction and feature extraction are separated into two independent processes which may result in sub-optimal results. Furthermore, the raw data may contain adverse noises that reduces the reliability of the affinity matrix. In this paper, we propose a novel Unsupervised Multi-view Feature Extraction with Dynamic Graph Learning (UMFE-DGL) to solve these limitations. We devise a unified learning framework which simultaneously performs dynamic graph learning and the feature extraction. Dynamic graph learning adaptively captures the intrinsic multiple view-specific relations of samples. Feature extraction learns the projection matrix that could accordingly preserve the dynamically adjusted sample relations modelled by graph into the low-dimensional features. Experimental results on several public datasets demonstrate the superior performance of the proposed approach, compared with state-of-the-art techniques. (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码:256 / 264
页数:9
相关论文
共 50 条
  • [1] Robust Unsupervised Multi-View Feature Learning With Dynamic Graph
    Li, Yikun
    Liu, Li
    Shi, Dan
    Cui, Hui
    Lu, Xu
    [J]. IEEE ACCESS, 2019, 7 : 72197 - 72209
  • [2] Joint Multi-View Unsupervised Feature Selection and Graph Learning
    Fang, Si-Guo
    Huang, Dong
    Wang, Chang-Dong
    Tang, Yong
    [J]. IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE, 2024, 8 (01): : 16 - 31
  • [3] Multi-View Graph Autoencoder for Unsupervised Graph Representation Learning
    Li, Jingci
    Lu, Guangquan
    Wu, Zhengtian
    [J]. Proceedings - International Conference on Pattern Recognition, 2022, 2022-August : 2213 - 2218
  • [4] Multi-View Graph Autoencoder for Unsupervised Graph Representation Learning
    Li, Jingci
    Lu, Guangquan
    Wu, Zhengtian
    [J]. 2022 26TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR), 2022, : 2213 - 2218
  • [5] Subgraph feature extraction based on multi-view dictionary learning for graph classification
    Zheng, Xin
    Liang, Shouzhi
    Liu, Bo
    Xiong, Xiaoming
    Hu, Xianghong
    Liu, Yuan
    [J]. KNOWLEDGE-BASED SYSTEMS, 2021, 214
  • [6] Multi-view unsupervised feature selection with consensus partition and diverse graph
    Cao, Zhiwen
    Xie, Xijiong
    Li, Yuqi
    [J]. INFORMATION SCIENCES, 2024, 661
  • [7] Low Redundancy Learning for Unsupervised Multi-view Feature Selection
    Jia, Hong
    Huang, Jian
    [J]. KNOWLEDGE SCIENCE, ENGINEERING AND MANAGEMENT, PT I, KSEM 2023, 2023, 14117 : 179 - 190
  • [8] Consensus learning guided multi-view unsupervised feature selection
    Tang, Chang
    Chen, Jiajia
    Liu, Xinwang
    Li, Miaomiao
    Wang, Pichao
    Wang, Minhui
    Lu, Peng
    [J]. KNOWLEDGE-BASED SYSTEMS, 2018, 160 : 49 - 60
  • [9] Unsupervised Multi-view Learning
    Huang, Ling
    [J]. PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 6442 - 6443
  • [10] Multi-level regularization-based unsupervised multi-view feature selection with adaptive graph learning
    Tingjian Chen
    Ying Zeng
    Haoliang Yuan
    Guo Zhong
    Loi Lei Lai
    Yuan Yan Tang
    [J]. International Journal of Machine Learning and Cybernetics, 2023, 14 : 1695 - 1709