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

Date

2020-10-22

Author

Altinok, Gulsah
Karagöz, Pınar
Batmaz, İnci

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

136
views

0
downloads

Learning to rank is 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 on point-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. © 2020 Wiley Periodicals LLC.

Subject Keywords

Artificial Intelligence, Computational Mathematics

URI

https://hdl.handle.net/11511/63114

Journal

Computational Intelligence

DOI

https://doi.org/10.1111/coin.12413

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

A Comparative Study on Learning to Rank with Computational Methods Batmaz, İnci; Karagöz, Pınar (2017-12-14) Learning to rank is a supervised learning problem that aims to construct a ranking model. The most common application of learning to rank is to rank a set of documents against a query. In this work, we focus on pointwise approach and compare the performances of four computational methods in developing ranking models using several criteria such as accuracy, stability and robustness. The experimental results show that Multivariate Adaptive Regression Splines (MARS) and Artificial Neural Networks (ANN) are eff...
AN EFFICIENT DATABASE TRANSITIVE CLOSURE ALGORITHM Toroslu, İsmail Hakkı; HENSCHEN, L (Springer Science and Business Media LLC, 1994-05-01) The integration of logic rules and relational databases has recently emerged as an important technique for developing knowledge management systems. An important class of logic rules utilized by these systems is the so-called transitive closure rules, the processing of which requires the computation of the transitive closure of database relations referenced by these rules. This article presents a new algorithm suitable for computing the transitive closure of very large database relations. This algorithm proc...
Learning to rank web data using multivariate adaptive regression splines Altınok, Gülşah; Batmaz, İnci; Karagöz, Pınar; Department of Statistics (2018) A new trend, called learning to rank, has recently come to light in a wide variety of applications in Information Retrieval (IR), Natural Language Processing (NLP), and Data Mining (DM), to utilize machine learning techniques to automatically build the ranking models. Typical applications are document retrieval, expert search, definition search, collaborative filtering, question answering, and machine translation. In IR, there are three approaches used for ranking. The one is traditional model approaches su...
Resampling approach for cluster model selection Volkovich, Z.; Barzily, Z.; Weber, Gerhard Wilhelm; Toledano-Kitai, D.; Avros, R. (Springer Science and Business Media LLC, 2011-10-01) In cluster analysis, selecting the number of clusters is an "ill-posed" problem of crucial importance. In this paper we propose a re-sampling method for assessing cluster stability. Our model suggests that samples' occurrences in clusters can be considered as realizations of the same random variable in the case of the "true" number of clusters. Thus, similarity between different cluster solutions is measured by means of compound and simple probability metrics. Compound criteria result in validation rules em...
Improving the k-nearest neighbour rule: using geometrical neighbourhoods and manifold-based metrics ALTINCAY, HAKAN (Wiley, 2011-09-01) Sample weighting and variations in neighbourhood or data-dependent distance metric definitions are three principal directions considered for improving the k-NN classification technique. Recently, manifold-based distance metrics attracted considerable interest and computationally less demanding approximations have been developed. However, a careful comparison of these alternative approaches is missing. In this study, an extensive comparison is firstly performed for three alternative neighbourhood definitions...

Citation Formats

G. Altinok, P. Karagöz, and İ. Batmaz, “Learning to rank by using multivariate adaptive regression splines and conic multivariate adaptive regression splines,” Computational Intelligence, 2020, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/63114.