The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Learning to map between ontologies on the semantic web
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Hapeman, D. E. (1991) · Technometrics · doi:10.1080/00401706.1991.10484817 · Cited by 9,373
Wolpert, D. H. (1992) · Neural Networks · doi:10.1016/s0893-6080(05)80023-1 · Cited by 7,951
An Information-Theoretic Definition of Similarity
Lin, D. (1998) · International Conference on Machine Learning · Cited by 3,790
A survey of approaches to automatic schema matching
Rahm, E., & Bernstein, P. A. (2001) · The VLDB Journal · doi:10.1007/s007780100057 · Cited by 3,352
On the Optimality of the Simple Bayesian Classifier under Zero-One Loss
Domingos, P., & Pazzani, M. (1997) · Machine Learning · doi:10.1023/a:1007413511361 · Cited by 3,101
Self-citationFleiss, J. L., & Agresti, A. (1991) · Journal of the American Statistical Association · doi:10.2307/2290537 · Cited by 2,641
Ontology Learning for the Semantic Web
Maedche, A. (2002) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-1-4615-0925-7 · Cited by 1,668
Similarity flooding: a versatile graph matching algorithm and its application to schema matching
Melnik, S., Garcia-Molina, H., & Rahm, E. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994702 · Cited by 1,341
Generic Schema Matching with Cupid
Madhavan, J., Bernstein, P. A., & Rahm, E. (2001) · Cited by 1,296
Self-citationOntology learning for the Semantic Web
Maedche, A., & Staab, S. (2001) · IEEE Intelligent Systems · doi:10.1109/5254.920602 · Cited by 1,104
Cited by
Usage patterns of collaborative tagging systems
Golder, S. A., & Huberman, B. A. (2006) · Journal of Information Science · doi:10.1177/0165551506062337 · Cited by 1,817
A Survey of Schema-Based Matching Approaches
Shvaiko, P., & Euzenat, J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11603412_5 · Cited by 1,147
COMA — A system for flexible combination of schema matching approaches
Do, H.-H., & Rahm, E. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50060-3 · Cited by 1,067
Semantic integration: a survey of ontology-based approaches
Noy, N. F. (2004) · ACM SIGMOD Record · doi:10.1145/1041410.1041421 · Cited by 1,019
Trust Management for the Semantic Web
Richardson, M., Agrawal, R., & Domingos, P. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-39718-2_23 · Cited by 982
Self-citationGetoor, L., & Diehl, C. P. (2005) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1117454.1117456 · Cited by 973
The Structure of Collaborative Tagging Systems
Golder, S. A., & Huberman, B. A. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0508082 · Cited by 828
The PROMPT suite: interactive tools for ontology merging and mapping
Noy, N. F., & Musen, M. A. (2003) · International Journal of Human-Computer Studies · doi:10.1016/j.ijhcs.2003.08.002 · Cited by 728
Schema and ontology matching with COMA++
Aumueller, D., Do, H.-H., Massmann, S., & Rahm, E. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066283 · Cited by 650
(2006) · doi:10.5555/1182635.1164130 · Cited by 553
Self-citationOntology Matching: A Machine Learning Approach
Doan, A., Madhavan, J., Domingos, P., & Halevy, A. (2004) · Handbook on Ontologies · doi:10.1007/978-3-540-24750-0_19 · Cited by 477
Self-citationS-Match: an Algorithm and an Implementation of Semantic Matching
Giunchiglia, F., Shvaiko, P., & Yatskevich, M. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-25956-5_5 · Cited by 473
Learning to match ontologies on the Semantic Web
Doan, A., Madhavan, J., Dhamankar, R., Domingos, P., & Halevy, A. (2003) · The VLDB Journal The International Journal on Very Large Data Bases · doi:10.1007/s00778-003-0104-2 · Cited by 455
Self-citationWeb page classification: Features and algorithms
Qi, X., & Davison, B. D. (2009) · ACM Computing Surveys · doi:10.1145/1459352.1459357 · Cited by 435
Piazza: data management infrastructure for semantic web applications
Halevy, A. Y., Ives, Z. G., Mork, P., & Tatarinov, I. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775231 · Cited by 350
Self-citationMAFRA — A MApping FRAmework for Distributed Ontologies
Maedche, A., Motik, B., Silva, N., & Volz, R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45810-7_23 · Cited by 347
GIUNCHIGLIA, F., & SHVAIKO, P. (2003) · The Knowledge Engineering Review · doi:10.1017/s0269888904000074 · Cited by 321
Managing and Mining Uncertain Data
(2009) · Advances in Database Systems · doi:10.1007/978-0-387-09690-2 · Cited by 287
Ontology change: classification and survey
FLOURIS, G., MANAKANATAS, D., KONDYLAKIS, H., PLEXOUSAKIS, D., & ANTONIOU, G. (2008) · The Knowledge Engineering Review · doi:10.1017/s0269888908001367 · Cited by 271
IF-Map: An Ontology-Mapping Method Based on Information-Flow Theory
Kalfoglou, Y., & Schorlemmer, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-39733-5_5 · Cited by 259
Bootstrapping pay-as-you-go data integration systems
Das Sarma, A., Dong, X., & Halevy, A. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376702 · Cited by 254
Self-citation
Metadata
- Authors
- Doan, A., Madhavan, J., Domingos, P., & Halevy, A.
- Venue
- Proceedings of the 11th international conference on World Wide Web
- Publisher
- ACM
- Published
- 2002-05-07
- Pages
- 662-673
- OpenAlex
- W2148572968
- Cited by
- 885
- References
- 35
- FWCI
- 67.69
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.