Sökning: "heuristics algorithm"

Visar resultat 1 - 5 av 89 uppsatser innehållade orden heuristics algorithm.

1. 1. Comparison of VADER and Pre-Trained RoBERTa: A Sentiment Analysis Application

   Kandidat-uppsats, Lunds universitet/Statistiska institutionen

   Författare :Linda Erwe; Xin Wang; [2024]
   Nyckelord :sentiment analysis; natural language processing; BERT; VADER; sustainability report; Mathematics and Statistics;

   Sammanfattning : Purpose: The purpose of this study is to examine how the overall sentiment results from VADER and a pre-trained RoBERTa model differ. The study investigates potential differences in terms of the median and shape of the two distributions. Data: The sustainability reports of 50 independent random companies are selected as the sample. LÄS MER

3. 2. Domain Knowledge and Representation Learning for Centroid Initialization in Text Clustering with k-Means : An exploratory study

   Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Författare :David Yu; [2023]
   Nyckelord :Natural language processing; Sentiment analysis; Clustering; Language model; Transformer; Heuristic; Språkteknologi; Sentimentanalys; Klustering; Språkmodell; Transformer; Heuristik;

   Sammanfattning : Text clustering is a problem where texts are partitioned into homogeneous clusters, such as partitioning them based on their sentiment value. Two techniques to address the problem are representation learning, in particular language representation models, and clustering algorithms. LÄS MER

4. 3. Unsupervised Clustering of Behavior Data From a Parking Application : A Heuristic and Deep Learning Approach

   Uppsats för yrkesexamina på avancerad nivå, Umeå universitet/Institutionen för matematik och matematisk statistik

   Författare :Edvard Magnell; Joakim Nordling; [2023]
   Nyckelord :ML; Machine learning; clustering; unsupervised learning; deep learning; autoencoder; AI; artificial intelligence;

   Sammanfattning : This report aims to present a project in the field of unsupervised clustering on human behavior in a parking application. With increasing opportunities to collect and store data, the demands to utilize the data in meaningful ways also increase. LÄS MER

5. 4. Simultaneous scheduling of railway maintenance and trains : Modelling and solving train interactions close to a maintenance operation

   Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Författare :Pauline Vaillant; [2023]
   Nyckelord :Optimization; Linear programming; Heuristics; Railway scheduling; Maintenance planning; Optimering; Linjärprogrammering; Heuristik; Järnvägsplanering; Underhållsplanering;

   Sammanfattning : Rail transport plays a key role in the mobility of passengers and goods. It is expected to grow the decarbonization of society. In that context, it is important to use the railway network efficiently, and jointly planning trains and network maintenance allows for better use of resources. LÄS MER

7. 5. An Evaluation of GeneticAlgorithm Approaches for theUnit Commitment Problem inPower Generation Scheduling

   Master-uppsats, Uppsala universitet/Institutionen för informationsteknologi

   Författare :Nandini Mattathil Suresh; [2023]
   Nyckelord :Unit Commitment Problem; Genetic Algorithm; Meta-heuristics; Economic Dispatch; Constrained Optimization; Encoding; Crossover; Mutation; Selection;

   Sammanfattning : The Unit Commitment Problem (UCP) poses a significant challenge in optimizing powergeneration schedules within complex and dynamic energy systems. This study explores theapplication of Genetic Algorithms (GAs) as a promising approach to address UCP, their ability tonavigate complex solution spaces and adapt to changing operational conditions. LÄS MER