2019
DOI: 10.1007/978-3-030-30278-8_11
|View full text |Cite
|
Sign up to set email alerts
|

Exploring Pattern Mining for Solving the Ontology Matching Problem

Abstract: This paper deals with the ontology matching problem, and proposes a pattern mining approach that exploits the different correlation and dependencies between the different properties to select the most appropriate features for the matching process. The proposed method first discovers the frequent patterns from the ontology database, and then find out the most relevant features using the patterns derived. To demonstrate the usefulness of the suggested method, several experiments have been carried out on the OAEI… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6

Relationship

3
3

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 20 publications
0
5
0
Order By: Relevance
“…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]. This method searches for the redundant patterns in the ontology database and matches the target ontology's relevant feature to find efficient matching.…”
Section: Literature Reviewmentioning
confidence: 99%
“…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]. This method searches for the redundant patterns in the ontology database and matches the target ontology's relevant feature to find efficient matching.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The genetic algorithm is then performed in order to explore the alignment space between two ontologies. Belhadi et al 33 proposed a pattern mining for ontology matching (PMOM), which is a data mining based solution for the ontology matching. The set of frequent patterns of both ontologies are first discovered, instead of exploring the whole set of properties, only these relevant patterns are checked to find the best alignment.…”
Section: Related Workmentioning
confidence: 99%
“…The first algorithm called GFSOM 32 which received the best paper award in the international conference on genetic and evolutionary computing. The second algorithm called PMOM 33 which is recently published in European conference on advances in databases and information systems. The runtime is calculated by seconds, and the accuracy is determined by computing the percentage of the corrected matched.…”
Section: Performance Evaluationmentioning
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%