Collaborative and Discriminative Subspace Learning for unsupervised multi-view feature selection

被引:12
作者
Wu, Jian-Sheng [1 ]
Li, Yanlan [2 ]
Gong, Jun-Xiao [1 ]
Min, Weidong [1 ,3 ,4 ]
机构
[1] Nanchang Univ, Sch Math & Comp Sci, Nanchang 330031, Peoples R China
[2] Nanchang Univ, Sch Software, Nanchang 330047, Peoples R China
[3] Nanchang Univ, Inst Metaverse, Nanchang 330031, Peoples R China
[4] Jiangxi Key Lab Smart City, Nanchang 330031, Peoples R China
关键词
Multi-view learning; Unsupervised Feature Selection; Subspace learning; Correlation learning; ADAPTIVE SIMILARITY;
D O I
10.1016/j.engappai.2024.108145
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
By effectively exploiting the consistent information of multi -view data, multi -view feature selection seeks to select crucial features from multiple heterogeneous data views to improve the clustering and classification accuracy of multi -view data in pattern recognition, data mining, and machine learning. However, most unsupervised multi -view feature selection models investigate the consistent information based on the correlations between data, which may not be accurate enough to reveal data distribution because of the noisy features. Moreover, the consistent information could be insufficient to capture the full information of multi -view data because each individual view typically contains a portion of information of the data. To overcome these issues, we propose Collaborative and Discriminative Subspace Learning (CDSL) for unsupervised multi -view feature selection. Our model collaborates different views and encodes the full information of multi -view data into latent representations via robust collaborative subspace learning to exploit cross -view information of multi -view data, and discriminates the data features in different views via discriminative subspace learning to exploit the withinview information. Furthermore, it learns a collaborative graph for data by leveraging representations of data in both the collaborative subspace and the discriminative subspaces to investigate the underlying structure of multi -view data. Following that, an efficient algorithm is designed to solve the optimization problem. Extensive experiments on several benchmark datasets demonstrate the superiority of the proposed method over state-of-the-art approaches.
引用
收藏
页数:14
相关论文
共 49 条
[1]   GLEE: A granularity filter for feature selection [J].
Ba, Jing ;
Wang, Pingxin ;
Yang, Xibei ;
Yu, Hualong ;
Yu, Dongjun .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2023, 122
[2]   Consensus cluster structure guided multi-view unsupervised feature selection [J].
Cao, Zhiwen ;
Xie, Xijiong ;
Sun, Feixiang ;
Qian, Jiabei .
KNOWLEDGE-BASED SYSTEMS, 2023, 271
[3]  
Chen MS, 2020, AAAI CONF ARTIF INTE, V34, P3513
[4]  
Dong X, 2018, PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P2064
[5]   Unsupervised Feature Selection with Adaptive Structure Learning [J].
Du, Liang ;
Shen, Yi-Dong .
KDD'15: PROCEEDINGS OF THE 21ST ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2015, :209-218
[6]   Diagnosis of hepatocellular carcinoma using deep network with multi-view enhanced patterns mined in contrast-enhanced ultrasound data [J].
Feng, Xiangfei ;
Cai, Wenjia ;
Zheng, Rongqin ;
Tang, Lina ;
Zhou, Jianhua ;
Wang, Hui ;
Liao, Jintang ;
Luo, Baoming ;
Chengj, Wen ;
Wei, An ;
Zhao, Weian ;
Jing, Xiang ;
Liang, Ping ;
Yu, Jie ;
Huang, Qinghua .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2023, 118
[7]  
Feng Y., 2012, P 11 ASIAN C COMPUTE, P343
[8]   A hybrid feature selection scheme for high-dimensional data [J].
Ganjei, Mohammad Ahmadi ;
Boostani, Reza .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2022, 113
[9]  
Hou C., 2011, P 22 INT JOINT C ART, VTwo, P1324
[10]   Multi-View Unsupervised Feature Selection with Adaptive Similarity and View Weight [J].
Hou, Chenping ;
Nie, Feiping ;
Tao, Hong ;
Yi, Dongyun .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2017, 29 (09) :1998-2011