combiSQORE: An Ontology Combination Algorithm
published: Feb. 1, 2008, recorded: November 2007, views: 104
Related content
26:09
102 views - Patrick Lambrix, 2007
29:22
541 views - Adam Funk, 2007
32:32
73 views - Lei Zhang, 2008
44:51
178 views - Domenico Lembo, 2007
23:26
82 views - Ting Wang, 2008
23:27
367 views - Anna V. Zhdanova, 2006
24:58
153 views - Thanh Tran, 2007
01:14:22
255 views - Frank van Harmelen, James A. Hendler, Dieter Fensel, Carole Goble, Abraham Bernstein, Guus Schreiber, 2008
42:24
790 views - Asunción Gómez-Pérez, 2007
30:02
144 views - Enrico Motta, 2007
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Description
Automatic knowledge reuse for Semantic Web applications imposes several challenges on ontology search. Existing ontology retrieval systems merely return a lengthy list of relevant single ontologies, which may not completely cover the specified user requirements. Therefore, there arises an increasing demand for a tool or algorithm with a mechanism to check concept adequacy of existing ontologies with respect to a user query, and then recommend a single or combination of ontologies which can entirely fulfill the requirements. Thus, this paper develops an algorithm, namely combiSQORE to determine whether the available collection of ontologies is able to completely satisfy a submitted query and return a single or combinative ontology that guarantees query coverage. In addition, it ranks the returned answers based on their conceptual closeness and query coverage. The experimental results show that the proposed algorithm is simple, efficient and effective.
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !




Write your own review or comment: