Essays about: "Learning To Rank"
Showing result 1 - 5 of 72 essays containing the words Learning To Rank.
-
1. Feature Selection for Microarray Data via Stochastic Approximation
University essay from Göteborgs universitet/Institutionen för data- och informationsteknikAbstract : This thesis explores the challenge of feature selection (FS) in machine learning, which involves reducing the dimensionality of data. The selection of a relevant subset of features from a larger pool has demonstrated its effectiveness in enhancing the performance of various machine learning algorithms. READ MORE
-
2. Transforming Chess: Investigating Decoder-Only Architecture for Generating Realistic Game-Like Positions
University essay from Umeå universitet/Institutionen för datavetenskapAbstract : Chess is a deep and intricate game, the master of which depends on learning tens of thousands of the patterns that may occur on the board. At Noctie, their mission is to aid this learning process through humanlike chess AI. A prominent challenge lies in curating instructive chess positions for students. READ MORE
-
3. Despeckling Echocardiograms Using Generative Adversarial Networks
University essay from Göteborgs universitet/Institutionen för data- och informationsteknikAbstract : Previous research had shown that generative adversarial networks (GANs) are capable of despeckling echocardiograms (echos) through image-to-image translation in real-time once trained. However, only limited information regarding the quality of denoised echos and explainability of useful GAN components is provided. READ MORE
-
4. Generating an Interpretable Ranking Model: Exploring the Power of Local Model-Agnostic Interpretability for Ranking Analysis
University essay from Stockholms universitet/Institutionen för data- och systemvetenskapAbstract : Machine learning has revolutionized recommendation systems by employing ranking models for personalized item suggestions. However, the complexity of learning-to-rank (LTR) models poses challenges in understanding the underlying reasons contributing to the ranking outcomes. READ MORE
-
5. Randomized Diagonal Estimation
University essay from KTH/Matematik (Avd.)Abstract : Implicit diagonal estimation is a long-standing problem that is concerned with approximating the diagonal of a matrix that can only be accessed through matrix-vector products. It is of interest in various fields of application, such as network science, material science and machine learning. READ MORE