Fast shortest-path kernel computations using aproximate methods

Examensarbete för masterexamen

Please use this identifier to cite or link to this item:
Download file(s):
File Description SizeFormat 
215958.pdfFulltext889.74 kBAdobe PDFView/Open
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKilhamn, Jonatan
dc.contributor.departmentChalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)sv
dc.contributor.departmentChalmers University of Technology / Department of Computer Science and Engineering (Chalmers)en
dc.description.abstractThe shortest-path kernel is frequently seen in the context of graph classification, which shows up in various subjects, for example bioinformatics. However, it is not efficient enough to be applicable in practice if the graphs are too large. The purpose of this thesis is to explore the possibilities of computing the shortest-path kernel approximately, taking shorter time at the cost of a limited error. This thesis proves a theoretical error bound for a class of kernel function approximations, applicable to the shortest-path kernel but further generaliseable as well. We also present two specific approximations of the shortest-path kernel. Firstly, we define an approximate kernel based on the idea of sampling node pairs in a graph to approximate its shortest-path length distribution. Secondly, we define a kernel computing approximate shortest-path lengths in a graph using its graph Voronoi dual. We provide algorithms to compute both of these, and prove that their runtime complexities are better than the shortest-path kernel they approximate. Finally, we evaluate these kernel approximations empirically, comparing them to the full shortest-path kernel as well as other reference kernels.
dc.subjectData- och informationsvetenskap
dc.subjectComputer and Information Science
dc.titleFast shortest-path kernel computations using aproximate methods
dc.type.degreeExamensarbete för masterexamensv
dc.type.degreeMaster Thesisen
Collection:Examensarbeten för masterexamen // Master Theses

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