ACM Home Page
Please provide us with feedback. Feedback
Learning to map between ontologies on the semantic web
Full text PdfPdf (281 KB)
Source International World Wide Web Conference archive
Proceedings of the 11th international conference on World Wide Web table of contents
Honolulu, Hawaii, USA
SESSION: Ontologies table of contents
Pages: 662 - 673  
Year of Publication: 2002
ISBN:1-58113-449-5
Authors
AnHai Doan  University of Washington, Seattle, WA
Jayant Madhavan  University of Washington, Seattle, WA
Pedro Domingos  University of Washington, Seattle, WA
Alon Halevy  University of Washington, Seattle, WA
Sponsors
ACM: Association for Computing Machinery
: WWW'02
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 36,   Downloads (12 Months): 214,   Citation Count: 107
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/511446.511532
What is a DOI?

ABSTRACT

Ontologies play a prominent role on the Semantic Web. They make possible the widespread publication of machine understandable data, opening myriad opportunities for automated information processing. However, because of the Semantic Web's distributed nature, data on it will inevitably come from many different ontologies. Information processing across ontologies is not possible without knowing the semantic mappings between their elements. Manually finding such mappings is tedious, error-prone, and clearly not possible at the Web scale. Hence, the development of tools to assist in the ontology mapping process is crucial to the success of the Semantic Web.We describe glue, a system that employs machine learning techniques to find such mappings. Given two ontologies, for each concept in one ontology glue finds the most similar concept in the other ontology. We give well-founded probabilistic definitions to several practical similarity measures, and show that glue can work with all of them. This is in contrast to most existing approaches, which deal with a single similarity measure. Another key feature of glue is that it uses multiple learning strategies, each of which exploits a different type of information either in the data instances or in the taxonomic structure of the ontologies. To further improve matching accuracy, we extend glue to incorporate commonsense knowledge and domain constraints into the matching process. For this purpose, we show that relaxation labeling, a well-known constraint optimization technique used in computer vision and other fields, can be adapted to work efficiently in our context. Our approach is thus distinguished in that it works with a variety of well-defined similarity notions and that it efficiently incorporates multiple types of knowledge. We describe a set of experiments on several real-world domains, and show that glue proposes highly accurate semantic mappings.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
www.daml.org.
 
3
www.google.com.
 
4
IEEE Intelligent Systems, 16(2), 2001.
 
5
A. Agresti. Categorical Data Analysis. Wiley, New York, NY, 1990.
 
6
T. Berners-Lee, J. Hendler, and O. Lassila. The Semantic Web. Scientific American, 279, 2001.
 
7
D. Brickley and R. Guha. Resource Description Framework Schema Specification 1.0, 2000.
8
 
9
D. Calvanese, D. G. Giuseppe, and M. Lenzerini. Ontology of Integration and Integration of Ontologies. In Proceedings of the 2001 Description Logic Workshop (DL 2001).
10
 
11
H. Chalupsky. Ontomorph: A Translation system for symbolic knowledge. In Principles of Knowledge Representation and Reasoning, 2000.
12
 
13
 
14
 
15
 
16
R. Hummel and S. Zucker. On the Foundations of Relaxation Labeling Processes. PAMI, 5(3):267--287, May 1983.
 
17
R. Ichise, H. Takeda, and S. Honiden. Rule Induction for Concept Hierarchy Alignment. In Proceedings of the Workshop on Ontology Learning at the 17th International Joint Conference on Artificial Intelligence (IJCAI), 2001.
 
18
 
19
 
20
S. Lloyd. An optimization approach to relaxation labeling algorithms. Image and Vision Computing, 1(2), 1983.
 
21
 
22
A. Maedche. A Machine Learning Perspective for the Semantic Web. Semantic Web Working Symposium (SWWS) Position Paper, 2001.
 
23
 
24
 
25
S. Melnik, H. Molina-Garcia, and E. Rahm. Similarity Flooding: A Versatile Graph Matching Algorithm. In Proceedings of the International Conference on Data Engineering (ICDE), 2002.
 
26
 
27
P. Mitra, G. Wiederhold, and J. Jannink. Semi-automatic Integration of Knowledge Sources. In Proceedings of Fusion'99.
 
28
 
29
N. Noy and M. Musen. Anchor-PROMPT: Using Non-Local Context for Semantic Matching. In Proceedings of the Workshop on Ontologies and Information Sharing at the International Joint Conference on Artificial Intelligence (IJCAI), 2001.
 
30
B. Omelayenko. Learning of Ontologies for the Web: the Analysis of Existent approaches. In Proceedings of the International Workshop on Web Dynamics, 2001.
 
31
L. Padro. A Hybrid Environment for Syntax-Semantic Tagging, 1998.
 
32
N. Pernelle, M.-C. Rousset, and V. Ventos. Automatic Construction and Refinement of a Class Hierarchy over Semi-Structured Data. In Proceeding of the Workshop on Ontology Learning at the 17th International Joint Conference on Artificial Intelligence (IJCAI), 2001.
 
33
 
34
K. M. Ting and I. H. Witten. Issues in stacked generalization. Journal of Artificial Intelligence Research (JAIR), 10:271--289, 1999.
 
35
M. Uschold. Where is the semantics in the Semantic Web? In Workshop on Ontologies in Agent Systems (OAS) at the 5th International Conference on Autonomous Agents, 2001.
 
36
 
37
38

CITED BY  107

Collaborative Colleagues:
AnHai Doan: colleagues
Jayant Madhavan: colleagues
Pedro Domingos: colleagues
Alon Halevy: colleagues