Constrained feature weighting for semi-supervised learning

被引:0
作者
Chen, Xinyi [1 ]
Zhang, Li [1 ]
Zhao, Lei [1 ]
Zhang, Xiaofang [1 ]
机构
[1] Soochow Univ, Sch Comp Sci & Technol, Suzhou 215006, Jiangsu, Peoples R China
关键词
Semi-supervised learning; Feature selection; Feature weighting; Pairwise constraint; Hypothesis margin; FEATURE-SELECTION; TUMOR; SCORE; PREDICTION;
D O I
10.1007/s10489-024-05691-9
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Semi-supervised feature selection plays a crucial role in semi-supervised classification tasks by identifying the most informative and relevant features while discarding irrelevant or redundant features. Many semi-supervised feature selection approaches take advantage of pairwise constraints. However, these methods either encounter obstacles when attempting to automatically determine the appropriate number of features or cannot make full use of the given pairwise constraints. Thus, we propose a constrained feature weighting (CFW) approach for semi-supervised feature selection. CFW has two goals: maximizing the modified hypothesis margin related to cannot-link constraints and minimizing the must-link preserving regularization related to must-link constraints. The former makes the selected features strongly discriminative, and the latter makes similar samples with selected features more similar in the weighted feature space. In addition, L1-norm regularization is incorporated in the objective function of CFW to automatically determine the number of features. Extensive experiments are conducted on real-world datasets, and experimental results demonstrate the superior effectiveness of CFW compared to that of the existing popular supervised and semi-supervised feature selection methods.
引用
收藏
页码:9987 / 10006
页数:20
相关论文
共 39 条
  • [1] Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays
    Alon, U
    Barkai, N
    Notterman, DA
    Gish, K
    Ybarra, S
    Mack, D
    Levine, AJ
    [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1999, 96 (12) : 6745 - 6750
  • [2] Asuncion A., 2007, UCI MACHINE LEARNING
  • [3] Benabdeslem K, 2011, LECT NOTES ARTIF INT, V6911, P204, DOI 10.1007/978-3-642-23780-5_23
  • [4] Bouchlaghem Younes, 2022, E3S Web of Conferences, V351, DOI 10.1051/e3sconf/202235101046
  • [5] Robust dual-graph regularized and minimum redundancy based on self-representation for semi-supervised feature selection
    Chen, Hao
    Chen, Hongmei
    Li, Weiyi
    Li, Tianrui
    Luo, Chuan
    Wan, Jihong
    [J]. NEUROCOMPUTING, 2022, 490 : 104 - 123
  • [6] Predictive Ensemble Pruning by Expectation Propagation
    Chen, Huanhuan
    Tino, Peter
    Yao, Xin
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2009, 21 (07) : 999 - 1013
  • [7] Iterative constraint score based on hypothesis margin for semi-supervised feature selection
    Chen, Xinyi
    Zhang, Li
    Zhao, Lei
    [J]. KNOWLEDGE-BASED SYSTEMS, 2023, 271
  • [8] MULTIPLE COMPARISONS AMONG MEANS
    DUNN, OJ
    [J]. JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1961, 56 (293) : 52 - &
  • [10] Gross R, 2005, HANDBOOK OF FACE RECOGNITION, P301, DOI 10.1007/0-387-27257-7_14