4.4 Article

Learning to rank by using multivariate adaptive regression splines and conic multivariate adaptive regression splines

期刊

COMPUTATIONAL INTELLIGENCE
卷 37, 期 1, 页码 371-408

出版社

WILEY
DOI: 10.1111/coin.12413

关键词

artificial neural networks; conic multivariate adaptive regression splines; multivariate adaptive regression spline; random forest; support vector machines; web search query

向作者/读者索取更多资源

Learning to rank is a supervised learning problem that aims to construct a ranking model for a given dataset, with MARS and CMARS being effective techniques for point-wise learning to rank. Experimental results show that MARS and ANN are effective methods for learning to rank problem and provide promising results.
Learning to rankis a supervised learning problem that aims to construct a ranking model for the given data. The most common application of learning to rank is to rank a set of documents against a query. In this work, we focus onpoint-wise learning to rank, where the model learns the ranking values. Multivariate adaptive regression splines (MARS) and conic multivariate adaptive regression splines (CMARS) are supervised learning techniques that have been proven to provide successful results on various prediction problems. In this article, we investigate the effectiveness of MARS and CMARS for point-wise learning to rank problem. The prediction performance is analyzed in comparison to three well-known supervised learning methods, artificial neural network (ANN), support vector machine, and random forest for two datasets under a variety of metrics including accuracy, stability, and robustness. The experimental results show that MARS and ANN are effective methods for learning to rank problem and provide promising results.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.4
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据