Essays about: "k-Närmaste Granne"

Found 5 essays containing the words k-Närmaste Granne.

  1. 1. 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

  2. 2. Topologica linteractions in a multi-layered flocking system

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

    Author : Malin Liedholm; [2023]
    Keywords : Flock simulation; Topological interaction; Multi-layered flocking system; knearest neighbour; Boids; Unity3D; Flocksimulering; Topologisk interaktion; Flerskiktigt flockningssystem; knärmaste granne; Boids; Unity3D;

    Abstract : With the multi-layered flocking system it is possible to simulate flocks that contain different types of agents that can be of various different sizes (variations in bounding radius and height). In the original implementation, the multi-layered flocking system uses a metric distance to find the nearest-neighbours of agents. READ MORE

  3. 3. Wind Turbine Performance Assessment Modeling Using Machine Learning Method for Condition Based Maintenance

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

    Author : Qiuyi Huang; [2018]
    Keywords : ;

    Abstract : This thesis work proposes a performance assessment framework to estimateoperation states of wind turbines for the sake of condition monitoring. Theframework uses the data in the supervisory control and data acquisition systemsas original input and some machine learning methods including K-NearestNeighbour, K-Means Clustering, Support Vector Machine and Artificial NeuralNetwork are implemented to analyze the data. READ MORE

  4. 4. Clustering and forecasting for rain attenuation time series data

    University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Author : Jing Li; [2017]
    Keywords : Clustering; Time series Forecasting; Rain attenuation; Machine learning; Unsupervised learning; ; klustring; Tidsserieprognoser; Regn dämpning; Maskininlärning; Unservervised learning; ;

    Abstract : Clustering is one of unsupervised learning algorithm to group similar objects into the same cluster and the objects in the same cluster are more similar to each other than those in the other clusters. Forecasting is making prediction based on the past data and efficient artificial intelligence models to predict data developing tendency, which can help to make appropriate decisions ahead. READ MORE

  5. 5. Stock market prediction using the K NearestNeighbours algorithm and a comparison withthe moving average formula

    University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

    Author : Ida Vainionpää; Sophie Davidsson; [2014]
    Keywords : ;

    Abstract : The stock market has a large impact on the economy of a nation, thisis why it is an interesting matter to see how stock market prediction canbe used and whether or not the predicted results are valid. This reportwill compare the prediction methods, the K Nearest Neighbour algorithmand the moving average formula using the closing prices of four Swedishequities that are based on the Stockholm stock exchange OMX. READ MORE