Dual-level feature assessment for unsupervised multi-view feature selection with latent space learning

被引:6
作者
Wu, Jian-Sheng [1 ]
Gong, Jun-Xiao [1 ]
Liu, Jing-Xin [1 ]
Huang, Wei [1 ]
Zheng, Wei-Shi [2 ]
机构
[1] Nanchang Univ, Sch Math & Comp Sci, Nanchang 330031, Peoples R China
[2] Sun Yat Sen Univ, Sch Comp Sci & Engn, Guangzhou 510006, Peoples R China
基金
中国国家自然科学基金;
关键词
Multi-view learning; Unsupervised feature selection; Dual-level feature assessment; Latent space learning; Local structure learning; MATRIX FACTORIZATION; ADAPTIVE SIMILARITY; GRAPH; CONSENSUS;
D O I
10.1016/j.ins.2024.120604
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Recently, numerous unsupervised multi -view feature selection methods have been presented. However, these methods assess the significance of data features in each view individually or jointly evaluate the significance of data features across multiple views by concatenating data features from all data views. So, they disregard either inter -view or intra-view feature connections of data. Moreover, they ignore the complementary information from multiple insufficient views, each of which only captures partial information of multi -view data and is insufficient to characterize data distribution. To address these problems, this paper proposes a model named Dual -level Feature Assessment for Unsupervised Multi -view Feature Selection with Latent Space Learning (DFA-LSL). It first investigates the underlying complementary information from multiple views in a latent space while simultaneously learning latent representations for data. Compared with the original data representations, the latent representations contain the entire information of multi -view data. Then, it explores connections and distinguishing ability of features at two levels, namely the inter -view and intra-view levels, by jointly assessing the significance of features in the latent space and individually assessing the significance of features in each view concurrently. Following that, an effective optimization algorithm is presented. Extensive experiments demonstrate that the proposed work surpasses several state-of-the-art models.
引用
收藏
页数:17
相关论文
共 47 条
[1]   Multi-view feature selection via Nonnegative Structured Graph Learning [J].
Bai, Xiangpin ;
Zhu, Lei ;
Liang, Cheng ;
Li, Jingjing ;
Nie, Xiushan ;
Chang, Xiaojun .
NEUROCOMPUTING, 2020, 387 :110-122
[2]  
Dong X, 2018, PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P2064
[3]  
Du L, 2019, INT CONF DAT MIN WOR, P615, DOI 10.1109/ICDMW.2019.00093
[4]  
Feng Y., 2012, P 11 ASIAN C COMPUTE, P343
[5]   BioSTD: A New Tensor Multi-View Framework via Combining Tensor Decomposition and Strong Complementarity Constraint for Analyzing Cancer Omics Data [J].
Gao, Ying-Lian ;
Qiao, Qian ;
Wang, Juan ;
Yuan, Sha-Sha ;
Liu, Jin-Xing .
IEEE JOURNAL OF BIOMEDICAL AND HEALTH INFORMATICS, 2023, 27 (10) :5187-5198
[6]   Fast Alternating Direction Optimization Methods [J].
Goldstein, Tom ;
O'Donoghue, Brendan ;
Setzer, Simon ;
Baraniuk, Richard .
SIAM JOURNAL ON IMAGING SCIENCES, 2014, 7 (03) :1588-1623
[7]  
Gretton A, 2005, LECT NOTES ARTIF INT, V3734, P63
[8]   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
[9]   Adaptive Structural Co-regularization for Unsupervised Multi-view Feature Selection [J].
Hsieh, Tsung-Yu ;
Sun, Yiwei ;
Wang, Suhang ;
Honavar, Vasant .
2019 10TH IEEE INTERNATIONAL CONFERENCE ON BIG KNOWLEDGE (ICBK 2019), 2019, :87-96
[10]   Multi-view intact space clustering [J].
Huang, Ling ;
Chao, Hong-Yang ;
Wang, Chang-Dong .
PATTERN RECOGNITION, 2019, 86 :344-353