Node search - a graph approach to navigating linked data

Frederik Bo Albeck

AbstractFinding information on the web is easy thanks to search engines. However there is a growing realisation that new methodology is needed in terms of combining information from different sources (semantic web) and navigation of relational data. Web data usually comes with linked information either as hyper-links or from links that can be inferred from data. In this project we aim to explore navigation of web data by means of graphs. We take Wikipedia as an example because it is an authoritative source with a well-defined link structure (internal hyper-links or DBpedia). The concepts, if successful, can straightforwardly be applied to other types of media such as new paper, dating and media sites. Although these examples come with the added challenge of inferring good link structure, we need to build algorithms to determine what is similar to build the graph. But that will not be part of this project.
TypeMaster's thesis [Academic thesis]
Year2014
PublisherTechnical University of Denmark, Department of Applied Mathematics and Computer Science
AddressRichard Petersens Plads, Building 324, DK-2800 Kgs. Lyngby, Denmark, compute@compute.dtu.dk
SeriesDTU Compute M.Sc.-2014
NoteDTU supervisor: Ole Winther, olwi@dtu.dk, DTU Compute
Electronic version(s)[pdf]
Publication linkhttp://www.compute.dtu.dk/English.aspx
BibTeX data [bibtex]
IMM Group(s)Intelligent Signal Processing


Back  ::  IMM Publications