Name
Abstract | ||
|---|---|---|
Ontologies are often used to annotate information (metadata) that is passed between domains during negotiation. In that sense, Ontology matching is critical for the receiving domain to gather the correct meaning of the data, and hence critical for interoperability. Many Ontology matching algorithms have been proposed in the literature but in general they all assume that there is a considerable amount of knowledge about both ontologies (sender and recipient). This assumption is not true in many cases. In this paper, we present an approach that does not require such assumption, allowing the parts to keep a considerable amount of secrecy on their Ontology while still providing the required matching functionality. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-28563-9_6 | ATOP@AAMAS |
Keywords | Field | DocType |
ontology,metrics,interoperability,information exchange,metadata,algorithms | Ontology (information science),Ontology-based data integration,Ontology,Ontology alignment,Information retrieval,Process ontology,Computer science,Suggested Upper Merged Ontology,Upper ontology,Ontology components | Conference |
Citations | PageRank | References |
1 | 0.37 | 10 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| renato levy | 1 | 1 | 0.37 |
| jakob henriksson | 2 | 1 | 0.37 |
| margaret lyell | 3 | 1 | 0.37 |
| xiong liu | 4 | 1 | 0.37 |
| michael j mayhew | 5 | 1 | 0.37 |