Efficient resource retrieval is a crucial issue, particularly when semantic resource descriptions are considered which enable the exploitation of reasoning services during the retrieval process. In this context, resources are commonly retrieved by checking if each available resource description satisfies the given query. This approach becomes inefficient with the increase of available resources. We propose a method for improving the retrieval process by constructing a tree index through a new conceptual clustering method for resources expressed as class definitions or as instances of classes in ontology languages. The available resource descriptions are located at the leaf nodes of the index, while inner nodes represent intensional descriptions (generalizations) of their child nodes. The retrieval is performed by following the tree branches whose nodes satisfy the query. Query answering time may be improved as the number of retrieval steps may be O(log n) in the best case.

DL-LINK: A Conceptual Clustering Algorithm for indexing Description Logics Knowledge Bases

D'AMATO, CLAUDIA;FANIZZI, Nicola;ESPOSITO, Floriana
2010

Abstract

Efficient resource retrieval is a crucial issue, particularly when semantic resource descriptions are considered which enable the exploitation of reasoning services during the retrieval process. In this context, resources are commonly retrieved by checking if each available resource description satisfies the given query. This approach becomes inefficient with the increase of available resources. We propose a method for improving the retrieval process by constructing a tree index through a new conceptual clustering method for resources expressed as class definitions or as instances of classes in ontology languages. The available resource descriptions are located at the leaf nodes of the index, while inner nodes represent intensional descriptions (generalizations) of their child nodes. The retrieval is performed by following the tree branches whose nodes satisfy the query. Query answering time may be improved as the number of retrieval steps may be O(log n) in the best case.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11586/12159
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? ND
social impact