The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Ontology matching with semantic verification
Open accessAbstract
ASMOV (Automated Semantic Matching of Ontologies with Verification) is a novel algorithm that uses lexical and structural characteristics of two ontologies to iteratively calculate a similarity measure between them, derives an alignment, and then verifies it to ensure that it does not contain semantic inconsistencies. In this paper, we describe the ASMOV algorithm, and then present experimental results that measure its accuracy using the OAEI 2008 tests, and that evaluate its use with two different thesauri: WordNet, and the Unified Medical Language System (UMLS). These results show the increased accuracy obtained by combining lexical, structural and extensional matchers with semantic verification, and demonstrate the advantage of using a domain-specific thesaurus for the alignment of specialized ontologies.
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
Toward principles for the design of ontologies used for knowledge sharing?
Gruber, T. R. (1995) · International Journal of Human-Computer Studies · doi:10.1006/ijhc.1995.1081 · Cited by 7,753
Proceedings of the 25th international conference on Machine learning - ICML '08
(2008) · doi:10.1145/1390156 · Cited by 6,680
An Information-Theoretic Definition of Similarity
Lin, D. (1998) · International Conference on Machine Learning · Cited by 3,790
Verbs semantics and lexical selection
Wu, Z., & Palmer, M. (1994) · Proceedings of the 32nd annual meeting on Association for Computational Linguistics - · doi:10.3115/981732.981751 · Cited by 3,136
Data integration: a theoretical perspective
Lenzerini, M. (2002) · Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/543613.543644 · Cited by 2,494
Euzenat, J., & Shvaiko, P. (2007) · Cited by 2,124
A vision for the future of genomics research
Collins, F. S., Green, E. D., Guttmacher, A. E., Guyer, M. S., & on behalf of the US National Human Genome Research Institute (2003) · Nature · doi:10.1038/nature01626 · Cited by 1,752
(2004) · Springer eBooks · doi:10.1007/978-3-540-24750-0 · Cited by 1,442
A comparison of string distance metrics for name-matching tasks
Cohen, W. W., Ravikumar, P., & Fienberg, S. E. (2003) · International Joint Conference on Artificial Intelligence · Cited by 1,369
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
Cited by
Ontology Matching: State of the Art and Future Challenges
Shvaiko, P., & Euzenat, J. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.253 · Cited by 1,148
LogMap: Logic-Based and Scalable Ontology Matching
Jiménez-Ruiz, E., & Cuenca Grau, B. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25073-6_18 · Cited by 494
Ontology matching: A literature review
Otero-Cerdeira, L., Rodríguez-Martínez, F. J., & Gómez-Rodríguez, A. (2015) · Expert Systems with Applications · doi:10.1016/j.eswa.2014.08.032 · Cited by 370
PARIS: probabilistic alignment of relations, instances, and schema
Suchanek, F. M., Abiteboul, S., & Senellart, P. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/2078331.2078332 · Cited by 358
A gene ontology inferred from molecular networks
Dutkowski, J., Kramer, M., Surma, M. A., Balakrishnan, R., Cherry, J. M., Krogan, N. J., & Ideker, T. (2013) · Nature Biotechnology · doi:10.1038/nbt.2463 · Cited by 184
Metadata
- Authors
- Jean-Mary, Y. R., Shironoshita, E. P., & Kabuka, M. R.
- Venue
- Journal of Web Semantics
- Publisher
- Elsevier BV
- Published
- 2009-09
- Volume
- 7
- Issue
- 3
- Pages
- 235-251
- ISSN
- 1570-8268 (ISSN-L)
- OpenAlex
- W2047029075
- Cited by
- 378
- References
- 25
- FWCI
- 42.29
- Type
- journal article
- Language
- en
- Open access
- green
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.