Sciweavers

272 search results - page 39 / 55
» Learning to match ontologies on the Semantic Web
Sort
View
TSC
2010
182views more  TSC 2010»
14 years 4 months ago
A Query Rewriting Approach for Web Service Composition
Data-Providing (DP) services allow query-like access to organizations' data via web services. The invocation of a DP service results in the execution of a query over data sour...
Mahmoud Barhamgi, Djamal Benslimane, Brahim Medjah...
WECWIS
2007
IEEE
135views ECommerce» more  WECWIS 2007»
15 years 4 months ago
Large Scale Web Service Discovery and Composition using High Performance In-Memory Indexing
With the growing number and ubiquitous usage of Web services throughout the service-oriented community, the need to find service descriptions in a given repository, as well as co...
Lukasz Juszczyk, Anton Michlmayr, Christian Platze...
AAAI
2007
15 years 1 days ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
15 years 3 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
SEMWEB
2009
Springer
15 years 4 months ago
An Algorithm for Learning with Probabilistic Description Logics
Probabilistic Description Logics are the basis of ontologies in the Semantic Web. Knowledge representation and reasoning for these logics have been extensively explored in the last...
José Eduardo Ochoa Luna, Fabio Gagliardi Co...