2014
DOI: 10.1186/2041-1480-5-44
|View full text |Cite
|
Sign up to set email alerts
|

An effective method of large scale ontology matching

Abstract: BackgroundWe are currently facing a proliferation of heterogeneous biomedical data sources accessible through various knowledge-based applications. These data are annotated by increasingly extensive and widely disseminated knowledge organisation systems ranging from simple terminologies and structured vocabularies to formal ontologies. In order to solve the interoperability issue, which arises due to the heterogeneity of these ontologies, an alignment task is usually performed. However, while significant effor… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0
1

Year Published

2014
2014
2021
2021

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 31 publications
(23 citation statements)
references
References 48 publications
(67 reference statements)
0
22
0
1
Order By: Relevance
“…Most traditional methods use all the words except stop words in the vocabulary as the keys for indexing. For example, Diallo and Ba [10] used the words in the direct virtual document of an entity as the keys for indexing, where the direct virtual document of an entity is constituted by the combination of its uniform resources identifier, the URI, the local name, the labels in different languages extracted by a function and the set of annotations associated with it. Li et al [11] built the inverted indexes for name vectors and virtual documents of an entity respectively.…”
Section: Candidate Pair Generationmentioning
confidence: 99%
“…Most traditional methods use all the words except stop words in the vocabulary as the keys for indexing. For example, Diallo and Ba [10] used the words in the direct virtual document of an entity as the keys for indexing, where the direct virtual document of an entity is constituted by the combination of its uniform resources identifier, the URI, the local name, the labels in different languages extracted by a function and the set of annotations associated with it. Li et al [11] built the inverted indexes for name vectors and virtual documents of an entity respectively.…”
Section: Candidate Pair Generationmentioning
confidence: 99%
“…Using other sources or improving existing ones: Diallo et al [31], Fung et al [32] or Bodenreider et al [33] developed methods to improve mappings already available in UMLS.…”
Section: Perspectivesmentioning
confidence: 99%
“…RiMOM2013 [ 61 ] is an evolution of RiMOM (Risk Minimization based Ontology Mapping) [ 62 ] that integrates different matching strategies which are automatically selected and combined in order to achieve the combination that better fits each matching problem. ServOMap [ 19 , 63 , 64 ], as first step, dynamically generates a description of each entity in the ontologies, which is used to compute the lexical similarity among the entities as another entry of the vector of terms that represents each entity. Next, a context-based similarity value is calculated by computing the similarity of the surrounding concepts for each entity.…”
Section: Related Workmentioning
confidence: 99%