Exploiting Paths for Entity Search in RDF Graphs


Title Exploiting Paths for Entity Search in RDF Graphs
Minsuk Kahng, Sang-goo Lee
Year 2012 / 08
Keywords Entity Search, RDF Graphs, Object Retrieval, Semantic Search, Structured Data, Semantic Web
Acknowledgement SRC
Publication Type International Conference
Publication Proceeding of the 35th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2012), pp. 1027-1028
Link url doi


The field of entity search using Semantic Web (RDF) data has gained more interest recently. In this paper, we propose a probabilistic entity retrieval model for RDF graphs using paths in the graph. Unlike previous work which assumes that all descriptions of an entity are directly linked to the entity node, we assume that an entity can be described with any node that can be reached from the entity node by following paths in the RDF graph. Our retrieval model simulates the generation process of query terms from an entity node by traversing the graph. We evaluate our approach using a standard evaluation framework for entity search.