Classify part of day and snow on the load of timber stacks: A comparative study between partitional clustering and competitive learning
2021 (English)Independent thesis Advanced level (professional degree), 20 credits / 30 HE credits
Student thesis
Abstract [en]
In today's society, companies are trying to find ways to utilize all the data they have, which considers valuable information and insights to make better decisions. This includes data used to keeping track of timber that flows between forest and industry. The growth of Artificial Intelligence (AI) and Machine Learning (ML) has enabled the development of ML modes to automate the measurements of timber on timber trucks, based on images. However, to improve the results there is a need to be able to get information from unlabeled images in order to decide weather and lighting conditions. The objective of this study is to perform an extensive for classifying unlabeled images in the categories, daylight, darkness, and snow on the load. A comparative study between partitional clustering and competitive learning is conducted to investigate which method gives the best results in terms of different clustering performance metrics. It also examines how dimensionality reduction affects the outcome. The algorithms K-means and Kohonen Self-Organizing Map (SOM) are selected for the clustering. Each model is investigated according to the number of clusters, size of dataset, clustering time, clustering performance, and manual samples from each cluster. The results indicate a noticeable clustering performance discrepancy between the algorithms concerning the number of clusters, dataset size, and manual samples. The use of dimensionality reduction led to shorter clustering time but slightly worse clustering performance. The evaluation results further show that the clustering time of Kohonen SOM is significantly higher than that of K-means.
Place, publisher, year, edition, pages
2021. , p. 72
Keywords [en]
Machine Learning (ML), Unsupervised Learning, Cluster Analysis, Partitional Clustering, Competitive Learning, Dimensionality Reduction, Principal Component Analysis (PCA), K-means, Kohonen Self-Organizing Map (SOM), Timber
National Category
Computer Engineering
Identifiers
URN: urn:nbn:se:miun:diva-42238Local ID: DT-V21-A2-008OAI: oai:DiVA.org:miun-42238DiVA, id: diva2:1566423
Subject / course
Computer Engineering DT1
Educational program
Master of Science in Engineering - Computer Engineering TDTEA 300 higher education credits
Supervisors
Examiners
2021-06-152021-06-152021-06-15Bibliographically approved