On Modelling Cooperative Retrieval Using an Ontology-Based Query Refinement Process View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2004

AUTHORS

Nenad Stojanovic , Ljiljana Stojanovic

ABSTRACT

In this paper we present an approach for the interactive refinement of ontology-based queries. The approach is based on generating a lattice of the refinements, that enables a step-by-step tailoring of a query to the current information needs of a user. These needs are implicitly elicited by analysing the user’s behaviour during the searching process. The gap between a user’s need and his query is quantified by measuring several types of query ambiguities, which are used for ranking of the refinements. The main advantage of the approach is a more cooperative support in the refinement process: by exploiting the ontology background, the approach supports finding “similar” results and enables efficient relaxing of failing queries. More... »

PAGES

434-449

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-540-30464-7_34

DOI

http://dx.doi.org/10.1007/978-3-540-30464-7_34

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1035047198


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0806", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information Systems", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Institute AIFB, Research Group Knowledge Management, University of Karlsruhe, 76128, Karlsruhe, Germany", 
          "id": "http://www.grid.ac/institutes/grid.7892.4", 
          "name": [
            "Institute AIFB, Research Group Knowledge Management, University of Karlsruhe, 76128, Karlsruhe, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Stojanovic", 
        "givenName": "Nenad", 
        "id": "sg:person.011564632227.91", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011564632227.91"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "FZI, Research Center for Information Technologies at the University of Karlsruhe, 76128, Karlsruhe, Germany", 
          "id": "http://www.grid.ac/institutes/grid.28541.3a", 
          "name": [
            "FZI, Research Center for Information Technologies at the University of Karlsruhe, 76128, Karlsruhe, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Stojanovic", 
        "givenName": "Ljiljana", 
        "id": "sg:person.013755153627.81", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013755153627.81"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2004", 
    "datePublishedReg": "2004-01-01", 
    "description": "In this paper we present an approach for the interactive refinement of ontology-based queries. The approach is based on generating a lattice of the refinements, that enables a step-by-step tailoring of a query to the current information needs of a user. These needs are implicitly elicited by analysing the user\u2019s behaviour during the searching process. The gap between a user\u2019s need and his query is quantified by measuring several types of query ambiguities, which are used for ranking of the refinements. The main advantage of the approach is a more cooperative support in the refinement process: by exploiting the ontology background, the approach supports finding \u201csimilar\u201d results and enables efficient relaxing of failing queries.", 
    "editor": [
      {
        "familyName": "Atzeni", 
        "givenName": "Paolo", 
        "type": "Person"
      }, 
      {
        "familyName": "Chu", 
        "givenName": "Wesley", 
        "type": "Person"
      }, 
      {
        "familyName": "Lu", 
        "givenName": "Hongjun", 
        "type": "Person"
      }, 
      {
        "familyName": "Zhou", 
        "givenName": "Shuigeng", 
        "type": "Person"
      }, 
      {
        "familyName": "Ling", 
        "givenName": "Tok-Wang", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-540-30464-7_34", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-23723-5", 
        "978-3-540-30464-7"
      ], 
      "name": "Conceptual Modeling \u2013 ER 2004", 
      "type": "Book"
    }, 
    "keywords": [
      "ontology-based query", 
      "query refinement process", 
      "refinement process", 
      "ontology background", 
      "query ambiguity", 
      "cooperative retrieval", 
      "interactive refinement", 
      "user behavior", 
      "user needs", 
      "queries", 
      "cooperative support", 
      "main advantage", 
      "ontology", 
      "users", 
      "retrieval", 
      "refinement", 
      "current information", 
      "information", 
      "need", 
      "advantages", 
      "process", 
      "ambiguity", 
      "step", 
      "support", 
      "behavior", 
      "results", 
      "tailoring", 
      "gap", 
      "background", 
      "types", 
      "relaxing", 
      "lattice", 
      "approach", 
      "paper", 
      "step tailoring", 
      "efficient relaxing", 
      "Modelling Cooperative Retrieval"
    ], 
    "name": "On Modelling Cooperative Retrieval Using an Ontology-Based Query Refinement Process", 
    "pagination": "434-449", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1035047198"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-540-30464-7_34"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-540-30464-7_34", 
      "https://app.dimensions.ai/details/publication/pub.1035047198"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-01-01T19:10", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/chapter/chapter_17.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-540-30464-7_34"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-30464-7_34'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-30464-7_34'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-30464-7_34'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-30464-7_34'


 

This table displays all metadata directly associated to this object as RDF triples.

127 TRIPLES      23 PREDICATES      63 URIs      56 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-540-30464-7_34 schema:about anzsrc-for:08
2 anzsrc-for:0806
3 schema:author N350518549f0d46dd90ea6d2daca4b2d1
4 schema:datePublished 2004
5 schema:datePublishedReg 2004-01-01
6 schema:description In this paper we present an approach for the interactive refinement of ontology-based queries. The approach is based on generating a lattice of the refinements, that enables a step-by-step tailoring of a query to the current information needs of a user. These needs are implicitly elicited by analysing the user’s behaviour during the searching process. The gap between a user’s need and his query is quantified by measuring several types of query ambiguities, which are used for ranking of the refinements. The main advantage of the approach is a more cooperative support in the refinement process: by exploiting the ontology background, the approach supports finding “similar” results and enables efficient relaxing of failing queries.
7 schema:editor N01b03ec7f7de43f785c48e8c4363503d
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf Nd6f130e66e154f22be0f6c573fddce35
12 schema:keywords Modelling Cooperative Retrieval
13 advantages
14 ambiguity
15 approach
16 background
17 behavior
18 cooperative retrieval
19 cooperative support
20 current information
21 efficient relaxing
22 gap
23 information
24 interactive refinement
25 lattice
26 main advantage
27 need
28 ontology
29 ontology background
30 ontology-based query
31 paper
32 process
33 queries
34 query ambiguity
35 query refinement process
36 refinement
37 refinement process
38 relaxing
39 results
40 retrieval
41 step
42 step tailoring
43 support
44 tailoring
45 types
46 user behavior
47 user needs
48 users
49 schema:name On Modelling Cooperative Retrieval Using an Ontology-Based Query Refinement Process
50 schema:pagination 434-449
51 schema:productId N12a5a7eb973c446cb79a79835c733c9e
52 Na5de9c4e16dd4204a2b5e5e30a4847c1
53 schema:publisher Nd628f62be7b34c84b089b3d3636e2597
54 schema:sameAs https://app.dimensions.ai/details/publication/pub.1035047198
55 https://doi.org/10.1007/978-3-540-30464-7_34
56 schema:sdDatePublished 2022-01-01T19:10
57 schema:sdLicense https://scigraph.springernature.com/explorer/license/
58 schema:sdPublisher N5c8fe1ba63e94382a227af6cfe10b77c
59 schema:url https://doi.org/10.1007/978-3-540-30464-7_34
60 sgo:license sg:explorer/license/
61 sgo:sdDataset chapters
62 rdf:type schema:Chapter
63 N01b03ec7f7de43f785c48e8c4363503d rdf:first N0ff0114ac9054c0f92f9d7decb112502
64 rdf:rest Nf6c326c40b2d45a9967fc32b603763f0
65 N073a8c4bd6e34979884b5e4f4c9ee4d7 schema:familyName Chu
66 schema:givenName Wesley
67 rdf:type schema:Person
68 N0ff0114ac9054c0f92f9d7decb112502 schema:familyName Atzeni
69 schema:givenName Paolo
70 rdf:type schema:Person
71 N12a5a7eb973c446cb79a79835c733c9e schema:name dimensions_id
72 schema:value pub.1035047198
73 rdf:type schema:PropertyValue
74 N16ec82326ae9449d802fd9e7632ba71b rdf:first N70a39969392447a6930fd5f1645563dd
75 rdf:rest rdf:nil
76 N28c14f37910c4877b830afa89d7f9e2a schema:familyName Zhou
77 schema:givenName Shuigeng
78 rdf:type schema:Person
79 N350518549f0d46dd90ea6d2daca4b2d1 rdf:first sg:person.011564632227.91
80 rdf:rest Nf141ffc9a55647ababda787249db4d90
81 N4a4aabeff22b412d9296a58927a51048 rdf:first N28c14f37910c4877b830afa89d7f9e2a
82 rdf:rest N16ec82326ae9449d802fd9e7632ba71b
83 N5c8fe1ba63e94382a227af6cfe10b77c schema:name Springer Nature - SN SciGraph project
84 rdf:type schema:Organization
85 N70a39969392447a6930fd5f1645563dd schema:familyName Ling
86 schema:givenName Tok-Wang
87 rdf:type schema:Person
88 Na5de9c4e16dd4204a2b5e5e30a4847c1 schema:name doi
89 schema:value 10.1007/978-3-540-30464-7_34
90 rdf:type schema:PropertyValue
91 Nb3ee6cdfb7f54196be3b742c4fcb7645 rdf:first Nefb27999ad8a4757924a8925095f6d4b
92 rdf:rest N4a4aabeff22b412d9296a58927a51048
93 Nd628f62be7b34c84b089b3d3636e2597 schema:name Springer Nature
94 rdf:type schema:Organisation
95 Nd6f130e66e154f22be0f6c573fddce35 schema:isbn 978-3-540-23723-5
96 978-3-540-30464-7
97 schema:name Conceptual Modeling – ER 2004
98 rdf:type schema:Book
99 Nefb27999ad8a4757924a8925095f6d4b schema:familyName Lu
100 schema:givenName Hongjun
101 rdf:type schema:Person
102 Nf141ffc9a55647ababda787249db4d90 rdf:first sg:person.013755153627.81
103 rdf:rest rdf:nil
104 Nf6c326c40b2d45a9967fc32b603763f0 rdf:first N073a8c4bd6e34979884b5e4f4c9ee4d7
105 rdf:rest Nb3ee6cdfb7f54196be3b742c4fcb7645
106 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
107 schema:name Information and Computing Sciences
108 rdf:type schema:DefinedTerm
109 anzsrc-for:0806 schema:inDefinedTermSet anzsrc-for:
110 schema:name Information Systems
111 rdf:type schema:DefinedTerm
112 sg:person.011564632227.91 schema:affiliation grid-institutes:grid.7892.4
113 schema:familyName Stojanovic
114 schema:givenName Nenad
115 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011564632227.91
116 rdf:type schema:Person
117 sg:person.013755153627.81 schema:affiliation grid-institutes:grid.28541.3a
118 schema:familyName Stojanovic
119 schema:givenName Ljiljana
120 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013755153627.81
121 rdf:type schema:Person
122 grid-institutes:grid.28541.3a schema:alternateName FZI, Research Center for Information Technologies at the University of Karlsruhe, 76128, Karlsruhe, Germany
123 schema:name FZI, Research Center for Information Technologies at the University of Karlsruhe, 76128, Karlsruhe, Germany
124 rdf:type schema:Organization
125 grid-institutes:grid.7892.4 schema:alternateName Institute AIFB, Research Group Knowledge Management, University of Karlsruhe, 76128, Karlsruhe, Germany
126 schema:name Institute AIFB, Research Group Knowledge Management, University of Karlsruhe, 76128, Karlsruhe, Germany
127 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...