Apparatus and method for matching large-scale biomedical ontologies

Patent metadata

Field	Value
Publication number	US-9747563-B2
Application number	US-201314091689-A
Country	US
Kind code	B2
Filing date	Nov 27, 2013
Priority date	Nov 27, 2013
Publication date	Aug 29, 2017
Grant date	Aug 29, 2017

Abstract

An ontology matching apparatus for large-scale biomedical ontologies according to the present invention is provided, and the ontology matching apparatus includes a preprocessing unit configured to classify received candidate ontologies into one or more ontology subsets to generate ontology subsets, a distribution processing unit configured to divide the generated ontology subsets by virtue of a distribution algorithm, apply a matching algorithm to the divided ontology subsets to generate matching threads, and deliver the generated matching threads to individual cores of participating nodes, and an aggregating unit configured to collect and sum matching results generated by the individual cores performing matching operations based on the matching threads to generate an ontology mapping.

First claim

What is claimed is:

1. An ontology matching apparatus for large-scale biomedical ontologies, the apparatus comprising:
a processor configured to:
classify received candidate ontologies into one or more ontology subsets to generate ontology subsets;
divide the generated ontology subsets by a distribution algorithm, apply a matching algorithm to the divided ontology subsets to generate matching threads, and deliver the generated matching threads to individual cores of participating nodes; and
collect and sum matching results generated by the individual cores performing matching operations based on the matching threads to generate an ontology mapping,
wherein in response to receiving the candidate ontologies, the processor is further configured to confirm the number of participating nodes available for matching and the number of individual cores provided in the participating nodes connected to the participating nodes, applies the number of the participating nodes and the number of the individual cores to a distribution algorithm to set the number of distributions, and divides the ontology subsets in consideration of the set number of distributions and applies the matching algorithm to the divided ontology subsets to generate the matching threads including matching requests, matching jobs, and matching tasks.

2. The ontology matching apparatus according to claim 1 , wherein the processor is further configured to serializes the generated ontology subsets into a binary form to generate serialized ontology subsets.

3. The ontology matching apparatus according to claim 2 , further comprising an ontology storing unit configured to store the serialized ontology subsets, and to provide the serialized ontology subsets that are already stored to the processor when the same candidate ontology as the received candidate ontology is received.

4. The ontology matching apparatus according to claim 3 , wherein the processor is further configured to reconfigure the serialized ontology subsets received from the ontology storing unit through deserialization to generate ontology subsets.

5. The ontology matching apparatus according to claim 1 , wherein the matching threads include one or more matching requests corresponding to the participating nodes in one-to-one relation, one or more matching jobs corresponding to the individual cores in one-to-one relation provided in the participating nodes corresponding to the matching requests in one-to-one relation, and one or more matching tasks performing the matching operations in the individual cores.

6. The ontology matching apparatus according to claim 5 , wherein the relation among the matching requests, the matching jobs, and the matching tasks is calculated by formulae below:

MR
←

∑

i
=
1

Nodes

⁢

MR
i

MR
i

←

∑

j
=
1

Cores

⁢

MJ
j

MJ
j

←

∑

k
=
1

Copncepts

⁢

MT
k

MT
k

←

m
×
n

|

m
∈

O
s

⁢
n

∈

O
t

wherein MR i indicates the matching requests allocated to the respective participating nodes, MR indicates a set matching request of MR i allocated to the participating nodes, MJ j indicates the matching jobs allocated to the individual cores provided in the participating nodes, and MT k indicates the matching tasks allocated to the individual cores to perform the matching operations.

7. The ontology matching apparatus according to claim 5 , wherein the matching jobs are independent of other matching jobs and the matching requests operating in other participating nodes.

8. The ontology matching apparatus according to claim 1 , ontology matching apparatus according to claim 1 , wherein collecting and aggregating the matching results of the individual cores including two or more participating nodes is calculated by formulae below

O
b
Job

←

⋃

i
=
1

MT

⁢

O
b
i

,

⁢

O
b
Node

←

∑

i
=
0

MJ

⁢

O
b

job
=
i

O
b

←

∑

i
=
1

TotalNode

⁢

O
b

Node
=
i

wherein O b i indicates a matching result of a matching task (bridge ontology of the Job matching task), O b Job indicates an intermediate bridge o

Assignees

• Univ-Industry Coop Group Of Kyung Hee Univ

Inventors

• Lee Sung-Young
• Amin Muhammad Bilal

Classifications

• G16H15/00

  ICT specially adapted for medical reports, e.g. generation or transmission thereof · CPC title

• G06F40/30

  Semantic analysis · CPC title

• G16H70/00

  ICT specially adapted for the handling or processing of medical references · CPC title

• G06Q10/063 Primary

  Operations research, analysis or management · CPC title

• G06Q50/22

  Social work or social welfare, e.g. community support activities or counselling services · CPC title