A decomposition-based multi-objective immune algorithm for feature selection in learning to rank

被引:15
作者
Li, Wangwang [1 ]
Chai, Zhengyi [1 ,2 ,3 ]
Tang, Zengjie [1 ]
机构
[1] Tiangong Univ, Sch Comp Sci & Technol, Tianjin 300387, Peoples R China
[2] Tianjin Key Lab Autonomous Intelligence Technol &, Tianjin 300387, Peoples R China
[3] Minist Educ, Key Lab Universal Wireless Commun BUPT, Tianjin, Peoples R China
基金
中国国家自然科学基金;
关键词
Learning-to-rank; Multi-objective optimization; Immune algorithm; Decomposition; Large-scale data; OPTIMIZATION;
D O I
10.1016/j.knosys.2021.107577
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Learning-to-rank (L2R) based on feature selection has been proved effectively. However, feature selection problem is more challenging due to two conflicting objectives, namely, maximizing classification performance and minimizing the number of features. Therefore, in this article, a novel decomposition-based multi-objective immune algorithm for feature selection in L2R, called MOIA/DFSRank, is proposed. The proposed algorithm associates each solution with a scalar subproblem based on Tchebycheff decomposition approach, which makes the optimization process more efficient. In addition, we propose an Elite Selection Strategy (ESS) in initialization phase, which can significantly improve the diversity and convergence of the initial population. Moreover, the proposed algorithm uses two effective operators, a clonal selection operator and a mutation operator, where the clonal selection operator is to generate clone population to better guide the search direction of the evolution and the mutation operator aims to retain excellent features with a higher probability in evolution. In this paper, the pairwise method with O(n2) size is used to train the ranking model, and extensive experiments are conducted on the four public LETOR benchmark data sets. The experimental results demonstrate that the proposed algorithm can obtain significant performances on the ranking accuracy and the number of features. (c) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页数:11
相关论文
共 45 条
  • [1] Intelligent workflow scheduling for Big Data applications in IoT cloud computing environments
    Abualigah, Laith
    Diabat, Ali
    Abd Elaziz, Mohamed
    [J]. CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2021, 24 (04): : 2957 - 2976
  • [2] Aquila Optimizer: A novel meta-heuristic optimization algorithm
    Abualigah, Laith
    Yousri, Dalia
    Abd Elaziz, Mohamed
    Ewees, Ahmed A.
    Al-qaness, Mohammed A. A.
    Gandomi, Amir H.
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 157 (157)
  • [3] The Arithmetic Optimization Algorithm
    Abualigah, Laith
    Diabat, Ali
    Mirjalili, Seyedali
    Elaziz, Mohamed Abd
    Gandomi, Amir H.
    [J]. COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2021, 376
  • [4] Approaches to Multi-Objective Feature Selection: A Systematic Literature Review
    Al-Tashi, Qasem
    Abdulkadir, Said Jadid
    Rais, Helmi Md
    Mirjalili, Seyedali
    Alhussian, Hitham
    [J]. IEEE ACCESS, 2020, 8 : 125076 - 125096
  • [5] Fast wrapper feature subset selection in high-dimensional datasets by means of filter re-ranking
    Bermejo, Pablo
    de la Ossa, Luis
    Gamez, Jose A.
    Puerta, Jose M.
    [J]. KNOWLEDGE-BASED SYSTEMS, 2012, 25 (01) : 35 - 44
  • [6] Cao Zhe, 2007, P INT C MACH LEARN I, DOI DOI 10.1145/1273496.1273513
  • [7] Efficient algorithms for ranking with SVMs
    Chapelle, O.
    Keerthi, S. S.
    [J]. INFORMATION RETRIEVAL, 2010, 13 (03): : 201 - 215
  • [8] Chaudhuri Sougata, 2017, Machine Learning and Data Mining in Pattern Recognition. 13th International Conference, MLDM 2017. Proceedings: LNAI 10358, P32, DOI 10.1007/978-3-319-62416-7_3
  • [9] MOFSRank: A Multiobjective Evolutionary Algorithm for Feature Selection in Learning to Rank
    Cheng, Fan
    Guo, Wei
    Zhang, Xingyi
    [J]. COMPLEXITY, 2018,
  • [10] Coello CAC, 2002, IEEE C EVOL COMPUTAT, P1051, DOI 10.1109/CEC.2002.1004388