Browse wiki
From Semantic Portal Wiki
| Joshua Taylor presents Discovering Simple Mappings Between Relational Database Schemas and Ontologies Jesse Weaver |
| Modification dateThis property is a special property in this wiki. | 7 October 2008 18:01:28 + |
|---|---|
| Question answer | As_presented,_I_do_not_think_that_'''ContextMatch'''_would_be_capable_of_handling_non-disjoint_subclasses_in_the_expected_manner._It_also_wouldn't_seem_to_handle_individuals_whose_most_specific_class_are_not_leaves. |
| Question answered by | Joshua A. Taylor + |
| Question asked | Line 3 in the algorithm presented in Table … Line 3 in the algorithm presented in Table 1 iterates over all of '''disjoint''' subclasses of class ''v''. What if class ''v'' has subclasses that are not disjoint? How would it handle this condition? Also, line 9 of the same algorithm uses a threshold τ. What value of τ is used in the second experiment (generating contextual mappings)? periment (generating contextual mappings)? |
| Question asked by | Jesse Weaver + |
| Question for the Presentation | Joshua Taylor presents Discovering Simple Mappings Between Relational Database Schemas and Ontologies + |
| Categories | Presentation Questions |
| hide properties that link here |
| No properties link to this page. |
