scholarly journals MOFSRank: A Multiobjective Evolutionary Algorithm for Feature Selection in Learning to Rank

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Fan Cheng ◽  
Wei Guo ◽  
Xingyi Zhang

Learning to rank has attracted increasing interest in the past decade, due to its wide applications in the areas like document retrieval and collaborative filtering. Feature selection for learning to rank is to select a small number of features from the original large set of features which can ensure a high ranking accuracy, since in many real ranking applications many features are redundant or even irrelevant. To this end, in this paper, a multiobjective evolutionary algorithm, termed MOFSRank, is proposed for feature selection in learning to rank which consists of three components. First, an instance selection strategy is suggested to choose the informative instances from the ranking training set, by which the redundant data is removed and the training efficiency is enhanced. Then on the selected instance subsets, a multiobjective feature selection algorithm with an adaptive mutation is developed, where good feature subsets are obtained by selecting the features with high ranking accuracy and low redundancy. Finally, an ensemble strategy is also designed in MOFSRank, which utilizes these obtained feature subsets to produce a set of better features. Experimental results on benchmark data sets confirm the advantage of the proposed method in comparison with the state-of-the-arts.

2021 ◽  
Vol 23 (06) ◽  
pp. 438-447
Author(s):  
Neha Sharma ◽  
Dr. RashiAgarwal ◽  
Dr. NarendraKohli ◽  
Dr. Shubha Jain

The past few years have seen the emergence of learning-to-rank (LTR) in the field of machine learning. In information acquiring the size of data is very large and empowering a learning-to-rank model on it will be a costly and time taking process. High dimension data leads to irrelevant and redundant data which results in overfitting. “Dimensionality reduction” methods are used to manage this issue. There are two-dimensionality reduction techniques namely feature selection and feature reduction. There is extensive research available on the algorithm for learning-to-rank but this not the case for dimensionality reduction approaches in LTR, despite its importance. Feature selection techniques for classification are directly used for ranking. To the best of our understanding, feature extraction techniques in the context of ranking problems are not explored much to date. So, we make an effort to fill this void and explore feature extraction in the context of LTR problems. The LifeRank algorithm is a linear feature extraction algorithm for ranking. Its performance is analyzed on RankSVM and Linear regression. It is not applied to other learning-to-rank algorithms. So, in this task, an attempt is made to study the effect of the application of the LifeRank algorithm on other LTR algorithms. LifeRank algorithm is applied on RankNet and RankBoost. Then, the performance of several LTR algorithms on the LETOR dataset is analyzed before and after feature extraction.


Sign in / Sign up

Export Citation Format

Share Document