Sökning: "Learning to rank"

Visar resultat 1 - 5 av 80 uppsatser innehållade orden Learning to rank.

  1. 1. Feature Selection for Microarray Data via Stochastic Approximation

    Master-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknik

    Författare :Erik Rosvall; [2024-03-18]
    Nyckelord :feature selection; feature ranking; microarray data; stochastic approximation; Barzilai and Borwein method; Machine Learning; AI;

    Sammanfattning : 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. LÄS MER

  3. 2. Transforming Chess: Investigating Decoder-Only Architecture for Generating Realistic Game-Like Positions

    Master-uppsats, Umeå universitet/Institutionen för datavetenskap

    Författare :William Pettersson; [2024]
    Nyckelord :Transformer; Decoder; Decoder-only; AI; Artificial intelligence; Generating; generative model; Chess;

    Sammanfattning : 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. LÄS MER

  4. 3. Despeckling Echocardiograms Using Generative Adversarial Networks

    Master-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknik

    Författare :Falk DIppel; [2023-10-23]
    Nyckelord :Generative adversarial network; deep learning; echocardiography; speckle noise; denoising; segmentation;

    Sammanfattning : 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. LÄS MER

  5. 4. Generating an Interpretable Ranking Model: Exploring the Power of Local Model-Agnostic Interpretability for Ranking Analysis

    Magister-uppsats, Stockholms universitet/Institutionen för data- och systemvetenskap

    Författare :Laura Galera Alfaro; [2023]
    Nyckelord :Explainable Artificial Intelligence; Learning To Rank; Local ModelAgnostic Interpretability; Ranking Generalized Additive Models;

    Sammanfattning : 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. LÄS MER

  7. 5. Randomized Diagonal Estimation

    Master-uppsats, KTH/Matematik (Avd.)

    Författare :Niclas Joshua Popp; [2023]
    Nyckelord :Diagonal estimation; randomized numerical linear algebra; low-rank approximation; matrix functions; Diagonalestimering; randomiserad numerisk linjär algebra; lågrankad approximation; matrisfunktioner;

    Sammanfattning : 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. LÄS MER