Feature Selection for Ranking using Heuristics based Learning to Rank using Machine Learning

IF 0.3
Sushilkumar Chavhan, Dr. R. C. Dharmik
{"title":"Feature Selection for Ranking using Heuristics based Learning to Rank using Machine Learning","authors":"Sushilkumar Chavhan, Dr. R. C. Dharmik","doi":"10.47164/ijngc.v13i5.958","DOIUrl":null,"url":null,"abstract":"Machine Learning based ranking is done every filed. Ranking is also solved by using (LTR i. e. learning to Rank)techniques. In this work, we propose a Heuristics LTR based models for information retrieval. Different newalgorithms are tackling the problem feature selection in ranking. In this proposed model try to makes use of thesimulated annealing and Principal Component analysis for document retrieval using learning to rank. A use ofsimulated annealing heuristics method used for the feature Selection to test the results improvement. The featureextraction technique helps to find the minimal subsets of features for better results. The core idea of the proposedframework is to make use of k-fold cross validation of training queries in the SA as well as the training queriesin the any feature selection method to extract features and only using training quires make use of validationand test quires to create a learning model with LTR. The standard evaluation measures are used to verify thesignificant improvement in the proposed model. Performance of proposed model are measured based on predictionon some selected benchmark datasets, Improvement in the results are compare on recent high performed pairwisealgorithms.","PeriodicalId":42021,"journal":{"name":"International Journal of Next-Generation Computing","volume":"22 1","pages":""},"PeriodicalIF":0.3000,"publicationDate":"2022-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Next-Generation Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47164/ijngc.v13i5.958","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Machine Learning based ranking is done every filed. Ranking is also solved by using (LTR i. e. learning to Rank)techniques. In this work, we propose a Heuristics LTR based models for information retrieval. Different newalgorithms are tackling the problem feature selection in ranking. In this proposed model try to makes use of thesimulated annealing and Principal Component analysis for document retrieval using learning to rank. A use ofsimulated annealing heuristics method used for the feature Selection to test the results improvement. The featureextraction technique helps to find the minimal subsets of features for better results. The core idea of the proposedframework is to make use of k-fold cross validation of training queries in the SA as well as the training queriesin the any feature selection method to extract features and only using training quires make use of validationand test quires to create a learning model with LTR. The standard evaluation measures are used to verify thesignificant improvement in the proposed model. Performance of proposed model are measured based on predictionon some selected benchmark datasets, Improvement in the results are compare on recent high performed pairwisealgorithms.
使用启发式学习进行排序的特征选择使用机器学习进行排序
基于机器学习的排名是在每个领域进行的。排名也是通过使用(LTR,即学习排名)技术来解决的。在这项工作中,我们提出了一种基于启发式LTR的信息检索模型。不同的新算法正在解决排序中的特征选择问题。在这个模型中,我们尝试利用模拟退火和主成分分析来学习排序。采用模拟退火启发式方法对特征选择进行改进,以测试结果。特征提取技术有助于找到最小的特征子集以获得更好的结果。所提出的框架的核心思想是利用SA中的训练查询的k-fold交叉验证以及任意特征选择方法中的训练查询来提取特征,并且仅使用训练请求使用验证和测试请求来创建具有LTR的学习模型,并使用标准评估度量来验证所提出模型的显着改进。通过对一些选定的基准数据集的预测,对所提模型的性能进行了测试,并比较了近年来高性能配对算法的改进结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Next-Generation Computing
International Journal of Next-Generation Computing COMPUTER SCIENCE, THEORY & METHODS-
自引率
66.70%
发文量
60
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信