Clustering Algorithms for Identifying Favourite Places
| dc.contributor.author | Pauseback, Jan | |
| dc.contributor.department | Chalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers) | sv |
| dc.contributor.department | Chalmers University of Technology / Department of Computer Science and Engineering (Chalmers) | en |
| dc.date.accessioned | 2019-07-03T13:46:05Z | |
| dc.date.available | 2019-07-03T13:46:05Z | |
| dc.date.issued | 2014 | |
| dc.description.abstract | Context: Vehicles are increasingly becoming connected devices that produce a lot of data -for example location data- which need to be processed and analysed. Cluster algorithms group objects in such a way that objects in the same cluster are more similar to each other than to those in other groups. They are essential for processing data and become especially useful when looking to identify important places from location data. Objectives: This thesis identifies and evaluates available approaches in the field of clustering algorithms for the place identification problem. Furthermore the algorithms OPTICS and DBSCAN are compared in terms of runtime performance and scalability. Methods: In the first part of the thesis a systematic literature review is used to identify and evaluate available clustering algorithms for the place finding problem. The second part of the thesis is an experiment that compares one of the found algorithms to an algorithm that is already in use at a research centre of a car manufacturer. Results: This thesis contributes in providing (1) an extensive list of clustering algorithms for identifying important places from location data, (2) an evaluation of the found algorithms and (3) a performance comparison of the algorithms OPTICS and DBSCAN. Conclusions: Most of the found approaches from the systematic literature review are density based and based on the algorithm DBSCAN. The algorithm OPTICS has the benefit of providing a hierarchical clustering structure as a result while working with the same density based approach as DBSCAN. The experiment in this thesis indicates that for geolocation data the difference in runtime performance between OPTICS and DBSCAN is considerably less than the previously reported difference. | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12380/220572 | |
| dc.language.iso | eng | |
| dc.setspec.uppsok | Technology | |
| dc.subject | Data- och informationsvetenskap | |
| dc.subject | Informations- och kommunikationsteknik | |
| dc.subject | Computer and Information Science | |
| dc.subject | Information & Communication Technology | |
| dc.title | Clustering Algorithms for Identifying Favourite Places | |
| dc.type.degree | Examensarbete för masterexamen | sv |
| dc.type.degree | Master Thesis | en |
| dc.type.uppsok | H | |
| local.programme | Software engineering and technology (MPSOF), MSc |