Abstract | ||
---|---|---|
Efficient resource retrieval is a crucial issue, particularly in the context of Semantic Web, since forms of reasoning are used for answering requests. Resources are retrieved by performing a match test between each resource description and the 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 in Web ontology languages. In the index, the available resource descriptions are located at the leaf nodes, while inner nodes represent intensional descriptions (generalizations) of their child nodes. The match process is executed by following the tree branches whose nodes satisfy the query. Query answering time may be strongly improved as the steps may be O(\log n). |
Year | DOI | Venue |
---|---|---|
2010 | 10.1109/ICSC.2010.18 | Semantic Computing |
Keywords | Field | DocType |
resource description,new conceptual clustering method,web ontology language,semantic knowledge bases,query answering time,efficient resource retrieval,available resource,match test,match process,available resource description,semantic web,semantics,indexes,conceptual clustering,description logics,description logic,approximation algorithms,clustering algorithms,knowledge base,satisfiability,transportation,indexation | Query expansion,Information retrieval,Computer science,Description logic,Semantic Web,Conceptual clustering,Cluster analysis,Semantics,Ontology language,Web Ontology Language | Conference |
ISSN | ISBN | Citations |
2325-6516 | 978-0-7695-4154-9 | 1 |
PageRank | References | Authors |
0.37 | 18 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Claudia D'Amato | 1 | 733 | 57.03 |
Steffen Staab | 2 | 6658 | 593.89 |
Nicola Fanizzi | 3 | 1124 | 90.54 |
Floriana Esposito | 4 | 2434 | 277.96 |