The advances of the Linked Open Data LOD initiative are giving rise to a more structured Web of data. Indeed, a few datasets act as hubs e.g., DBpedia connecting many other datasets. They also made possible new Web services for entity detection inside plain text e.g.,i¾?DBpedia Spotlight, thus allowing for new applications that can benefit from a combination of the Web of documents and the Web of data. To ease the emergence of these new applications, we propose a query-biased algorithm LDRANK for the ranking of web of data resources with associated textual data. Our algorithm combines link analysis with dimensionality reduction. We use crowdsourcing for building a publicly available and reusable dataset for the evaluation of query-biased ranking of Web of data resources detected in Web pages. We show that, on this dataset, LDRANK outperforms the state of the art. Finally, we use this algorithm for the construction of semantic snippets of which we evaluate the usefulness with a crowdsourcing-based approach.
@cite_17: Recently, there has been interest in ranking the resources and generating corresponding expressive descriptions from the Semantic Web. This paper proposes an approach for automatically generating snippets from RDF documents and assisting users in better understanding the content of RDF documents returned by Semantic Web search engines. A heuristic method for discovering topics, based on the occurrences of RDF nodes and the URIs of original RDF documents, is presented and experimented in this paper. In order to make the snippets more understandable, two strategies are proposed and used for ranking the topic-related statements and the query-related statements respectively. Finally, the conclusion is drawn based on the discussion about the performances of our topic discovery and the whole snippet generation approaches on a test dataset provided by Sindice.
@cite_17 , the authors first assign a topic to the RDF document (they use a property such as p:primaryTopic if it exists, otherwise they rely on a heuristic based on the comparison of the URI of the candidates topic-nodes with the text of the URL of the RDF document). Next they design a ranking algorithm for RDF statements. Particularly, they introduce the notions of correlative (e.g. foaf:surname and foaf:family ) and exclusive (e.g. foaf:name and foaf:surname ) properties. Finally, they use this ranking algorithm to give the user a set of relationships between the query-related statements and the topic-related statements.