Difference between revisions of "NSByGrounding"

From Knoesis wiki
Jump to: navigation, search
(Nominal Schema Reasoning by Grounding)
(Approach)
Line 3: Line 3:
 
This page contains the implementation of nominal schema reasoning using naive grounding. Although not highly time-efficient this implementation will be used as a baseline for the development and testing of more efficient algorithms, and shows that even the naive grounding approach can be used for small use cases or for initial testing.
 
This page contains the implementation of nominal schema reasoning using naive grounding. Although not highly time-efficient this implementation will be used as a baseline for the development and testing of more efficient algorithms, and shows that even the naive grounding approach can be used for small use cases or for initial testing.
  
== Approach ==
+
== Empirical evaluation ==
BLOOMS bootstrapping approach utilizes the Wikipedia category hierarchy for aligning ontologies. BLOOMS constructs a forest (i.e., a set of trees) ''T''<sub>C</sub> (known as '''BLOOMS forest''' for ''C'') for each matching candidate class name ''C'', which roughly corresponds to a selection of supercategories of the class name. Comparison of the forests ''T''<sub>C</sub> and ''T''<sub>B</sub> for matching candidate classes ''C'' and ''B'' then yields a decision whether or not (and with which of the candidate relations) ''C'' and ''B'' should be aligned.
+
For this empirical evaluation several ontologies, presented in the next section, were chosen from the TONES repository (reference?).
 +
 
 +
For each experiment one or more axioms containing nominal schemas were added to each ontologies grounding the occurences of the nominal schemas with all possible combinations of individuals contained in the knowledge bases.
 +
 
 +
Testing experiments try to find what are the limits of this Naive implementation .
 +
 
 +
Reasoning times (using Pellet after grounding) are averaged over 100 runs, and load time is reported separately
 +
 
 +
D
 +
 
 +
Testing was performed using a 64-bit Windows 7 computer. A java JDK 1.5 version, allocating 3GB as the minimun for the java heap and 3.5GB as the maximun, was used for each experiment.

Revision as of 16:21, 14 June 2011

Nominal Schema Reasoning by Grounding

This page contains the implementation of nominal schema reasoning using naive grounding. Although not highly time-efficient this implementation will be used as a baseline for the development and testing of more efficient algorithms, and shows that even the naive grounding approach can be used for small use cases or for initial testing.

Empirical evaluation

For this empirical evaluation several ontologies, presented in the next section, were chosen from the TONES repository (reference?).

For each experiment one or more axioms containing nominal schemas were added to each ontologies grounding the occurences of the nominal schemas with all possible combinations of individuals contained in the knowledge bases.

Testing experiments try to find what are the limits of this Naive implementation .

Reasoning times (using Pellet after grounding) are averaged over 100 runs, and load time is reported separately

D

Testing was performed using a 64-bit Windows 7 computer. A java JDK 1.5 version, allocating 3GB as the minimun for the java heap and 3.5GB as the maximun, was used for each experiment.