• Aucun résultat trouvé

Linked data based exploratory search

N/A
N/A
Protected

Academic year: 2021

Partager "Linked data based exploratory search"

Copied!
295
0
0

Texte intégral

Loading

Figure

Figure 2.2: Taxonomy of search tasks proposed by Gary Marchionini in [120]
Figure 2.4: An example of lookup query that retrieves the birthday of Claude Monet using Bing
Figure 2.5: Interactions between the users’ information need precision and the ex- ex-ecuted exploratory search activities, taken from [194]
Figure 2.6: Comparison between iterative search used during lookup and ex- ex-ploratory search strategies, taken from [194]
+7

Références

Documents relatifs

In others words, the better the usability in the proposed approach, the less complex the process of performing search tasks on the bibliographic data published as Linked Data will

Abstract. This work describes a variation on the traditional Information Retrieval paradigm, where instead of text documents being indexed according to their content, they are

Linked Data Approach We propose to represent enterprise taxonomies in RDF em- ploying the standardized and widely used SKOS [12] vocabulary as well as publishing term definitions

Nevertheless a common limit of the existing linked data based exploratory search systems is the fact they constrain the exploration through single results selection and

A system survey on Linked Data exploration systems [13] learned that massive use of linked data based exploratory search function- alities and systems constitutes an improvement for

In order to enable users to quickly and easily discover datasets, we set up a portal for browsing the dataset. Naturally we set this up as a site that publishes the individual

The central thesis of this paper is that data mod- els in linked data can be supported by ontology design patterns at low cost by defining simple views and the methods to transform

In order to avoid the need for users to specify a complex structured query upfront [2, 4] or for local free-text indexes to be built [5, 6], we propose an approach that combines