An Analysis of Hierarchical Clustering Algorithms for Hotspot Detection in Geographical Request Maps
Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
The purpose of this thesis was to investigate the suitability of using different hierarchical clustering algorithms for locating hotspots of HTTP-requests in geographical maps. To do so, four different maps were modeled with pre-set hotspots. Nine algorithms were evaluated with a cost value to how well they could approximate the locations of the hotspots. Four of the algorithms were found to perform better than the other ones overall. Although the results does show potential in using hierarchical clustering algorithms, the low number of models makes it hard to determine the possibility for arbitrary maps of HTTP-requests.
Place, publisher, year, edition, pages
2015. , 22 p.
IdentifiersURN: urn:nbn:se:kth:diva-166420OAI: oai:DiVA.org:kth-166420DiVA: diva2:810990
Subject / course
Master of Science in Engineering - Computer Science and Technology