Pattern Recognition of RBS Configuration Topologies in Radio Access Networks

Examensarbete för masterexamen

Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.12380/251547
Download file(s):
File Description SizeFormat 
251547.pdfFulltext969.28 kBAdobe PDFView/Open
Type: Examensarbete för masterexamen
Master Thesis
Title: Pattern Recognition of RBS Configuration Topologies in Radio Access Networks
Authors: Rånge, Ellinor
Linder, Joacim
Abstract: This thesis explores how graph-based representations for cluster evaluation may be applied on configuration topologies of radio base stations. It presents experiments performed using aWeisfeiler-Lehman subtree kernel and a graph embedding method based on graph edit distance computations. These techniques are compared to the performance of simpler baseline methods. Experiments are performed on a data set which have been categorised at two levels of detail by RBS configuration experts at Ericsson, and evaluation is performed using both intrinsic and extrinsic metrics. The Weisfeiler-Lehman subtree kernel shows promising results and has a reasonable runtime when executed on the provided data set. The graph embedding technique, on the other hand, gives less promising results even when compared to the baseline methods.
Keywords: Data- och informationsvetenskap;Computer and Information Science
Issue Date: 2017
Publisher: Chalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)
Chalmers University of Technology / Department of Computer Science and Engineering (Chalmers)
URI: https://hdl.handle.net/20.500.12380/251547
Collection:Examensarbeten för masterexamen // Master Theses



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.