A decomposition-based multi-objective immune algorithm for feature selection in learning to rank
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 decomposit...
Gespeichert in:
Veröffentlicht in: | Knowledge-based systems 2021-12, Vol.234, p.107577, Article 107577 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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/D-FSRank, 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. |
---|---|
ISSN: | 0950-7051 1872-7409 |
DOI: | 10.1016/j.knosys.2021.107577 |