Essays about: "Nearest neighbour algorithm"

Showing result 1 - 5 of 37 essays containing the words Nearest neighbour algorithm.

  1. 1. Detecting Metro Service Disruptions and Predicting their Spillover Effects throughout the Network using GTFS and Large-Scale Vehicle Location Data

    University essay from KTH/Transportplanering

    Author : WeiZhi Michelle Teo; [2023]
    Keywords : ;

    Abstract : One of the top factors that influence commuters’ satisfaction level with public transport is the punctuality of the service. Commuters rely on public transport to get them from their origin to destination on time and any form of delay will incur additional cost to both the commuters as well as the public transport operators. READ MORE

  3. 2. Evaluating Random Forest and k-Nearest Neighbour Algorithms on Real-Life Data Sets

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Atheer Salim; Milad Farahani; [2023]
    Keywords : Random Forest; k-Nearest Neighbour; Evaluation; Machine Learning; Classification; Execution Time; Slumpmässig Skog; k-Närmaste Granne; Utvärdering; Maskininlärning; Klassificiering; Exekveringstid;

    Abstract : Computers can be used to classify various types of data, for example to filter email messages, detect computer viruses, detect diseases, etc. This thesis explores two classification algorithms, random forest and k-nearest neighbour, to understand how accurately and how quickly they classify data. READ MORE

  4. 3. Identifying the beginning of a kayak race using velocity signal data

    University essay from Linnéuniversitetet/Institutionen för datavetenskap och medieteknik (DM)

    Author : Indre Kvedaraite; [2023]
    Keywords : kayak race; velocity signal; machine learning; support vector machine; k nearest neighbours; random forest;

    Abstract : A kayak is a small watercraft that moves over the water. The kayak is propelled by a person sitting inside of the hull and paddling using a double-bladed paddle. While kayaking can be casual, it is used as a competitive sport in races and even the Olympic games. READ MORE

  5. 4. Machine Learning Algorithms to Predict Cost Account Codes in an ERP System : An Exploratory Case Study

    University essay from Luleå tekniska universitet/Institutionen för system- och rymdteknik

    Author : Alexander Wirdemo; [2023]
    Keywords : Artificial Intelligence; Machine Learning; ERP; invoice automation; RPA; Random forest; Naïve Bayes; k-Nearest Neighbor; Artificiell Intelligens; maskinlärning; ERP; fakturaautomation; RPA; Random forest; Naïve Bayes; k-Nearest Neighbor;

    Abstract : This study aimed to investigate how Machine Learning (ML) algorithms can be used to predict the cost account code to be used when handling invoices in an Enterprise Resource Planning (ERP) system commonly found in the Swedish public sector. This implied testing which one of the tested algorithms that performs the best and what criteria that need to be met in order to perform the best. READ MORE

  6. 5. Optimization and Bayesian Modeling of Road Distance for Inventory of Potholes in Gävle Municipality

    University essay from Stockholms universitet/Statistiska institutionen

    Author : Timothy Rafael Lindblom; Oskar Tollin; [2022]
    Keywords : Traveling salesman problem; Bayesian inference; Simulated annealing; Nearest neighbour algorithm; Markov Chain Monte Carlo; MCMC; Potholes; Haversine formula; Metropolis-Hastings; Posterior predictive distribution; Handelsresande problemet; bayesiansk inferens; simulerad anlöpning; nearest neighbour algorithm; Markov Chain Monte Carlo; MCMC; potthål; storcirkelavstånd; Metropolis-Hastings; posterior predictive distribution;

    Abstract : Time management and distance evaluation have long been a difficult task for workers and companies. This thesis studies 6712 pothole coordinates in Gävle municipality, and evaluates the minimal total road distance needed to visit each pothole once, and return to an initial pothole. READ MORE