2020
DOI: 10.1007/s10489-019-01593-3
|View full text |Cite
|
Sign up to set email alerts
|

Data mining-based approach for ontology matching problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
8

Relationship

2
6

Authors

Journals

citations
Cited by 18 publications
(6 citation statements)
references
References 48 publications
0
6
0
Order By: Relevance
“…Another interesting preprocessing step is feature selection. 49 The idea is to apply the feature selection methods in order to select the relevant concepts and the relations for participating in solving the distributed knowledge graph matching problem. This selection allows to considerably reduce the dimensions of the problem by removing the irrelevant concepts and relations before the matching process.…”
Section: Discussionmentioning
confidence: 99%
“…Another interesting preprocessing step is feature selection. 49 The idea is to apply the feature selection methods in order to select the relevant concepts and the relations for participating in solving the distributed knowledge graph matching problem. This selection allows to considerably reduce the dimensions of the problem by removing the irrelevant concepts and relations before the matching process.…”
Section: Discussionmentioning
confidence: 99%
“…It has a source knowledge base to the application domain and the target knowledge base's samples to find the exact ontology matching. Data Mining for Ontology Matching (DMOM) framework compares the cases and the data properties through three stages: exhaustive, statistical, and Frequent Itemset Mining (FIM) using the DBpedia ontology [31]. Similarly, a pattern-matching algorithm proposes to solve ontology matching problems using a pattern mining approach [32].…”
Section: Literature Reviewmentioning
confidence: 99%
“…However, these approaches have runtimes greater than 700 s, with data properties equal to 100%. More sophisticated solutions to ontology problems attempt to improve the matching process by exploring the search space with the partitioning algorithms, [6][7][8][9][10] high-performance computing (HPC), [11][12][13] and evolutionary computation approaches, [14][15][16][17] among others. However, the overall performance of the ontology matching still needs improvements in particular for complex applications such as related to smart cities.…”
Section: % Propertiesmentioning
confidence: 99%